Contention elimination by replication of sequential sections in distributed shared memory programs

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2001, Pages 53-61

  Lu, H ^a   Cox, A L ^a   Zwaenepoel, W ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER WORKSTATIONS; DATA REDUCTION; PROGRAM COMPILERS; STORAGE ALLOCATION (COMPUTER);

SHARED MEMORY PROGRAMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0034832685     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/379539.379568     Document Type: Conference Paper

References (25)

1. A unified formalization of four shared-memory models
2. Automatic partitioning of parallel loops and data arrays for distributed shared memory multiprocessors
3. Interprocedural compilation of irregular applications for distributed memory machines
4. Communication optimization and code generation for distributed memory machines
5. The SUIF compiler for scalable parallel machines
6. TreadMarks: Shared memory computing on networks of workstations
7. Global optimizations for parallelism and locality on scalable parallel machines
8. Replicated distributed programs
9. Faster sequential genetic linkage computations
10. Index array flattening through program transformation
11. The effect of contention on the scalability of page-based software shared memory systems
12. Parallelization of general linkage analysis problems
13. Replicated distributed process in Manetho
14. Memory consistency and event ordering in scalable shared-memory multiprocessors
15. Lazy release consistency for software distributed shared memory
16. Treadmarks: Distributed shared memory on standard workstations and operating systems
17. Strategies for multilocus linkage analysis in humans
18. Compiling communication-efficient programs for massively parallel machines
19. OpenMP on networks of workstations
20. Multiprocessors and run-time compilation
21. Using multicast and multithreading to reduce communication in software DSM systems
22. Give-N-take - A balanced code placement framework
23. The SPLASH-2 programs: Characterization and methodological considerations