Browsing by Subject "Message passing algorithm"
Now showing items 1-2 of 2
-
Article
Coordinated cooperative task computing using crash-prone processors with unreliable multicast
(2017)This paper presents a new message-passing algorithm, called Do-UM, for distributed cooperative task computing in synchronous settings where processors may crash, and where any multicasts (or broadcasts) performed by crashing ...
-
Conference Object
Coordinated cooperative work using undependable processors with unreliable broadcast
(IEEE Computer Society, 2014)With the end of Moore's Law in sight, parallelism became the main means for speeding up computationally intensive applications, especially in the cases where large collections of tasks need to be performed. Network ...