loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
3rd Euromicro Workshop on Parallel and Distributed Processing
Dependable parallel computing with agents based on a task graph model
San Remo, Italy
January 25-January 27
ISBN: 0-8186-7031-2
S. Chabridon, UFR de Math. et Inf., Univ. Rene Descartes, Paris, France
E. Gelenbe, UFR de Math. et Inf., Univ. Rene Descartes, Paris, France
We discuss a novel technique for improving the dependability of parallel programs executing on a MIMD shared memory architecture. The idea is to empower certain tasks of each application program to carry out failure detection, and to reschedule the execution of those tasks which are considered to have failed. The technique we propose is based on a task graph representation of the parallel program, in which communications between tasks have been voluntarily isolated to the end of each task which is being considered. We propose and evaluate several algorithms which can detect failures and restart failed tasks. A discrete-event simulator is used to evaluate the performance under the effect of failures, with the use of our detection and restart algorithms, of a specific parallel application: the fast Fourier transform.
Index Terms:
discrete event simulation; parallel programming; software performance evaluation; parallel processing; dependable parallel computing; agents; task graph model; parallel programs; MIMD shared memory architecture; application program; failure detection; discrete-event simulator; performance evaluation; fast Fourier transform
Citation:
S. Chabridon, E. Gelenbe, "Dependable parallel computing with agents based on a task graph model," pdp, pp.350, 3rd Euromicro Workshop on Parallel and Distributed Processing, 1995
Usage of this product signifies your acceptance of the Terms of Use.