NDLI: Optimistic parallelism requires abstractions

Content Provider	ACM Digital Library
Author	Bala, Kavita Kulkarni, Milind Chew, L. Paul Ramanarayanan, Ganesh Pingali, Keshav Walter, Bruce
Abstract	Irregular applications, which manipulate large, pointer-based data structures like graphs, are difficult to parallelize manually. Automatic tools and techniques such as restructuring compilers and run-time speculative execution have failed to uncover much parallelism in these applications, in spite of a lot of effort by the research community. These difficulties have even led some researchers to wonder if there is any coarse-grain parallelism worth exploiting in irregular applications. In this paper, we describe two real-world irregular applications: a Delaunay mesh refinement application and a graphics application thatperforms agglomerative clustering. By studying the algorithms and data structures used in theseapplications, we show that there is substantial coarse-grain, data parallelism in these applications, but that this parallelism is very dependent on the input data and therefore cannot be uncoveredby compiler analysis. In principle, optimistic techniques such asthread-level speculation can be used to uncover this parallelism, but we argue that current implementations cannot accomplish thisbecause they do not use the proper abstractions for the data structuresin these programs. These insights have informed our design of the Galois system, an object-based optimistic parallelization system for irregular applications. There are three main aspects to Galois: (1) a small number of syntactic constructs for packaging optimistic parallelism as iteration over ordered and unordered sets, (2)assertions about methods in class libraries, and (3) a runtime scheme for detecting and recovering from potentially unsafe accesses to shared memory made by an optimistic computation. We show that Delaunay mesh generation and agglomerative clustering can be parallelized in a straight-forward way using the Galois approach, and we present experimental measurements to show that this approach is practical. These results suggest that Galois is a practical approach to exploiting data parallelismin irregular programs.
Starting Page	211
Ending Page	222
Page Count	12
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/1273442.1250759
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	42
Issue Number	6
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Abstractions Irregular programs Optimistic parallelism
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

Optimistic parallelism requires abstractions

Betweenness centrality:algorithms and implementations

Elixir:a system for synthesizing concurrent graph programs

Isolation for nested task parallelism

Delegated isolation

How much parallelism is there in irregular applications?

Optimistic parallelism benefits from data partitioning (SIGP, Vol. 43, Issue. 3)

Parallel programming with object assemblies

Optimistic parallelism requires abstractions

Optimistic parallelism requires abstractions

Similar Documents

Optimistic parallelism requires abstractions

Betweenness centrality:algorithms and implementations

Elixir:a system for synthesizing concurrent graph programs

Isolation for nested task parallelism

Delegated isolation

How much parallelism is there in irregular applications?

Optimistic parallelism benefits from data partitioning (SIGP, Vol. 43, Issue. 3)

Parallel programming with object assemblies

Optimistic parallelism requires abstractions

Optimistic parallelism requires abstractions