NDLI: An integrated compile-time/run-time software distributed shared memory system (SIGP, Vol. 31, Issue. 9)

Content Provider	ACM Digital Library
Author	Dwarkadas, Sandhya Cox, Alan L. Zwaenepoel, Willy
Abstract	On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance of hand-coded message passing by translating data-parallel programs into message passing programs, but efficient execution is limited to those programs for which precise analysis can be carried out. Shared memory is easier to program than message passing and its domain is not constrained by the limitations of parallelizing compilers, but it lags in performance. Our goal is to close that performance gap while retaining the benefits of shared memory. In other words, our goal is (1) to make shared memory as efficient as message passing, whether hand-coded or compiler-generated, (2) to retain its ease of programming, and (3) to retain the broader class of applications it supports.To this end we have designed and implemented an integrated compile-time and run-time software DSM system. The programming model remains identical to the original pure run-time DSM system. No user intervention is required to obtain the benefits of our system. The compiler computes data access patterns for the individual processors. It then performs a source-to-source transformation, inserting in the program calls to inform the run-time system of the computed data access patterns. The run-time system uses this information to aggregate communication, to aggregate data and synchronization into a single message, to eliminate consistency overhead, and to replace global synchronization with point-to-point synchronization wherever possible.We extended the Parascope programming environment to perform the required analysis, and we augmented the TreadMarks run-time DSM library to take advantage of the analysis. We used six Fortran programs to assess the performance benefits: Jacobi, 3D-FFT, Integer Sort, Shallow, Gauss, and Modified Gramm-Schmidt, each with two different data set sizes. The experiments were run on an 8-node IBM SP/2 using user-space communication. Compiler optimization in conjunction with the augmented run-time system achieves substantial execution time improvements in comparison to the base TreadMarks, ranging from 4% to 59% on 8 processors. Relative to message passing implementations of the same applications, the compile-time run-time system is 0-29% slower than message passing, while the base run-time system is 5-212% slower. For the five programs that XHPF could parallelize (all except IS), the execution times achieved by the compiler optimized shared memory programs are within 9% of XHPF.
Starting Page	186
Ending Page	197
Page Count	12
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/248209.237181
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	31
Issue Number	9
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

SoftFLASH:analyzing the performance of clustered distributed virtual shared memory (SIGP, Vol. 31, Issue. 9)

An evaluation of memory consistency models for shared-memory systems with ILP processors (SIGP, Vol. 31, Issue. 9)

Shasta:a low overhead, software-only approach for supporting fine-grain shared memory (SIGP, Vol. 31, Issue. 9)

Optimizing ML with run-time code generation (SIGP, Vol. 31, Issue. 5)

Petal:distributed virtual disks (SIGP, Vol. 31, Issue. 9)

Fine-grain access control for distributed shared memory (SIGP, Vol. 29, Issue. 11)

An integrated compile-time/run-time software distributed shared memory system (OPSR, Vol. 30, Issue. 5)

Exploiting dual data-memory banks in digital signal processors (SIGP, Vol. 31, Issue. 9)

The Rio file cache:surviving operating system crashes (SIGP, Vol. 31, Issue. 9)

An integrated compile-time/run-time software distributed shared memory system (SIGP, Vol. 31, Issue. 9)

Similar Documents

SoftFLASH:analyzing the performance of clustered distributed virtual shared memory (SIGP, Vol. 31, Issue. 9)

An evaluation of memory consistency models for shared-memory systems with ILP processors (SIGP, Vol. 31, Issue. 9)

Shasta:a low overhead, software-only approach for supporting fine-grain shared memory (SIGP, Vol. 31, Issue. 9)

Optimizing ML with run-time code generation (SIGP, Vol. 31, Issue. 5)

Petal:distributed virtual disks (SIGP, Vol. 31, Issue. 9)

Fine-grain access control for distributed shared memory (SIGP, Vol. 29, Issue. 11)

An integrated compile-time/run-time software distributed shared memory system (OPSR, Vol. 30, Issue. 5)

Exploiting dual data-memory banks in digital signal processors (SIGP, Vol. 31, Issue. 9)

The Rio file cache:surviving operating system crashes (SIGP, Vol. 31, Issue. 9)

An integrated compile-time/run-time software distributed shared memory system (SIGP, Vol. 31, Issue. 9)