Combinators as control mechansims in multiprocessor systems

Thumbnail Image
Date
1987
Authors
Knox, Deborah
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Organizational Unit
Computer Science

Computer Science—the theory, representation, processing, communication and use of information—is fundamentally transforming every aspect of human endeavor. The Department of Computer Science at Iowa State University advances computational and information sciences through; 1. educational and research programs within and beyond the university; 2. active engagement to help define national and international research, and 3. educational agendas, and sustained commitment to graduating leaders for academia, industry and government.

History
The Computer Science Department was officially established in 1969, with Robert Stewart serving as the founding Department Chair. Faculty were composed of joint appointments with Mathematics, Statistics, and Electrical Engineering. In 1969, the building which now houses the Computer Science department, then simply called the Computer Science building, was completed. Later it was named Atanasoff Hall. Throughout the 1980s to present, the department expanded and developed its teaching and research agendas to cover many areas of computing.

Dates of Existence
1969-present

Related Units

Journal Issue
Is Version Of
Versions
Series
Department
Abstract

An approach for automatically decomposing functional programs for execution on a loosely coupled multiprocessor system is presented. We start with a language definition given denotationally in terms of the lambda calculus. This definition is then mapped into combinator expressions. Since the parallelism is inherent to the semantics of the language, it is reflected in the definitions of the combinators as well. We capture this parallelism by mapping the combinators onto an underlying implementation consisting of multiple processors. The combinators not only dictate the underlying architecture needed for support, but also direct the allocation of code for parallel evaluation of the combinator expressions.

Comments
Description
Keywords
Citation
Source
Subject Categories
Copyright
Thu Jan 01 00:00:00 UTC 1987