Z. M. Kedem
P. G. Spirakis
- ACS87.A. Aggarwal, A. Chandra, and M. Snir, "Hierarchical Memory with Block transfer," Proc. #Sth IEEE Syrup. on Foundation8 of Computer Science, pp. 204--216, 1987.Google Scholar
- AHU74.A. Aho, 3. ttopcroft, and 3. Ullman, "The Design and Analysis of Computer Algorithma," Addison-Wesley, 1974. Google ScholarDigital Library
- BHG87.P. Bernstein, V. Had#ilacos, and N. Goodman, Concurrency Control and Recorery in Database Systems, Addison-Wesley, 1987. Google ScholarDigital Library
- Br74.R. Brent, "The Parallel Evaluation of General Arithmetic Expressions," JACM, vo}. 21, no. 3, pp. 201-206, 1974. Google ScholarDigital Library
- CDR86.S. Cook, C. Dwork, and 1%. Reischuk, "Upper and Lower time Bounds for P#rallel Rsndom Access Machines without Simultaneous Writes," SIAM J. Comp#ing, vol. 15, no. 1, pp. 87-97, 1986. Google ScholarDigital Library
- CGM88.W. Cellary, E. Gelenbe, and T. Morzy, Concurrency Control in Distributed Database Systems, North-Holland, 1988. Google ScholarDigital Library
- CZ89.R. Cole and O. Zajicek, "The APRAM: Incorporating Asynchrony into the PRAM Model," Proc. 1989 A CM Syrup. on Parallel Algorithms and Architec#ul'es, pp. 170-178, 1989. Google ScholarDigital Library
- CZ90.It. Cole and O. Zsjicek, "The Expected Advantage of Asynchrony," Proc. #nd Annual A CM Syrup. on Parallel Algorithms and Architectures, pp. 85-94, 1990. Google ScholarDigital Library
- FW78.S. Fortune and J. Wyllie, "Parallelism in Random Access Machines," Proc. l Oth ACM Syrup. on Theory of Computing, pp. 114-118, 1978. Google ScholarDigital Library
- Gi89.P. Gibbons, "A More Practical PRAM Model," Proc. 1989 A CM Syrup. on Parallel Algorithms and Architectures, pp. 158-168, 1989. Google ScholarDigital Library
- Je90.D. Jefferson, "Virtual Time II: Storage Management in Distributed Simulation,# Proc. #th A CM Syrup. on Principles of Distributed Computing, pp. 75-89, 1990. Google ScholarDigital Library
- KS89.P. Kanellakis and A. Shvartsman, "Efficient Parallel Algorithms Can be Made Robust,# Tech. Rep. CS-89-35, Brown Univ., pp. 1- 28, October 24, 1989. (Preliminary version appeared in Proc, 8th A UM Syrup, on Principlea of Distributed Computing, pp. 211- 222, 1989.) Google ScholarDigital Library
- KS90.P. Kaaellakis and A. Shvartsman, "On Efficient Parallel Algorithms in the Presence of Omission Errors,# Unpnblished manuscript, October 9, 1990.Google Scholar
- KPS90.Z. Kedem, K. Palem, and P. Spirakis, "Efficient Robust Parallel Computations," Proc. #nd A CM Symp. on Theory of Computing, pp. 138-148, 1990. Google ScholarDigital Library
- MPS89.C. Martel, A. Park, and R. Subramonian, "Fast Asynchronous Algorithms for Shared Memory Parallel Computers," Tech. Rep. CSE-89-8, Univ. of California-Daviz, pp. 1- 17, july 25, 1989.Google Scholar
- MSP90.C. Martel, It. Subramonian, and A. Park, "Asynchronous PRAMs are (Almost) as Good as Synchronous PRAMs," Proc. 3#nd IEEE Syrup. on Foundations of Computer Science, pp. 590-599, 1990.Google Scholar
- Ni90.N. Nishimura, "Asynchronous Shared Memory Parallel Computations," Proc. Snd Annual A CM Syrup. on Parallel Algorithms and Architectures, pp. 76-84, 1990. Google ScholarDigital Library
- Rab89.M. Rabin, "Efficient Dispersal of informatio'n for Security, Load Balancing and Fault Tolerance," JACM, vol. 30, no. 2, pp. 335- 348, 1989. Google ScholarDigital Library
- Ran87.A. Ranade, "How to Emulate Shared Memory," Proc. 28th IEEE Symp. on Foundation8 of Computer Science, pp. 185-194, 1987.Google Scholar
- Sh89.A. Shvartsman, "Achieving Optimal CRCW Fault-tolerance," Tech. Rep. CS-89-#9, Brown Univ., pp. 1-8, December 22, 1989. Google ScholarDigital Library
- ST90.D. Shasha and J. Turek, "Beyond Fail-stop: Wait-free SeriMizability and Resiliency in the Presence of Slow-down Failures,# Tech. Rep. 51#, Dept. of Computer Science, New York Univ., pp. 1-22, September, 1990. Google ScholarDigital Library
- Va90.L. Valiant, "A Bridging Model for Parallel Computation," CA CM, vol. 33, no. 8, pp. 103-111, 1990. Google ScholarDigital Library
Index Terms
- Combining tentative and definite executions for very fast dependable parallel computing
Recommendations
A Block FSAI-ILU Parallel Preconditioner for Symmetric Positive Definite Linear Systems
A novel parallel preconditioner for symmetric positive definite matrices is developed coupling a generalized factored sparse approximate inverse (FSAI) with an incomplete LU (ILU) factorization. The generalized FSAI, called block FSAI, is derived by ...
On the HSS iteration methods for positive definite Toeplitz linear systems
We study the HSS iteration method for large sparse non-Hermitian positive definite Toeplitz linear systems, which first appears in Bai, Golub and Ng's paper published in 2003 [Z.-Z. Bai, G.H. Golub, M.K. Ng, Hermitian and skew-Hermitian splitting ...
Comments