Accession Number:

AD0485372

Title:

INITIATION TIMING IN A MODEL FOR PARALLEL COMPUTATION.

Descriptive Note:

Technical rept.,

Corporate Author:

MICHIGAN UNIV ANN ARBOR SYSTEMS ENGINEERING LAB

Personal Author(s):

• Reiter, Raymond

Report Date:

1966-03-01

Pagination or Media Count:

53.0

Abstract:

This paper deals with a particular case of a model for parallel computeation as formulated by Karp and Miller. A parallel computation is viewed as a directed graph in which a node represents a sequence of operations to be performed upon data on the node input branches with the results of an operation being placed upon the output branches. An operation associated with a node n may initiate only if there is at least one data item on each input branch to n. Upon initiation, n removes one data item from each input branch and upon termination, places one data item on each output branch. A maximal computation rate periodic schedule is also given for the case that G is required to compute synchronously, i.e. at integer times. Finally, in the case of a synchronous computation graph G, an analysis is given of the so-called free running execution of G and this is found to yield the maximum computation rate of G.

Descriptors:

• (*MATHEMATICAL MODELS
• NUMERICAL ANALYSIS)
• GRAPHICS
• DIGITAL COMPUTERS
• SEQUENCES(MATHEMATICS)
• TIME
• COMPUTER LOGIC
• ALGORITHMS
• SET THEORY

Subject Categories:

• Theoretical Mathematics
• Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE