NDLI: Whole-program optimization for time and space efficient threads (SIGP, Vol. 31, Issue. 9)

Content Provider	ACM Digital Library
Author	Neves, Richard Grunwald, Dirk
Abstract	Modern languages and operating systems often encourage programmers to use threads, or independent control streams, to mask the overhead of some operations and simplify program structure. Multitasking operating systems use threads to mask communication latency, either with hardwares devices or users. Client-server applications typically use threads to simplify the complex control-flow that arises when multiple clients are used. Recently, the scientific computing community has started using threads to mask network communication latency in massively parallel architectures, allowing computation and communication to be overlapped. Lastly, some architectures implement threads in hardware, using those threads to tolerate memory latency.In general, it would be desirable if threaded programs could be written to expose the largest degree of parallelism possible, or to simplify the program design. However, threads incur time and space overheads, and programmers often compromise simple designs for performance. In this paper, we show how to reduce time and space thread overhead using control flow and register liveness information inferred after compilation. Our techniques work on binaries, are not specific to a particular compiler or thread library and reduce the the overall execution time of fine-grain threaded programs by ≈ 15-30%. We use execution-driven analysis and an instrumented operating system to show why the execution time is reduced and to indicate areas for future work.
Starting Page	50
Ending Page	59
Page Count	10
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/248209.237149
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

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

Thread scheduling for cache locality (SIGP, Vol. 31, Issue. 9)

Compiler-directed page coloring for multiprocessors (SIGP, Vol. 31, Issue. 9)

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

Multiple-block ahead branch predictors (SIGP, Vol. 31, Issue. 9)

Optimization for an array computer (SIGP, Vol. 5, Issue. 9)

The case for a single-chip multiprocessor (SIGP, Vol. 31, Issue. 9)

Compiler-based prefetching for recursive data structures (SIGP, Vol. 31, Issue. 9)

Value locality and load value prediction (SIGP, Vol. 31, Issue. 9)

Whole-program optimization for time and space efficient threads (SIGP, Vol. 31, Issue. 9)

Similar Documents

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

Thread scheduling for cache locality (SIGP, Vol. 31, Issue. 9)

Compiler-directed page coloring for multiprocessors (SIGP, Vol. 31, Issue. 9)

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

Multiple-block ahead branch predictors (SIGP, Vol. 31, Issue. 9)

Optimization for an array computer (SIGP, Vol. 5, Issue. 9)

The case for a single-chip multiprocessor (SIGP, Vol. 31, Issue. 9)

Compiler-based prefetching for recursive data structures (SIGP, Vol. 31, Issue. 9)

Value locality and load value prediction (SIGP, Vol. 31, Issue. 9)

Whole-program optimization for time and space efficient threads (SIGP, Vol. 31, Issue. 9)