Efficient computations on fault-prone BSP machines

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient computations on fault-prone BSP machines

Full text

Pdf (1.22 MB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures table of contents

Newport, Rhode Island, United States

Pages: 84 - 93

Year of Publication: 1997

ISBN:0-89791-890-8

Authors

Spyros C. Kontogiannis	Computer Engineering and Informatics Department, Patras University, 26500 Rion, Patras, Greece and Computer Technology Institute, Kolokotroni 3, 26221 Patras, Greece
Grammati E. Pantziou	Computer Technology Institute, Kolokotroni 3, 26221 Patras, Greece
Paul G. Spirakis	Computer Engineering and Informatics Department, Patras University, 26500 Rion, Patras, Greece and Computer Technology Institute, Kolokotroni 3, 26221 Patras, Greece

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 14, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/258492.258501 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AS92	N. Alon and J. Spencer. "The Probabilistic Method", Wiley Interscience, New York, 1992.
	BDM95	Armin Bäumker , Wolfgang Dittrich , Friedhelm Meyer auf der Heide, Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model, Selected papers from the third European symposium on Algorithms, p.175-203, August 1998, Courfu, Greece
	BMS96	Petra Berenbrink , Friedhelm Meyer auf der Heide , Volker Stemann, Fault-Tolerant Shared Memory Simulations, Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, p.181-192, February 22-24, 1996
	CGI96	Bogdan S. Chlebus , Anna Gambin , Piotr Indyk, Shared-Memory Simulations on a Faulty-Memory DMM, Proceedings of the 23rd International Colloquium on Automata, Languages and Programming, p.586-597, July 08-12, 1996
	CGI94	Bogdan S. Chlebus , Anna Gambin , Piotr Indyk, PRAM Computations Resilient to Memory Faults, Proceedings of the Second Annual European Symposium on Algorithms, p.401-412, September 26-28, 1994
	CGP95	Bogdan S. Chlebus , Leszek Gasieniec , Andrzej Pelc, Fast Deterministic Simulation of Computations on Faulty Parallel Machines, Proceedings of the Third Annual European Symposium on Algorithms, p.89-101, September 25-27, 1995
	CLR90	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	GS96	A. Gerbessiotis and C. Siniolakis, "Communication efficient data structures on the BSP model with Applications", Oxford Univ. Technical Report, PRG- TR-13-96, May 1996.
	GT92	Mihály Geréb-Graus , Thanasis Tsantilas, Efficient optical communication in parallel computers, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.41-48, June 29-July 01, 1992, San Diego, California, United States [doi>10.1145/140901.140906]
	GV94	Alexandros V. Gerbessiotis , Leslie G. Valiant, Direct bulk-synchronous parallel algorithms, Journal of Parallel and Distributed Computing, v.22 n.2, p.251-267, Aug. 1994 [doi>10.1006/jpdc.1994.1085]
	KPRS91	Z. M. Kedem , K. V. Palem , A. Raghunathan , P. G. Spirakis, Combining tentative and definite executions for very fast dependable parallel computing, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.381-390, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103459]
	KPS90	Z. M. Kedem , K. V. Palem , P. G. Spirakis, Efficient robust parallel computations, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.138-148, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100231]
	KPS97	S. Kontogiannis, G. Pantziou, P. Spirakis, "EfficientComputations on fault-prone BSP machines", CTI-TR 97.01.06. Also available through ht tp ://www. ce id. upatras, gr/#k ont og/bsp, ps
	KS91	Paris C. Kanellakis , Alex A. Shvartsman, Efficient parallel algorithms on restartable fail-stop processors, Proceedings of the tenth annual ACM symposium on Principles of distributed computing, p.23-36, August 19-21, 1991, Montreal, Quebec, Canada [doi>10.1145/112600.112603]
	KS92	Paris C. Kanellakis , Alex A. Shvartsman, Efficient parallel algorithms can be made robust, Distributed Computing, v.5 n.4, p.201-217, April 1992 [doi>10.1007/BF02277667]
	Mc94	W.F. McColl, "Scaleable Parallel Computing: A grand unified theory and its practical development", In the Proc. of IFIP World Congress, 1, pp. 539-546, Hamburg, August, 1994.
	MR95	Rajeev Motwani , Prabhakar Raghavan, Randomized algorithms, Cambridge University Press, New York, NY, 1995
	R89	Michael O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, Journal of the ACM (JACM), v.36 n.2, p.335-348, April 1989 [doi>10.1145/62044.62050]
	SS94	M. Sipser and D. Spielman, "Expander codes", in the Proc. of 35th Ann. Syrup. on Foundations of Computer Science, (1994), pp. 566-576.
	V90a	Leslie G. Valiant, A bridging model for parallel computation, Communications of the ACM, v.33 n.8, p.103-111, Aug. 1990 [doi>10.1145/79173.79181]
	V90b	L. G. Valiant, General purpose parallel architectures, Handbook of theoretical computer science (vol. A): algorithms and complexity, MIT Press, Cambridge, MA, 1991