On synchronisation in fault-tolerant data and compute intensive programs over a network of workstations [chapter]

J. Smith
1997 Lecture Notes in Computer Science  
An application structured as a fault-tolerant bag of tasks adapts easily to changing resources. To be represented by a single bag of tasks, a computation must decompose into purely independent tasks. The work summarised here investigates performance of structuring approaches applicable where this ideal is not possible, partly through analysis and partly through measurements of a realistic fault-tolerant computation.
doi:10.1007/bfb0002847 fatcat:vtqnjbs4f5br7a7yugj3dn26ou