How to Share Memory in a Distributed System (A Preliminary Version)
暂无分享,去创建一个
[1] Frank Thomson Leighton,et al. Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.
[2] Uzi Vishkin,et al. A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer , 2011, Theor. Comput. Sci..
[3] Avi Wigderson,et al. Superconcentrators, generalizers and generalized connectors with limited depth , 1983, STOC.
[4] Eli Upfal,et al. A probabilistic relation between desirable and feasible, models of parallel computation , 1984, STOC '84.
[5] Stephen A. Cook,et al. Bounds on the time for parallel RAM's to compute simple functions , 1982, STOC '82.
[6] David J. Kuck,et al. A Survey of Parallel Machine Organization and Programming , 1977, CSUR.
[7] Robert H. Thomas,et al. A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..
[8] Ralph Grishman,et al. The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer , 1983, IEEE Transactions on Computers.
[9] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[10] Uzi Vishkin,et al. Implementation of Simultaneous Memory Address Access in Models That Forbid It , 1983, J. Algorithms.
[11] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..