article

Free access

Assembling code for machines with span-dependent instructions

Author:

Thomas G. SzymanskiAuthors Info & Claims

Communications of the ACM, Volume 21, Issue 4

Pages 300 - 308

https://doi.org/10.1145/359460.359474

Published: 01 April 1978 Publication History

PDF eReader

Abstract

Many modern computers contain instructions whose lengths depend on the distance from a given instance of such an instruction to the operand of that instruction. This paper considers the problem of minimizing the lengths of programs for such machines. An efficient solution is presented for the case in which the operand of every such “span-dependent” instruction is either a label or an assembly-time expression of a certain restricted form. If this restriction is relaxed by allowing these operands to be more general assembly-time expressions, then the problem is shown to be NP-complete.

References

[1]

Aho, A.V, Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading Mass., 1974.

Digital Library

Google Scholar

[2]

Cook, S.A. The complexity of theorem proving procedures. Proc. 3rd Annual ACM Syrup. on Theory of Comptng, May 1974, 151-158.

Digital Library

Google Scholar

[3]

Frieder, G., and Saal, H.J. A process for the determination of addresses in variable length addressing. Comm. ACM 19, 6 (June 1976), 335-338.

Digital Library

Google Scholar

[4]

Karp, R.M. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., Plenum Press, New York, 1972.

Google Scholar

[5]

PDP-I 1 Processor Handbood. Digital Equipment Corp., Maynard, Mass., 1975.

Google Scholar

[6]

Richards, D. L. How to keep the addresses short. Comm. A CM 14, 5 (May 1971), 346-349.

Digital Library

Google Scholar

[7]

Ritchie, D.M., and Thompson, K. The UNIX time-sharing system. Comm. ACM 17, 7 (July 1974), 365-375.

Digital Library

Google Scholar

[8]

Wulf, W., Johnsson, R.K., Weinstock, C.B., Hobbs, S.O., and Geschke, C.M. The Design of an Optimizing Compiler. American- Elsevier, New York, 1975.

Digital Library

Google Scholar

Cited By

View all

Hungerländer P(2017)The checkpoint ordering problemOptimization10.1080/02331934.2017.134150766:10(1699-1712)Online publication date: 29-Jun-2017
https://doi.org/10.1080/02331934.2017.1341507
Boender JSacerdoti Coen C(2014)On the Correctness of a Branch Displacement AlgorithmTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-642-54862-8_53(605-619)Online publication date: 2014
https://doi.org/10.1007/978-3-642-54862-8_53
Sanford JPotkonjak MSlijepcevic SSanford JPotkonjak MSlijepcevic S(2012)Stastical Techniques and Location DiscoveryLocalization in Wireless Networks10.1007/978-1-4614-1839-9_2(9-39)Online publication date: 3-May-2012
https://doi.org/10.1007/978-1-4614-1839-9_2
Show More Cited By

Index Terms

Assembling code for machines with span-dependent instructions
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
      1. Source code generation
2. Theory of computation
  1. Computational complexity and cryptography
    1. Problems, reductions and completeness

Recommendations

Code Generation and Storage Allocation for Machines with Span-Dependent Instructions

Many machine languages have two instruction formats, one of which allows addressing of “nearby” operands with “short” (e.g. one word) instructions, while “faraway” operands require “long” format (e.g. two words). Because the distance between an ...
Compilation framework for code size reduction using reduced bit-width ISAs (rISAs)

For many embedded applications, program code size is a critical design factor. One promising approach for reducing code size is to employ a “dual instruction set”, where processor architectures support a normal (usually 32-bit) Instruction Set, and a ...
Fast, frequency-based, integrated register allocation and instruction scheduling

Instruction scheduling and register allocation are two of the most important optimization phases in modern compilers as they have a significant impact on the quality of the generated code. Unfortunately, the objectives of these two optimizations are in ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 21, Issue 4

April 1978

73 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/359460

Editor:
Robert L. Ashenhurst
The Univ. of Chicago, Chicago, IL

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1978

Published in CACM Volume 21, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

49
Total Citations
View Citations
775
Total Downloads

Downloads (Last 12 months)211
Downloads (Last 6 weeks)29

Reflects downloads up to 14 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hungerländer P(2017)The checkpoint ordering problemOptimization10.1080/02331934.2017.134150766:10(1699-1712)Online publication date: 29-Jun-2017
https://doi.org/10.1080/02331934.2017.1341507
Boender JSacerdoti Coen C(2014)On the Correctness of a Branch Displacement AlgorithmTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-642-54862-8_53(605-619)Online publication date: 2014
https://doi.org/10.1007/978-3-642-54862-8_53
Sanford JPotkonjak MSlijepcevic SSanford JPotkonjak MSlijepcevic S(2012)Stastical Techniques and Location DiscoveryLocalization in Wireless Networks10.1007/978-1-4614-1839-9_2(9-39)Online publication date: 3-May-2012
https://doi.org/10.1007/978-1-4614-1839-9_2
Burgstaller BScholz B(2009)Program AssemblersWiley Encyclopedia of Computer Science and Engineering10.1002/9780470050118.ecse326(2233-2243)Online publication date: 16-Mar-2009
https://doi.org/10.1002/9780470050118.ecse326
Feng JGirod LPotkonjak M(2006)Location Discovery Using Data-Driven Statistical Error ModelingProceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications10.1109/INFOCOM.2006.222(1-14)Online publication date: Apr-2006
https://doi.org/10.1109/INFOCOM.2006.222
Williams M(2006)Long/short address optimization in assemblersSoftware: Practice and Experience10.1002/spe.43800903089:3(227-235)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380090308
De Sutter BDe Bus BDe Bosschere K(2005)Link-time binary rewriting techniques for program compactionACM Transactions on Programming Languages and Systems10.1145/1086642.108664527:5(882-945)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1145/1086642.1086645
Ayers ASchooler RMetcalf CAgarwal ARhee JWitchel ESarkar VHall M(2005)TraceBackProceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation10.1145/1065010.1065035(201-212)Online publication date: 12-Jun-2005
https://dl.acm.org/doi/10.1145/1065010.1065035
Ayers ASchooler RMetcalf CAgarwal ARhee JWitchel E(2005)TraceBackACM SIGPLAN Notices10.1145/1064978.106503540:6(201-212)Online publication date: 12-Jun-2005
https://dl.acm.org/doi/10.1145/1064978.1065035
Corliss MLewis ERoth A(2005)The implementation and evaluation of dynamic code decompression using DISEACM Transactions on Embedded Computing Systems10.1145/1053271.10532744:1(38-72)Online publication date: 1-Feb-2005
https://dl.acm.org/doi/10.1145/1053271.1053274
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Code Generation and Storage Allocation for Machines with Span-Dependent Instructions

Compilation framework for code size reduction using reduced bit-width ISAs (rISAs)

Fast, frequency-based, integrated register allocation and instruction scheduling

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations