Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung  Home/Search
Context Related
| cs.uoi.gr/~kontog/pubs/spaa98.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.uoi.gr/~kontog/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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-faultprone BSP machines. The fault occurrences are fail-stop 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... (Update)
Context of citations to this paper: More
.... of an input BSP algorithm as long as at least a specific number of the initially considered processors remain live, was proposed in [67]. The proposed strategy is a modular and efficient simulation scheme which, compared to an optimal off line adversarial computation under...
Cited by: More
"Dynamic-Fault-Prone BSP": a paradigm for robust.. - Kontogiannis.. (Correct)
Towards Practical Deterministic - Write-All Algorithms Bogdan (Correct)
Towards Practical Deterministic Write-All Algorithms - Chlebus, Dobrev, Kowalski, .. (2001) (Correct)
Similar documents (at the sentence level):
25.0%: Robust Parallel Computations through Randomization - Kontogiannis, Pantziou.. (2000) (Correct)
Active bibliography (related documents): More All
0.7: Communication-Efficient Bulk Synchronous Parallel Algorithms - Huang (2001) (Correct)
0.4: Efficient Computations on fault-prone BSP machines - Kontogiannis, Pantziou.. (1997) (Correct)
0.3: Efficient Asynchronous Consensus with the Value-Oblivious.. - Aumann, Bender (1996) (Correct)
Similar documents based on text: More All
0.4: The Fourth Moment in Luby's Distribution - Dubhashi, Pantziou, Spirakis.. (1995) (Correct)
0.3: Frequency Assignment in Mobile and Radio Networks - Fotakis, Pantziou.. (1998) (Correct)
0.3: Hammock-on-Ears Decomposition: A Technique for the Efficient.. - Kavvadias, al. (1996) (Correct)
Related documents from co-citation: More All
6: A bridging model for parallel computation (context) - Valiant - 1990
5: The Art of Computer Programming Vol (context) - Knuth - 1968
5: Parallel processing on networks of workstations: A fault-tolerant - Dasgupta, Kedem et al. - 1995
BibTeX entry: (Update)
S. Kontogiannis, G. Pantziou and P. Spirakis, M Yung. "Dynamic-Fault-Prone BSP: a paradigm for robust computations in changing environments". Full version, at http://www.ceid.upatras.gr/kontog/bsp/spaa98/ http://citeseer.ist.psu.edu/711228.html More
@inproceedings{ kontogiannis98dynamicfaultprone,
author = "Spyros C. Kontogiannis and Grammati E. Pantziou and Paul G. Spirakis and Moti Yung",
title = "Dynamic-Fault-Prone {BSP}: a paradigm for robust computations in changing environments",
booktitle = "Proceedings of the 10th Annual {ACM} Symposium on Parallel Algorithms and Architectures",
month = "22--25,",
address = "Puerto Vallarta, Mexico",
pages = "37--46",
year = "1998",
url = "citeseer.ist.psu.edu/711228.html" }
Citations (may not include all citations):735 A bridging model of parallel computation (context) - Valiant - 1990
234 General purpose parallel architectures (context) - Valiant - 1990
157 Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1994
132 Randomized Algorithms (context) - Motwani, Raghavan - 1995
60 Efficient dispersal of information for security, load balanc.. (context) - Rabin - 1989
57 Tail bound for occupancy and the satisfiability threshold co.. - Kamath, Motwani et al. - 1994
56 Efficient robust parallel computations (context) - Kedem, Palem et al. - 1990
43 Parallel processing on networks of workstations: a fault tol.. - Dasgupta, Kedem et al. - 1995
40 Efficient parallel algorithms can be made robust (context) - Kanellakis, Shvartsman - 1992
40 Truly efficient parallel algorithms: c-optimal multisearch f.. (context) - Baumker, Dittrich et al. - 1995
32 Highly efficient asynchronous execution of large-grained par.. - Aumann, Kedem et al. - 1993
29 Communication efficient data structures on the BSP model wit.. - Gerbessiotis, Siniolakis - 1996
27 Balls and Bins: A study in Negative Dependence - Dubhashi, Ranjan
25 Resolving Message Complexity of Byzantine Agreement and beyo.. - Galil, Mayer et al. - 1995
24 Combining tentative and definite executions for very fast de.. - Kedem, Palem et al. - 1991
14 Performing Work Efficiently in the Presence of Faults - Dwork, Halpern et al. - 1992
13 Fast Deterministic Simulation of Computations on Faulty Para.. - Chlebus, Gasieniec et al. - 1995
11 Time-Optimal Message-Efficient Work Performance in the Prese.. - De Prisco, Mayer et al. - 1994
6 Dynamic-Fault-Prone BSP: a paradigm for robust computations .. - Kontogiannis, Pantziou et al. - 1991
6 Efficient execution of non-deterministic parallel programs o.. - Aumann, Bender et al. - 1996
4 Negative Dependence through the FKG Inequality - Dubhashi, Priebe et al.
4 Efficient Computations on Fault-Prone BSP Machines - Kontogiannis, Pantziou et al. - 1997
Documents on the same site (http://www.cs.uoi.gr/~kontog/index.htm): More
The Structure and Complexity of Nash Equilibria.. - Fotakis.. (2002) (Correct)
Evolutionary Games: What is the algorist's perspective? - Kontogiannis, Spirakis (Correct)
Selfish Unsplittable Flows - Fotakis, Kontogiannis, Spirakis (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC