Article

Free access

“Dynamic-fault-prone BSP”: a paradigm for robust computations in changing environments

Authors:

Spyros C. Kontogiannis,

Grammati E. Pantziou,

Paul G. Spirakis,

Moti YungAuthors Info & Claims

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

Pages 37 - 46

https://doi.org/10.1145/277651.277666

Published: 01 June 1998 Publication History

PDF eReader

References

[1]

Y. Aumann, M. Bender, L. Zhang. "Efficient execution of non-deterministic parallel programs on asynchronous systems". In the Proceedings of Proceedings the 8th A CM Symposium on Parallel Algorithms and Architectures, 1996, pp. 270-276.

Digital Library

Google Scholar

[2]

Y. Aumann, Z. Kedem, K. Palem, M. Rabin. "Highly efficient asynchronous execution of large-grained parallel programs". In Proceedings of the 3#th Annual Symposium on Foundations of Computer Science, 1993.

Digital Library

Google Scholar

[3]

A. Baumker, W. Dittrich, and F. Meyer auf der Heide, "Truly efficient parallel algorithms: c-optimal multisearch for an extension of the B SP model". In the Proceedings of the 3rd Ann. European Symposium on Algorithms, 1995, Springer Verlag LNCS 979, pp. 17-30.

Digital Library

Google Scholar

[4]

R. Blumofe, C. Leiserson, "Scheduling multithreaded computations by work stealing". In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 356-368.

Digital Library

Google Scholar

[5]

B. Chlebus, L. Gasieniec, and A. Pelc, "Fast Deterministic Simulation of Computations on Faulty Parallel Machines". In Proceedings of the 3rd Ann. European Symposium on Algorithms, 1995, Springer Verlag LNCS 979, pp. 89-101.

Digital Library

Google Scholar

[6]

C. Dwork, J. Halpern, and O. Waarts, "Performing Work Efficiently in the Presence of Faults". In Proceedings Of thellth ACM Symposium on Principles o/Distributed Computing, 1992.

Digital Library

Google Scholar

[7]

P. Dasgupta, Z. Kedem, M. Rabin. "Parallel processing on networks of workstations: a fault tolerant, high performance approach", tn Proceedings of the the 15th International Conference on Distributed Systems, 1995.

Digital Library

Google Scholar

[8]

D. Dubhashi, V. Priebe, D. Ranjan. "Negative Dependence through the FKG Inequality". BRICS Report Series, RS-96-27, ISSN 0909-0878.

Google Scholar

[9]

D. Dubhashi, D. Ranjan. "Balls and Bins: A study in Negative Dependence". BRICS Report Series, RS-96-25, ISSN 0909-0878.

Google Scholar

[10]

Z. Galil, A. Mayer, M. Yung. "Resolving Message Complexity of Byzantine Agreement and beyond". In Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science, 1995.

Digital Library

Google Scholar

[11]

A. Gerbessiotis and C. Siniolakis, "Communication efficient data structures on the B SP model with Applications". Oxford Univ. Technical Report, PRG-TR-13-96, May 1996.

Google Scholar

[12]

A. Kamath, R. Motwani,K. Palem,P. Spirakis. "Tail bound for occupancy and the satisfiability threshold conjecture". In Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science, 1994, pp. 592-603.

Digital Library

Google Scholar

[13]

Z. Kedem, K. Palem, A. Raghunathan, and P. Spirakis, "Combining tentative and definite executions for very fast dependable parallel computing". In Proceedings of the 23rd Ann. ACM Symposium on Theory of Computing, 1991, pp. 381-390.

Digital Library

Google Scholar

[14]

Z. Kedem, K. Palem, and P. Spirakis, "Efficient robust parallel computations". In Proceedings of the 22nd Ann. ACM Symposium on Theory of Computing, 1990, pp. 138- 148.

Digital Library

Google Scholar

[15]

S. Kontogiannis, G. Pantziou and P. Spirakis. "Efficient Computations on Fault-Prone BSP Machines". In Proceedings of the 9th A CM Symposium on Parallel Algorithms and Architectures, 1997. Full version at http : //www. ceid. upatras, gr/#kontog/bsp/spaa97/

Digital Library

Google Scholar

[16]

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/spaa981

Digital Library

Google Scholar

[17]

P. Kanellakis and A. Shvartsman. "Efficient parallel algorithms on restartable fail-stop processors". In Proceedings of the 10th Ann. A CM Symposium on Principles of Distributed Computing, 1991, pp. 23-36.

Digital Library

Google Scholar

[18]

P. Kanellakis and A. Shvartsman. "Efficient parallel algorithms can be made robust". Distributed Computing, 5, 1992, pp. 201-217.

Digital Library

Google Scholar

[19]

R. Motwani and P. Raghavan. "Randomized Algorithms". Cambridge University Press 1995.

Digital Library

Google Scholar

[20]

Ft. De Prisco, A. Mayer and M. Yung. "Time-Optimal Message-Efficient Work Performance in the Presence of Faults". In Proceedings of the A CM Symposium of Distributed Computing, 1994.

Digital Library

Google Scholar

[21]

M. Rabin. "Efficient dispersal of information for security, load balancing and fault tolerance". In Journal of the Association for Computing Machinery, Vol. 36, No. 2, April 1989, pp. 335-348.

Digital Library

Google Scholar

[22]

L. Valiant. "A bridging model of parallel computation". In Communications o} the ACM, 33(8):103-111, August 1990.

Digital Library

Google Scholar

[23]

L. Valiant. "General purpose parallel architectures". In Handbook of Theoretical Computer Science, J. van Leeuwen ed., North Holland, 1990.

Digital Library

Google Scholar

Cited By

View all

Chlebus BDobrev SKowalski DMalewicz GShvartsman AVrto IRosenberg A(2001)Towards practical deteministic write-all algorithmsProceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures10.1145/378580.378685(271-280)Online publication date: 3-Jul-2001
https://dl.acm.org/doi/10.1145/378580.378685

Index Terms

“Dynamic-fault-prone BSP”: a paradigm for robust computations in changing environments
1. Computing methodologies
  1. Concurrent computing methodologies
    1. Concurrent programming languages
  2. Modeling and simulation
    1. Simulation support systems
      1. Simulation environments
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Concurrent programming languages

Recommendations

Fully Scalable Fault-Tolerant Simulations for BSP and CGM

In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The BSP (or CGM) machine is a parallel multicomputer consisting of p processors for which a memory of n ...
H-BSP: A Hierarchical BSP Computation Model

This paper presents a new parallel computing model, called H-BSP, which adds a hierarchical concept to the BSP(Bulk Synchronous Parallel) computing model. An H-BSP program consists of a number of BSP groups which are dynamically created at run time and ...
Portable and Efficient Parallel Computing Using the BSP Model

The Bulk-Synchronous Parallel (BSP) model was proposed by Valiant as a standard interface between parallel software and hardware. In theory, the BSP model has been shown to allow the asymptotically optimal execution of architecture-independent software ...

Comments

Information & Contributors

Information

Published In

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

June 1998

312 pages

ISBN:0897919890

DOI:10.1145/277651

Chairmen:
Gary Miller
Carnegie Mellon Univ., Pittsburgh, PA
,
Phillip B. Gibbons
Bell Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA/PODC98

Sponsor:

SPAA/PODC98: 10th Annual ACM Symposium on Parallel Algorithms and Architectures/Symposium on Principles of Distributed Computing

June 28 - July 2, 1998

Puerto Vallarta, Mexico

Acceptance Rates

SPAA '98 Paper Acceptance Rate 30 of 84 submissions, 36%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
245
Total Downloads

Downloads (Last 12 months)23
Downloads (Last 6 weeks)7

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chlebus BDobrev SKowalski DMalewicz GShvartsman AVrto IRosenberg A(2001)Towards practical deteministic write-all algorithmsProceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures10.1145/378580.378685(271-280)Online publication date: 3-Jul-2001
https://dl.acm.org/doi/10.1145/378580.378685

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fully Scalable Fault-Tolerant Simulations for BSP and CGM

H-BSP: A Hierarchical BSP Computation Model

Portable and Efficient Parallel Computing Using the BSP Model