NDLI: Dynamic dead-instruction detection and elimination

Please wait, while we are loading the content...

Transactional lock-free execution of lock-based programs

Automatically characterizing large scale program behavior

Maté: a tiny virtual machine for sensor networks

ECOSystem: managing energy as a first class operating system resource

Design and evaluation of compiler algorithms for pre-execution

Dynamic dead-instruction detection and elimination

Increasing web server throughput with network interface data caching

A stateless, content-directed data prefetching mechanism

Keynote address: Sensor network research: emerging challenges for architecture, systems, and languages

Speculative synchronization: applying thread-level speculation to explicitly parallel applications

Bytecode fetch optimization for a Java interpreter

Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Cool-Mem: combining statically speculative memory accessing with selective address translation for energy efficiency

Compiler optimization of scalar value communication between speculative threads

An adaptive, non-uniform cache structure for wire-delay dominated on-chip caches

Programming language optimizations for modular router configurations

A stream compiler for communication-exposed architectures

Temporally silent stores

Understanding and improving operating system effects in control flow prediction

Enabling trusted software integrity

Joint local and global hardware adaptations for energy

Enhancing software reliability with speculative threads

A comparative study of arbitration algorithms for the Alpha 21364 pipelined router

Evolving RPC for active storage

Mondrian memory protection

Dynamic dead-instruction detection and elimination

Content Provider	ACM Digital Library
Author	Sohi, Guri Butts, J. Adam
Abstract	We observe a non-negligible fraction--3 to 16% in our benchmarks--of dynamically dead instructions, dynamic instruction instances that generate unused results. The majority of these instructions arise from static instructions that also produce useful results. We find that compiler optimization (specifically instruction scheduling) creates a significant portion of these partially dead static instructions. We show that most of the dynamically instructions arise from a small set of static instructions that produce dead values most of the time.We leverage this locality by proposing a dead instruction predictor and presenting a scheme to avoid the execution of predicted-dead instructions. Our predictor achieves an accuracy of 93% while identifying over 91% of the dead instructions using less than 5 KB of state. We achieve such high accuracies by leveraging future control flow information (i.e., branch predictions) to distinguish between useless and useful instances of the same static instruction.We then present a mechanism to avoid the register allocation, instruction scheduling, and execution of predicted dead instructions. We measure reductions in resource utilization averaging over 5% and sometimes exceeding 10%, covering physical register management (allocation and freeing), register file read and write traffic, and data cache accesses. Performance improves by an average of 3.6% on an architecture exhibiting resource contention. Additionally, our scheme frees future compilers from the need to consider the costs of dead instructions, enabling more aggressive code motion and optimization. Simultaneously, it mitigates the need for good path profiling information in making inter-block code motion decisions.
Starting Page	199
Ending Page	210
Page Count	12
File Format	PDF
ISBN	1581135742
DOI	10.1145/605397.605419
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2002-10-05
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

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

Dynamic Dead-Instruction Detection and Elimination (2002)

Lazy instruction scheduling: keeping performance, reducing power

Abstract Dynamic Dead-Instruction Detection and Elimination

Dynamic dead-instruction detection and elimination (CARN, Vol. 30, Issue. 5)

Dynamic dead-instruction detection and elimination (SIGP, Vol. 37, Issue. 10)

Dynamic dead-instruction detection and elimination (OPSR, Vol. 36, Issue. 5)

Lazy instruction scheduling: keeping performance, reducing power

Approximate Reachability for Dead Code Elimination in Esterel ⋆

Code Optimization as a Side Effect of Instruction Scheduling (1997)

Dynamic dead-instruction detection and elimination

Similar Documents

Dynamic Dead-Instruction Detection and Elimination (2002)

Lazy instruction scheduling: keeping performance, reducing power

Abstract Dynamic Dead-Instruction Detection and Elimination

Dynamic dead-instruction detection and elimination (CARN, Vol. 30, Issue. 5)

Dynamic dead-instruction detection and elimination (SIGP, Vol. 37, Issue. 10)

Dynamic dead-instruction detection and elimination (OPSR, Vol. 36, Issue. 5)

Lazy instruction scheduling: keeping performance, reducing power

Approximate Reachability for Dead Code Elimination in Esterel ⋆

Code Optimization as a Side Effect of Instruction Scheduling (1997)

Dynamic dead-instruction detection and elimination