GRAPH MODELS OF COMPUTATIONS IN COMPUTER SYSTEMS.

reportActive / Technical Report | Accession Number: AD0678753 | Need Help?

Abstract:

A directed graph is used as a model for computational tasks. This model shows the precedence constraints, concurrency or mutual exclusiveness between subtasks. The directed graph is transformed into an acyclic graph in such a way that the mean path length of the original cycles are left unchanged. From this graph, mean path length measurements can be performed. Associated with an algorithm examining the structure of the graph, lower and upper bounds on the number of processors referred for maximum parallelism can be determined. A one-shot a priori scheduling with different urgency rules is presented and tested on some example graphs. It presents a large saving of computational time compared to previous experiments. Author

Author(s):
Baer, Jean-loup E.
Author Organization(s):
CALIFORNIA UNIV LOS ANGELES DEPT OF ENGINEERING
Descriptive Note:
Technical rept.,
Supplementary Note:
Supported in part by Atomic Energy Commission, Washington, D. C.
Pagination:
0220

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
68-46
Contract/Grant Number(s):
Nonr-233(52), SD-184
Project Number(s):
UCLA-10P14-51
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*DIGITAL COMPUTERS, MULTIPLE OPERATION), TOPOLOGY, SCHEDULING, ALGORITHMS, FLOW CHARTING, SEQUENCES(MATHEMATICS), MATHEMATICAL MODELS, TIME SHARING, MATRICES(MATHEMATICS), COMPUTER PROGRAMMING, THESES
Field(s)/Group(s):
Computer Programming and Software, Computer Hardware, Computer Systems
Keyword(s):
DIRECTED GRAPHS, *MULTIPROCESSING
Report Date:
1968 Oct 01