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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on communications Ročník 71; číslo 7; s. 1
Hlavní autori:	Li, Congduan, Zhang, Yiqian, Tan, Chee Wei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.07.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!