OPTIMAL SCHEDULING OF PROCESSES FOR A NETWORK OF TRANSPUTERS (MULTIPROCESSOR, OCCAM, CONCURRENT PROCESSING)

Author

• TON ANH NGO

Author Type

Graduate Student

Date of Award

1986

Document Type

Thesis

Publication Status

Version of Record

Submission Date

October 2026

Thesis/Dissertation Advisor [Chair]

Fernandez, Eduardo B.

Abstract

Concurrency at both the hardware and software level has recently been considered as the solution to the classic Von Neuman bottleneck in system design. Introduced by Inmos, the Occam language and the Transputer microprocessor provide simple and elegant building blocks for a concurrent system. This thesis proposes a set of algorithms to find an optimal deterministic schedule for an Occam program executed on a network of Transputers. Also discussed are features of the network relevant to the problem of scheduling, and a complete example is provided to illustrate the scheduler. The approaches described can be used as a basis for implementing a flexible general purpose multiprocessor system.

Extent

121 p.

Comments

College of Engineering and Computer Science|Thesis (M.S.C.E.)--Florida Atlantic University, 1986.|FAU Electronic Theses and Dissertations Collection|College of Engineering and Computer Science

Recommended Citation

NGO, TON ANH, "OPTIMAL SCHEDULING OF PROCESSES FOR A NETWORK OF TRANSPUTERS (MULTIPROCESSOR, OCCAM, CONCURRENT PROCESSING)" (1986). Electronic Theses and Dissertations 1980 - 1989. 470.
https://digitalcommons.fau.edu/etd_general_3/470

Identifier

FADT14351

Format

pdf