Using alternative schedules for fault tolerance in parallel programs on a network of workstations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1470)
Unable to display preview. Download preview PDF.
- 1.A. Acharya, G. Edjlali, and J. Saltz. The utility of exploiting idle workstations for parallel computation. In Proceedings of the ACM Sigmetrics Int’l Conf. on Measurement and Modeling of Computer Systems ’97, Seattle, June 1997.Google Scholar
- 2.B. Kruatrachue and T. Lewis. Grain size determination for parallel programs. IEEE Software, pages 23–32, Jan 1988.Google Scholar
- 3.H. El-Rewini, T. Lewis, and H. H. Ali. Task Scheduling for Parallel and Distributed Systems. Englewood Cliffs, NJ: Prentice-Hall, 1994.Google Scholar
- 4.G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.Google Scholar
© Springer-Verlag Berlin Heidelberg 1998