Comparative study of page-based and segment-based software DSM through compiler optimization

Authors:
Junpei Niwa;Takashi Matsumoto;Kei Hiraki
Affiliations:
Department of Information Science, Faculty of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, Japan;Department of Information Science, Faculty of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, Japan;Department of Information Science, Faculty of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, Japan
Venue:
Proceedings of the 14th international conference on Supercomputing
Year:
2000

Citing 29
Cited 1

Structure and interpretation of computer programs

Structure and interpretation of computer programs
Minimizing register usage penalty at procedure calls

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Run-Time Parallelization and Scheduling of Loops

IEEE Transactions on Computers
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
Software versus hardware shared-memory implementation: a case study

ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Efficient context-sensitive pointer analysis for C programs

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Interprocedural partial redundancy elimination and its application to distributed memory compilation

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Interprocedural compilation of irregular applications for distributed memory machines

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
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
An integrated compile-time/run-time software distributed shared memory system

Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
SoftFLASH: analyzing the performance of clustered distributed virtual shared memory

Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Performance evaluation of two home-based lazy release consistency protocols for shared virtual memory systems

OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Application restructuring and performance portability on shared virtual memory and hardware-coherent multiprocessors

PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
MBCF: a protected and virtualized high-speed user-level memory-based communication facility

ICS '98 Proceedings of the 12th 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
Compiling Global Name-Space Parallel Loops for Distributed Execution

IEEE Transactions on Parallel and Distributed Systems
Supporting Software Distributed Shared Memory with an Optimizing Compiler

ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
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
A Comparison of Entry Consistency and Lazy Release Consistency Implementations

HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
Software DSM Protocols that Adapt between Single Writer and Multiple Writer

HPCA '97 Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture
Home-Based SVM Protocols for SMP Clusters: Design and Performance

HPCA '98 Proceedings of the 4th International Symposium on High-Performance Computer Architecture
Comparative Evaluation of Fine- and Coarse-Grain Approaches for Software Distributed Shared Memory

HPCA '99 Proceedings of the 5th International 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
Programming languages and their compilers: Preliminary notes

Programming languages and their compilers: Preliminary notes

Compiler-Assisted software DSM on a WAN cluster

PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

The experimental results clearly show that the performance of ADSM scheme is limited by the communication of unnecessary data, while that of the UDSM scheme is limited by the instrumentation overhead. The UDSM scheme reduces transmission of unnecessary data and automatically prevents the severe false sharing at fetch-on-write, which is the problem in the page-based scheme.