An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementation and performance of Munin
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Lazy release consistency for software distributed shared memory
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Context-sensitive interprocedural points-to analysis in the presence of function pointers
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Efficient context-sensitive pointer analysis for C programs
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
The SPLASH-2 programs: characterization and methodological considerations
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Shasta: a low overhead, software-only approach for supporting fine-grain shared memory
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Compiler-based prefetching for recursive data structures
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Cashmere-2L: software coherent shared memory on a clustered remote-write network
Proceedings of the sixteenth ACM symposium on Operating systems principles
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Comparative study of page-based and segment-based software DSM through compiler optimization
Proceedings of the 14th international conference on Supercomputing
Global optimization by suppression of partial redundancies
Communications of the ACM
Portable Programs for Parallel Processors
Portable Programs for Parallel Processors
Supporting Software Distributed Shared Memory with an Optimizing Compiler
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
InterWeave: A Middleware System for Distributed Shared State
LCR '00 Selected Papers from the 5th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
Global common subexpression elimination
Proceedings of a symposium on Compiler optimization
Improving Release-Consistent Shared Virtual Memory using Automatic Update
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
Efficient Implementation of Software Release Consistency on Asymmetric Distributed Shared Memory
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Efficient, context-sensitive pointer analysis for c programs
Efficient, context-sensitive pointer analysis for c programs
TreadMarks: distributed shared memory on standard workstations and operating systems
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
| Hi-index | 0.01 |
Recent progress in high-speed and high-bandwidth backbone networks has led to computer clusters over wide-area network (WAN), called global computing systems. The shared-memory programming model makes it much easier for programmers to write parallel applications on global computing systems than the message-passing model. The question is whether or not shared-memory parallel programs can run on global computing systems efficiently. This paper proposes techniques for optimizing software distributed shared memory (S-DSM) on global computing systems. Both the compiler optimization and the run-time optimization make the latency of remote-memory access small and provide scalable shared memory. These techniques for optimizing S-DSM system have been implemented, and they are evaluated through the experiments under pseudo WANenvironment using Comet delay.