Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1479064.1479114acmotherconferencesArticle/Chapter ViewAbstractPublication PagesafipsConference Proceedingsconference-collections
research-article
Free access

The "single-assignment" approach to parallel processing

Published: 16 May 1972 Publication History

Abstract

Parallel processing systems---computer systems in which more than one processor is active simultaneously---offer potential advantages over uniprocessor systems in terms of speed, flexibility, reliability, and economies of scale. However, they pose the problem of how multiple processors can be organized to cooperate on a given problem without interference. Various solutions have been proposed to this problem. Some systems require a programmer to assign units of work to the various processors, while other systems perform this assignment automatically; in some systems, the processors are linked closely together, while in others the processors are nearly independent. The system to be described here automatically detects opportunities for parallel processing in programs written in a specific, high-level language. Parallelism is detected on a very low level---even within a single algebraic expression. The system consists of many independent, asynchronous processors, all active at once in processing a single program.

References

[1]
J P Anderson Program structure for parallel processing Communications of the ACM Vol 8 No 12 December 1965
[2]
G H Barnes R M Brown M Kato D J Kuck D L Slotnick R A Stokes The Illiac IV computer IEEE Transactions on Computers Vol C-17 No 8 August 1968
[3]
H W Bingham D A Fisher E W Reigel Automatic detection of parallelism in computer programs Burroughs Corporation Technical Report TR-67-4 November 1967
[4]
H S Stone One-pass compilation of arithmetic expressions for a parallel processor Communications of the ACM Vol 10 No 4 April 1967
[5]
L G Tesler H J Enea A language design for concurrent processes Proceedings of the 1968 Spring Joint Computer Conference
[6]
D D Chamberlin Parallel implementation of a single assignment language PhD Thesis Electrical Engineering Department Stanford University Stanford California 1971
[7]
IBM System/360 principles of operation IBM Publication No A22-6821 February 1966

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
AFIPS '71 (Fall): Proceedings of the November 16-18, 1971, fall joint computer conference
November 1971
697 pages
ISBN:9781450379106
DOI:10.1145/1479064
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]

Sponsors

  • AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 May 1972

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)23
  • Downloads (Last 6 weeks)1
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2008)Unification of arrays in spreadsheets with logic programmingProceedings of the 10th international conference on Practical aspects of declarative languages10.5555/1785754.1785762(100-115)Online publication date: 7-Jan-2008
  • (2005)Une Transformation de programmes sequentiels en programmes parallelesProgramming Symposium10.1007/3-540-06859-7_143(327-349)Online publication date: 20-Jun-2005
  • (1994)A History of Data-Flow LanguagesIEEE Annals of the History of Computing10.1109/85.32975716:4(38-59)Online publication date: 1-Dec-1994
  • (1991)A Theory of Reduced and Minimal Procedural DependenciesIEEE Transactions on Computers10.1109/12.9024740:6(681-692)Online publication date: 1-Jun-1991
  • (1988)On the combination of hardware and software concurrency extraction methodsACM SIGMICRO Newsletter10.1145/62197.6220919:1-2(53-57)Online publication date: 1-Jun-1988
  • (1987)On the combination of hardware and software concurrency extraction methodsProceedings of the 20th annual workshop on Microprogramming10.1145/255305.255331(133-141)Online publication date: 1-Dec-1987
  • (1986)An Instruction Issuing Approach to Enhancing Performance in Multiple Functional Unit ProcessorsIEEE Transactions on Computers10.1109/TC.1986.167684135:9(815-828)Online publication date: 1-Sep-1986
  • (1980)Data oriented program designACM SIGPLAN Notices10.1145/947706.94771315:9(44-57)Online publication date: 1-Sep-1980
  • (1979)Parallel Processing Of Relations: A Single-Assignment ApproachFifth International Conference on Very Large Data Bases, 1979.10.1109/VLDB.1979.718155(398-408)Online publication date: 1979
  • (1979)Exploitng Program Concurrency in Computing SystemsComputer10.1109/MC.1979.165845612:1(42-50)Online publication date: 1-Jan-1979
  • 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

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media