An application-level dependable technique for farmer-worker parallel programs
An application-level technique is described for farmer-worker parallel applications which allows a worker to be added or removed from the computing farm at any moment of the run time without affecting the overall outcome of the computation. The technique is based on uncoupling the farmer from the workers by means of a separate module which asynchronously feeds these latter with new “units of work” on an on-demand basis, and on a special feeding strategy based on bookkeeping the status of each work-unit. An augmentation of the LINDA model is finally proposed to exploit the bookkeeping algorithm for tuple management.
Unable to display preview. Download preview PDF.
- 1.Carriero, N., Gelernter, D. How to write parallel programs: a guide to the perplexed. ACM Comp. Surv. 21 (1989) 323–357Google Scholar
- 2.Carriero, N., Gelernter, D. Linda in context. CACM 32 (1989) vol.4 444–558Google Scholar
- 3.Johnson, B.W.: Design and analysis of fault-tolerant digital systems. (Addison-Wesley, New York, 1989)Google Scholar
- 4.De Florio, V., Murgolo, F.P., Spinelli, V.: PvmLinda: Integration of two different computation paradigms. Proc. First EuroMicro Conf. on Massively Parallel Computing Systems, Ischia, Italy, 2–6 May 1994Google Scholar
- 5.Anonymous. Embedded Parix Programmer's Guide. In Parsytec CC Series Hardware Documentation. (Parsytec GmbH, Aachen, 1996)Google Scholar
- 6.Anonymous. PowerPVM/EPX for Parsytec CC Systems. (Genias Software GmbH, Neutraubling, 1996)Google Scholar