Sciweavers

Share
MST
2000

Robust Parallel Computations through Randomization

9 years 3 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-prone BSP machines. The fault occurrences are failstop and fully dynamic, i.e., they are allowed to happen on-line at any point of the computation, subject to the constraint that the total number of faulty processors may never exceed a known fraction. The computational paradigm can be exploited for robust computations over virtual parallel settings with a volatile underlying infrastructure, such as a NETWORK OF WORKSTATIONS (where workstations may be taken out of the virtual parallel machine by their owner). Our simulation strategy is Las Vegas (i.e., it may never fail, due to backtracking operations to robustly stored instances of the computation, in case of locally unrecoverable situations). It adopts an adaptive balancing scheme of the workload among the currently live processors of the BSP machine. Our str...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where MST
Authors Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung
Comments (0)
books