System Design of a Cellular APL Computer

Thurber, Kenneth J.; Myrna, John W.

doi:10.1109/t-c.1970.222916

Cited by 16 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been several proposals for machines with higb level language features (Bashkow, et ai, 1967 [2], Melbourne Thurber and Myrna, 1970 [15|, a few partial iniplonicntations o( such machines (Wobcr, l'-)67 [16|, and the description ot the IEVAL instruction in Husson, 1970 [7|) and a complete implementation (Cbesley and Smith, 1971[31, Smilh, ct al., 1971. The machine discussed here is a ful!…”

Section: Resultsmentioning

confidence: 99%

Implementation of a high level language machine

1973

View full text Add to dashboard Cite

Computing machines which directly execute the statements of a high level language have been proposed in the past. This report describes the actual implementation of such a machine: it is a computer whose *'machine language" is APL. The machine is fully operational and correctly executes almost all of the APL operations on scalars, vectors, and arrays. The machine automatically allocates memory, executes statements, calls functions, converts numbers from one type to another, checks subscripts, and automatically detects many types of programmer errors.

show abstract

Section: Resultsmentioning

confidence: 99%

Implementation of a high level language machine

1973

View full text Add to dashboard Cite

show abstract

“…Similarly, the simultaneous execution of an instruction and fetch of a subsequent instruction (e.g., IBM 7094) or the simultaneous processing of input, output, and internal operations (e.g., CDC 6600), are forms of parallelism. Thus many approaches to the classification of computer architectures are possible [23]. A classification scheme due to Flynn (24,251 is perhaps one of the more useful for our purposes.…”

Section: Parallel Architecturesmentioning

confidence: 99%

Chemistry, computers, and microelectronics: Present and future prospects

Ostlund

2009

Int. J. Quantum Chem.

View full text Add to dashboard Cite

Computer architecture is being driven by developments in the semiconductor industry. The market for mass-produced microprocessors in video games, personal computers, real-time control, etc., is leading to rapid advances in the complexity of circuitry that can be placed on a single silicon chip. Present estimates suggest that within ten years it may be possible to incorporate lo'transistors on a chip (most current mainframe CPUs contain less than lo6 transistors). These developments in very large-scale integration (VLSI) will have a major impact on computer science and, subsequently, on computational chemistry. Quantum chemistry has an essentially infinite demand for processing power. Economic ways of obtaining this processing power must take advantage of VLSI. One possibility that is being actively explored is to connect hundreds (and perhaps thousands) of massproduced microprocessors together to form a multiprocessor. Such a multiprocessor would then execute parallel versions of the existent serial algorithms of quantum chemistry. Developing parallel algorithms to take advantage of these new architectures will require a substantial revision of the computational methods of quantum chemistry. This article will review developments in microprocessors and their likely impact on quantum chemistry. The C m m p and Cm* multiprocessors, built in the Computer Science Department of Carnegie-Mellon University, will be described as well as present progress in designing parallel versions of some common quantum chemistry algorithms for execution on these machines, particularly Cm*.

show abstract

“…Control facilities at the statement level in APL are very few, but there are wide possibilities for generating "powerful" expressions allowing various on-line solutions of engineering and computational problems. With the advent of vector and matrix computers, APL was regarded a candidate for an "ideal" high-level language for them, or a basic language for the design of the architecture of an APL-computer [47][48][49]. The advantages gained by APL implemented in a parallel processor computer (in particular, an associative one) were revealed in [50].…”

Section: Languages For Matrix and Vector Computersmentioning

confidence: 99%

On Parallel Languages

Kotov¹

1984

Algorithms, Software and Hardware of Parallel Computers

View full text Add to dashboard Cite

The improvement of mechanisms for program representation of parallelism was. and still is, the central problem of parallel programming. In practice, this consists of two different problems:the development of methods for describing parallelism in programs modelling complex discrete systems and processes;the development of methods for the organization of computations on parallel multiprocessing computers.More specifically, the problem lies in the development of parallel programming languages containing facilities for the description of task parallelism and/or the definition of computational parallelism. Both problems have many traits in common from the point of view of the basic principles underlying the mechanism of parallel structure organization. Basically, the differences between them can be reduced to the differences between high-and low-level languages. Parallelism in programs and computationsThe discussion of problems associated with parallelism in programming requires a more precise definition of this concept, the separation of its abstract and concrete forms at various stages of programming, and at various levels of the program hierarchy.Difficulties arise from the very beginning : how to define the concepts of parallel computation (processes, statements, operations, etc.). The definitions introducing real or conditional time and leading to ideas such as "concurrent processes" or "processes that can be concurrent", lead to difficulties and ambiguities unless one considers trivial examples (e.g. a pair of processes which do not interact at all). The fact that formal theoretical definitions of parallelism based on time relations are complicated reflects these difficulties. There is another, wider possibility for defining parallelism : fragments or processes are referred to as parallel, if they are (or can be) implemented by different separate physical or virtual units. One can fully avoid the necessity of defining the parallelism relation and, instead, define the dependence relation of fragments or processes. This approach complements the above ones, and it can be characterized as "parallelism presumption": all the program fragments and actions are regarded as initially independent, i.e. parallel;

show abstract

System Design of a Cellular APL Computer

Cited by 16 publications

References 5 publications

Implementation of a high level language machine

Implementation of a high level language machine

Chemistry, computers, and microelectronics: Present and future prospects

On Parallel Languages

Contact Info

Product

Resources

About