[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

An axiomatic approach to code optimization for expressions

Published: 01 October 1972 Publication History
First page of PDF

References

[1]
STONE, H. S. One-pass compilation of arithmetic expressions for a parallel processor. Comm. ACM 10, 4 (April 1967), 220-223.
[2]
ALLARD, R. W., WOLF, K. A., AND ZEMLIN, R.A. Some effects of the 6600 computer on language structures. Comm. ACM 7, 2 (Feb. 1964), 112-119.
[3]
HELLERMAN, H. Parallel processing of algebraic equations. IEEE Trans. EC-15, 1 (Feb. 1966), 82-91.
[4]
BAER, J. L., AND BOVET, D .P . Compilation of arithmetic expressions for parallel computations. Proc. IFIP Cong. 1968, Vol. 1, North-Holland Pub. Co., Amsterdam, 1969, pp. 340-346.
[5]
SQVIRE, J. S. A translation algorithm for a multiprocessor computer. Internal memorandum, Information Systems Lab., Dep. of Elect. Eng., U. of Michigan, Ann Arbor, Mich., Aug. 1963.
[6]
SETHI, R., AND ULLMAN, J.D. The generation of optimal code for arithmetic expressions. J. ACM 17, 4 (Oct. 1976), 715-728.
[7]
American National Standard FORTRAN (ANS X3.9-1966). American National Standards Institute, New York, 1966.
[8]
LucAs, P., WALK, K., ET. AL. PL/I ULD Version I I I (formal definition of PL/I). Tech. Reps. TR 25.095, TR 25.096, TR 25.097, TR 25.098, TR 25.099, IBM Laboratory, Vienna.

Cited By

View all
  • (2023)Synthese für Logic-in-Memory-Computing mit RRAMIn-Memory-Computing10.1007/978-3-031-22879-7_4(49-85)Online publication date: 8-Jun-2023
  • (2019)Synthesis for Logic-in-Memory Computing Using RRAMIn-Memory Computing10.1007/978-3-030-18026-3_4(49-81)Online publication date: 23-May-2019
  • (2018)Logic Synthesis for RRAM-Based In-Memory ComputingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2017.275006437:7(1422-1435)Online publication date: Jul-2018
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of the ACM
Journal of the ACM  Volume 19, Issue 4
Oct. 1972
188 pages
ISSN:0004-5411
EISSN:1557-735X
DOI:10.1145/321724
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1972
Published in JACM Volume 19, Issue 4

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)69
  • Downloads (Last 6 weeks)19
Reflects downloads up to 15 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Synthese für Logic-in-Memory-Computing mit RRAMIn-Memory-Computing10.1007/978-3-031-22879-7_4(49-85)Online publication date: 8-Jun-2023
  • (2019)Synthesis for Logic-in-Memory Computing Using RRAMIn-Memory Computing10.1007/978-3-030-18026-3_4(49-81)Online publication date: 23-May-2019
  • (2018)Logic Synthesis for RRAM-Based In-Memory ComputingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2017.275006437:7(1422-1435)Online publication date: Jul-2018
  • (2017)Logic Synthesis for Majority Based In-Memory ComputingAdvances in Memristors, Memristive Devices and Systems10.1007/978-3-319-51724-7_17(425-448)Online publication date: 17-Feb-2017
  • (2011)Combinational logic synthesis for material implication2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip10.1109/VLSISoC.2011.6081665(200-203)Online publication date: Oct-2011
  • (2006)Timing-driven logic bi-decompositionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2003.81144722:6(675-685)Online publication date: 1-Nov-2006
  • (2006)Optimizing pipelined networks of associative and commutative operatorsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.32927113:11(1418-1425)Online publication date: 1-Nov-2006
  • (2005)How hard is compiler code generation?Automata, Languages and Programming10.1007/3-540-08342-1_1(1-15)Online publication date: 24-May-2005
  • (1989)Tree-height minimization in pipelined architectures1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers10.1109/ICCAD.1989.76916(112-115)Online publication date: 1989
  • (1984)Tree transformation problem in microparallelism algorithmsCybernetics10.1007/BF0106875419:5(604-614)Online publication date: 1984
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media