Parallel Task Execution in a Decentralized System

Authors:
M. J. Gonzalez;C. V. Ramamoorthy
Affiliations:
Texas Instruments, Inc.;-
Venue:
IEEE Transactions on Computers
Year:
1972

Citing 4
Cited 1

Virtual Memory

ACM Computing Surveys (CSUR)
Program Suitability for Parallel Processing

IEEE Transactions on Computers
A survey of techniques for recognizing parallel processable streams in computer programs

AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Optimal Scheduling Strategies in a Multiprocessor System

IEEE Transactions on Computers

Multiprocessing Systems

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

The overhead involved in the real-time multiprocessor execution of parallel-processable segments of a sequential program is investigated. The execution follows a preprocessing phase in which the source program is analyzed and the parallel-processable segments are recognized. A number of representations of a parallel-processable program are possible. A table representation is used, and a technique is developed to efficiently interpret this table in a system in which a number of identical processors share a common memory.