Using Remote Access Histories for Thread Scheduling in Distributed Shared Memory Systems

We developed the remote access histories mechanism (rahm). a technique that can be used to dynamically, adaptively. and transparently improve the locality of memory references in distributed shared memory systems (dsms). The rahm helps the run-time system make correct decisions concerning the redistribution of threads to hosts — operations that typically involve high overhead.

[1]  Assaf Schuster,et al.  Thread migration and its applications in distributed shared memory systems , 1998, J. Syst. Softw..

[2]  Assaf Schuster,et al.  Supporting multiple parallel programming paradigms on top of the Millipede virtual parallel machine , 1997, Proceedings Second International Workshop on High-Level Parallel Programming Models and Supportive Environments.

[3]  Jeffrey S. Chase,et al.  The Amber system: parallel programming on a network of multiprocessors , 1989, SOSP '89.

[4]  Ce-Kuen Shieh,et al.  Load balancing in distributed shared memory systems , 1997, 1997 IEEE International Performance, Computing and Communications Conference.

[5]  Tzi-cker Chiueh,et al.  A compiler-directed distributed shared memory system , 1995, ICS '95.

[6]  Anoop Gupta,et al.  Data locality and load balancing in COOL , 1993, PPOPP '93.

[7]  Larry Rudolph,et al.  ParC - An Extension of C for Shared Memory Parallel Processing , 1996, Softw. Pract. Exp..

[8]  Roy Friedman,et al.  MILLIPEDE: Easy Parallel Programming in Available Distributed Environments , 1997 .

[9]  Wilson C. Hsieh,et al.  Dynamic Computation Migration in DSM Systems , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[10]  Anne Rogers,et al.  Software caching and computation migration in Olden , 1995, PPOPP '95.