Fault-Tolerant Computation Meets Network Coding: Optimal Scheduling in Parallel Computing

In large-scale parallel computing systems, machines and the network suffer from non-negligible faults, often leading to system crashes. The traditional method to increase reliability is to restart the failed jobs. To avoid unnecessary time wasted on reboots, we propose an optimal scheduling strategy...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications Jg. 71; H. 7; S. 1
Hauptverfasser:	Li, Congduan, Zhang, Yiqian, Tan, Chee Wei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.07.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Chinese Remainder Theorem Coding Crashes Cryptography Encoding Failure rates Fault tolerance Fault Tolerant Control Fault tolerant systems Large Integer Multiplication Network coding Optimal scheduling Optimization Parallel Computing Parallel processing Performance evaluation Redundancy Reliability Restarting Run time (computers) Scheduling
ISSN:	0090-6778, 1558-0857
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!