WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Transactions on Programming Languages and Systems (TOPLAS)
  2. ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 23
  3. Issue 5, September 2001
  4. Operator strength reduction
Loading...

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

ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 38
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 37
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 36
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 35
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 34
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 33
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 32
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 31
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 30
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 29
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 28
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 27
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 26
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 25
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 24
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 23
Issue 6, November 2001
Issue 5, September 2001
Operator strength reduction
Mechanizing a theory of program composition for UNITY
An indexed model of recursive types for foundational proof-carrying code
Issue 4, July 2001
Issue 3, May 2001
Issue 2, March 2001
Issue 1, Jan 2001
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 22
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 21
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 20
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 19
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 18
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 17
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 16
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 15
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 14
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 13
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 12
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 11
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 10
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 9
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 8
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 7
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 6
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 5
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 4
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 3
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 2
ACM Transactions on Programming Languages and Systems (TOPLAS) : Volume 1

Similar Documents

...
Java bytecode verification via static single assignment form

Article

...
Single-pass generation of static single-assignment form for structured languages

Article

...
Efficiently computing Φ-nodes on-the-fly

Article

...
Using static single assignment form in a code optimizer

Article

...
Beyond induction variables: detecting and classifying sequences using a demand-driven SSA form

Article

...
Operator Strength Reduction (1995)

Article

...
Static single assignment form for machine code

Article

...
Operator Strength Reduction (1995)

Article

...
Algorithms for computing the static single assignment form

Article

Operator strength reduction

Content Provider ACM Digital Library
Author Cooper, Keith D. Vick, Christopher A. Simpson, L. Taylor
Copyright Year 2001
Abstract Operator strength reduction is a technique that improves compiler-generated code by reformulating certain costly computations in terms of less expensive ones. A common case arises in array addressing expressions used in loops. The compiler can replace the sequence of multiplies generated by a direct translation of the address expression with an equivalent sequence of additions. When combined with linear function test replacement, strength reduction can speed up the execution of loops containing array references. The improvement comes from two sources: a reduction in the number of operations needed to implement the loop and the use of less costly operations.This paper presents a new algorithm for operator strength reduction, called OSR. OSR improves upon an earlier algorithm of Allen, Cocke, and Kennedy [Allen et al. 1981]. OSR operates on the static single assignment (SSA) form of a procedure [Cytron et al. 1991]. By taking advantage of the properties of SSA form, we have derived an algorithm that is simple to understand, quick to implement, and, in practice, fast to run. Its asymptotic complexity is, in the worst case, the same as the Allen, Cocke,and Kennedy algorithm (ACK). OSR achieves optimization results that are equivalent to those obtained with the ACK algorithm. OSR has been implemented in several research and production compilers.
Starting Page 603
Ending Page 625
Page Count 23
File Format PDF
ISSN 01640925
e-ISSN 15584593
DOI 10.1145/504709.504710
Volume Number 23
Issue Number 5
Journal ACM Transactions on Programming Languages and Systems (TOPLAS)
Language English
Publisher Association for Computing Machinery (ACM)
Publisher Date 2001-09-01
Publisher Place New York
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Loops Static single assignment form Strength reduction
Content Type Text
Resource Type Article
Subject Software
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
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
I will try my best to help you...
Cite this Content
Loading...