Practical constructive schemes for deterministic shared-memory access

Theory of Computing Systems

Volumn 30, Issue 1, 1997, Pages 3-37

  Pietracaprina, A ^a   Preparata, F P ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b Brown University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

ADDRESS COMPUTATION; EXPLICIT SCHEME; INTERNAL STORAGE; MEMORY MAP; MEMORY MODULES; SHARED MEMORY;

MEMORY ARCHITECTURE;

EID: 0031476207     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679451     Document Type: Article

References (20)

1. H. Alt, T. Hagerup, K. Mehlhorn, and F. P. Preparata. Deterministic simulation of idealized parallel computers on more realistic ones. SIAM Journal on Computing, 16(5):808-835, 1987.
2. Y. Aumann and A. Schuster. Improved memory utilization in deterministic PRAM simulations. Journal of Parallel and Distributed Computing, 12:146-151, 1990.
3. E. R. Berlekamp. Algebraic Coding Theory. McGraw-Hill, New York, 1968.
4. M. Dietzfelbinger and F. Meyer auf der Heide. Simple, efficient shared memory simulations. Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, pages 110-119, 1993.
5. D. K. Gifford. Weighted voting for replicated data. Proc. 7th ACM Symp. on Operating System Principles, pages 150-159, 1979.
6. D. Gorenstein. Finite Groups. Harper and Row, New York, 1968.
7. K. T. Herley. Efficient simulations of small shared memories on bounded degree networks. Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 390-395, 1989.
8. K. T. Herley. Space-efficient representations of shared data for parallel computers. Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, pages 407-416, 1990.
9. K. Herley and G. Bilardi. Deterministic simulations of PRAMs on bounded-degree networks. SIAM Journal on Computing, 23(2):276-292, April 1994.
10. D. R. Hughes and F. C. Piper. Design Theory. Cambridge University Press, Cambridge, MA, 1985.
11. D. J. Kuck. A survey of parallel machine organization and programming. ACM Computing Surveys, 9(1):29-59, March 1977.
12. F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAMs in VLSI. Algorithmica, 5(4):529-544, 1990.
13. K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339-374, 1984.
14. M. Morgenstern. Natural bounded concentrators. Combinatorica, 15(1):111-122, 1995.
15. A. Pietracaprina and F. P. Preparata. An O(√n)-worst-case-time solution to the granularity problem. In K. W. Wagner P. Enjalbert, A. Finkel, editor, Proc. 10th Symp. on Theoretical Aspects of Computer Science, pages 110-119, Würzburg, February 1993. LNCS 665, Springer-Verlag, Berlin.
16. A. Pietracaprina and G. Pucci. Tight bounds on deterministic PRAM emulations with constant redundancy. In J. V. Leeuwen, editor, Proc. 2nd European Symp. on Algorithms, pages 319-400, Utrecht, September 1994. LNCS 855, Springer-Verlag, Berlin.
17. A.G. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42:307-326, 1991. See also Proc. 28th IEEE Symp. on Foundations of Computer Science, pages 185-194, 1987.
18. A.G. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42:307-326, 1991. See also Proc. 28th IEEE Symp. on Foundations of Computer Science, pages 185-194, 1987.
19. R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Databases Systems, 4(2):180-209, 1979.
20. E. Upfal and A. Widgerson. How to share memory in a distributed system. Journal of the ACM, 34(1):116-127, 1987.