“Dynamic-fault-prone BSP”: a paradigm for robust computations in changing environments
暂无分享,去创建一个
Paul G. Spirakis | Moti Yung | Grammati E. Pantziou | Spyros C. Kontogiannis | M. Yung | P. Spirakis | G. Pantziou | S. Kontogiannis
[1] Paul G. Spirakis,et al. Efficient computations on fault-prone BSP machines , 1997, SPAA '97.
[2] Alexander A. Shvartsman,et al. Efficient parallel algorithms on restartable fail-stop processors , 1991, PODC '91.
[3] Devdatt P. Dubhashi,et al. Negative dependence through the FKG Inequality , 1996 .
[4] Moti Yung,et al. Resolving message complexity of Byzantine Agreement and beyond , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[5] Leslie G. Valiant,et al. A bridging model for parallel computation , 1990, CACM.
[6] Leslie G. Valiant,et al. General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[7] Paul G. Spirakis,et al. Tail bounds for occupancy and the satisfiability threshold conjecture , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[8] Friedhelm Meyer auf der Heide,et al. Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model , 1998, Theor. Comput. Sci..
[9] Alexandros V. Gerbessiotis,et al. Communication Efficient Data Structures on the BSP Model with Applications in Computational Geometry , 1996, Euro-Par, Vol. II.
[10] Moti Yung,et al. Time-optimal message-efficient work performance in the presence of faults , 1994, PODC '94.
[11] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[12] Michael O. Rabin,et al. Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.
[13] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[14] Joseph Y. Halpern,et al. Performing work efficiently in the presence of faults , 1992, PODC '92.
[15] Alexander A. Shvartsman,et al. Efficient parallel algorithms can be made robust , 1989, PODC '89.
[16] Z. M. Kedem,et al. Combining tentative and definite executions for very fast dependable parallel computing , 1991, STOC '91.
[17] Robert D. Blumofe,et al. Scheduling multithreaded computations by work stealing , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[18] Yonatan Aumann,et al. Highly efficient asynchronous execution of large-grained parallel programs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[19] Paul G. Spirakis,et al. Efficient robust parallel computations , 2018, STOC '90.
[20] Desh Ranjan,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.
[21] Michael A. Bender,et al. Efficient execution of nondeterministic parallel programs on asynchronous systems , 1996, SPAA '96.
[22] Partha Dasgupta,et al. Parallel processing on networks of workstations: a fault-tolerant, high performance approach , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.
[23] Andrzej Pelc,et al. Fast Deterministic Simulation of Computations on Faulty Parallel Machines , 1995, ESA.
[24] Richard J. Lipton,et al. Proceedings of the tenth annual ACM symposium on Theory of computing , 1978 .