Constructive and adaptable distributed shared memory

Proceedings - 3rd International Workshop on High-Level Parallel Programming Models and Supportive Environments, HIPS 1998

Volumn 1998-March, Issue , 1998, Pages 15-22

  Bataller, Jordi ^a   Bernabeu Auban, José M ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Distributed shared memory; Memory consistency models; Synchronized memory models

Indexed keywords

MEMORY ARCHITECTURE; PARALLEL PROGRAMMING; SEMANTICS;

DISTRIBUTED SHARED MEMORIES (DSM); DISTRIBUTED SHARED MEMORY; EFFICIENT IMPLEMENTATION; MEMORY CONSISTENCY MODELS; MEMORY MODELS; MESSAGE PASSING INTERFACE; MESSAGE PASSING SYSTEMS; SYNCHRONIZATION PRIMITIVE;

MESSAGE PASSING;

EID: 84882588097     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HIPS.1998.665139     Document Type: Conference Paper

References (33)

1. M. Ahamad, G. Neiger, J. Burns, P. Kohli, P. Hutto. Causal memory: Definitions, implementation, programming. Distributed Computing, 9, 1995.
2. H. Attiya and R. Friedman. Limitations of Fast Consistency Conditions for Distributed Shared Memories. Information Processing Letters, 57(5):243-248, Mar. 1996.
3. J. Bataller and J. Bernabeu-Auban. An adaptable DSM model: A formal description. Technical Report II-DSIC-17/97, Dep. de Sistemes Informatics i Computacio (DSIC), Universitat Politecnica de Valencia (Spain), 1997.
4. J. Bataller and J. Bernabeu-Auban. Synchronized DSM models. In Europar'97. Third Intl. Conf. on Parallel Processing, Lecture notes on computer science, pages 468-475. Springer-Verlag, August 1997.
5. J. K. Bennett, J. B. Carter, W. Zwaenepoel. Adaptive software cache management for distributed shared memory architectures. In Proc. of the 17th Annual Int. Symposium on Computer Architecture, pages 125-135, May 1990.
6. J. Bernabeú-Aubán and V. Cholvi-Juan. Formalizing memory coherency models. Journal of Computing and Information, 1(1):653-672, May 1994.
7. B. N. Bershad, M. J. Zekauskas, W. A. Sawdon. The Midway distributed shared memory system. In Proc. of the 38th IEEE Int'l Computer Conf. (COMPCON Spring'93), pages 528-537, Feb. 1993.
8. K. P. Birman and R. van Renesse, editors. Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, 1994.
9. J. Carter, J. Bennett, W. Zwaenepoel. Implementation and performance of Munin. Operating System Review, 25(5):152-164, October 1991.
10. J. B. Carter, J. K. Bennett, W. Zwaenepoel. Techniques for reducing consistency-related communication in distributed shared memory systems. ACM Transactions on Computer Systems, 13(3):205-243, Aug. 1995.
11. S. Chandra, J. R. Larus, A. Rogers. Where is time spent in message-passing and shared-memory programs. In Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 61-73, October 1994.
12. J. Chang and N. Maxemchuck. Reliable broadcast protocols. ACM Trans. on Computer Systems., 2(3):251-273, August 1984.
13. Y. Chang, M. Singhal, M. Liu. An improved o(log(n)) mutual exclussion algorithm for distributed systems. In Proc. of the International Conf. on Parallel Processing, pages 295-302, 1990.
14. M. Dubois, C. Scheurich, F. Briggs. Memory access buffering in multiprocessors. In Proceedings of the 13th Annual Symposium on Computer Architecture, pages 434-442, June 1986.
15. S. Eggers and R. Katz. A characterization of sharing in parallel programs and its application to coherency protocol evaluation. In Proceedings of the 15th Annual International Symposium on Computer Architecture, pages 373-382, 1988.
16. R. Friedman and R. Renesse. Packing messages as a tool for boosting the performance of total ordering protocols. Technical report, Dept. of Computer Science. Cornell University. Ithaca NY, july 1995.
17. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, J. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 15-26. IEEE, April 1990.
18. J. Goodman. Cache consistency and sequential consistency. Technical Report 1006, University of Wisconsin-Madison, February 1991.
19. L. Iftode, J. Singh, K. Li. Scope consistency: A bridge between release consistency and entry consistency. Technical report, Dept. of Computer Science, Princeton Univ., 1996.
20. X. Jia. A total ordering multicast protocol using propagation trees. IEEE Trans. on Parallel and Distributed Systems, 6(6):617-627, 1995.
21. R. John and M. Ahamad. Causal memory: Implementation, programming support and experiences. Technical Report GIT-CC-93/10, College of Computing, Georgia Institute of Technology, 1993.
22. P. Keleher. The Relative Importance of Concurrent Writers and Weak Consistency Models. In Proc. of the 16th Int'l Conf. on Distributed Computing Systems (ICDCS), pages 91-98, May 1996.
23. P. Keleher, A. Cox, S. Dwarkadas, W. Zwaenepoel. TreadMarks: Distributed shared memory on standard workstations and operating systems. In Winter USENIX, 1994.
24. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, 28(9):690-691, September 1979.
25. T. J. LeBlanc and E. P. Markatos. Shared memory vs. message passing in shared-memory multiprocessors. In Fourth Symposium on Parallel and Distributed Processing, December 1992.
26. K. Li and P. Hudak. Memory coherence in shared virtual memory systems. In Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, pages 229-239. ACM, August 1986.
27. R. Lipton and J. Sandberg. PRAM: A scalable shared memory. Technical Report CS-TR-180-88, Princeton University, Department of Computer Science, September 1988.
28. R. Prakash, M. Raynal, M. Singhal. An efficient causal ordering algorithm for mobile computing environments. In Proc. of the 16th Int'l Conf. on Distributed Computing Systems (ICDCS), pages 744-751, May 1996.
29. R. Schwarz and F. Mattern. Detecting causal relationship in distributed computations: In search of the holy grail. Technical Report SFB124-15/92, Department of Computer Science, University of Kaiserslautern, 1992.
30. I. Stoica, R. Yerraballi, R. Mukkamala. A simple ordered and reliable group multicast protocol. Technical Report TR-94-26, Old Dominion University, September 1994.
31. M. Stumm and S. Zhou. Algorithms implementing distributed shared memory. Computer, 23(5):54-64, May 1990.
32. H.-H. Wang and R.-C. Chang. A distributed shared memory system with self-adjusting coherence scheme. Parallel Computing, 20(7):1007-1025, July 1994.
33. W.-D. Weber and A. Gupta. Analysis of cache invalidation patterns in multiprocessors. In Proceedings of the 3rd International Conference on Architectural Support for Programming Languages and Operating System (ASPLOS), pages 243-256, April 1989.