skip to main content
10.1145/1476793.1476814acmotherconferencesArticle/Chapter ViewAbstractPublication PagesafipsConference Proceedingsconference-collections
research-article
Free access

TRANQUIL: a language for an array processing computer

Published: 14 May 1969 Publication History

Abstract

TRANQUIL is the algorithmic language which will be used to write programs for ILLIAC IV, a parallel computer which has been described by Barnes et al. ILLIAC IV is designed to be an array of 256 coupled processing elements (PE's) arranged in four quadrants in each of which the 64 PE's are driven by instructions emanating from a single control unit (CU). Each of the 256 PE's is to have 2048 words of 64 bit semiconductor memory with a 250 nanosecond cycle time and an instruction set which includes floating point arithmetic on both 64 bit and 32 bit operands with options for rounding and normalization, 8 bit byte operations, and a wide range of tests due to the use of addressable registers and a full set of comparisons. The PE's differ from conventional digital computers in two main ways. Firstly, each is capable of communicating data to its four neighboring PE's in the array by means of routing instructions. Secondly, each PE is able to set its own mode registers, thus effectively enabling or disabling itself for the transmission of data or the execution of instructions from its CU.

References

[1]
G Barnes R Brown M Kato D Kuck D Slotnick R Stokes The ILLIAC IV computer IEEE Transactions on computers Vol C--17 746--757 August 1968
[2]
D J Kuck Illiac IV software and applications programming IEEE Transactions on computers Vol C--17 August 1968 758--770
[3]
M B Wells Aspects of language design for combinatorial computing IEEE Transactions on computers Vol EC--13 431--438 August 1964
[4]
K E Iverson A programming language John Wiley New York 1962
[5]
R S Northcote The structure and use of a compiler-compiler system Proc 3rd Australian computer conference 1966
[6]
F L Deremer On the generation of parsers for BNF grammars: an algorithm Proc SJCC 1969
[7]
A J Beals The generation of a deterministic parsing algorithm Report No 304 Dept of Computer Science University of Illinois at Urbana 1969
[8]
H R G Trout A BNF like language for the description of syntax directed compilers Report No 300 Dept of Computer Science University of Illinois at Urbana 1969
[9]
Y Muraoka Storage allocation algorithms in the TRANQUIL compiler Report No 297 Dept of Computer Science University of Illinois at Urbana 1969
[10]
R B Wilhelmson Control statement syntax and semantics of a language for parallel processors Report No 298 Department of Computer Science University of Illinois at Urbana 1969
[11]
P P Budnik Tranquil arithmetic Report No 296 Dept of Computer Science University of Illinois at Urbana 1969

Cited By

View all
  • (2014)Divergence analysisACM Transactions on Programming Languages and Systems10.1145/252381535:4(1-36)Online publication date: 3-Jan-2014
  • (2011)Divergence Analysis and OptimizationsProceedings of the 2011 International Conference on Parallel Architectures and Compilation Techniques10.1109/PACT.2011.63(320-329)Online publication date: 10-Oct-2011
  • (2011)On the application of parallel architectures to a class of operations research problemsRAIRO - Operations Research10.1051/ro/198317040317117:4(317-341)Online publication date: 29-Mar-2011
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
AFIPS '69 (Spring): Proceedings of the May 14-16, 1969, spring joint computer conference
May 1969
902 pages
ISBN:9781450379021
DOI:10.1145/1476793
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: 14 May 1969

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)112
  • Downloads (Last 6 weeks)10
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media