
Accession Number : AD0678753
Title : GRAPH MODELS OF COMPUTATIONS IN COMPUTER SYSTEMS.
Descriptive Note : Technical rept.,
Corporate Author : CALIFORNIA UNIV LOS ANGELES DEPT OF ENGINEERING
Personal Author(s) : Baer,JeanLoup E.
Report Date : OCT 1968
Pagination or Media Count : 220
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 oneshot '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)
Descriptors : (*DIGITAL COMPUTERS, MULTIPLE OPERATION), TOPOLOGY, SCHEDULING, ALGORITHMS, FLOW CHARTING, SEQUENCES(MATHEMATICS), MATHEMATICAL MODELS, TIME SHARING, MATRICES(MATHEMATICS), COMPUTER PROGRAMMING, THESES
Subject Categories : Computer Programming and Software
Computer Hardware
Computer Systems
Distribution Statement : APPROVED FOR PUBLIC RELEASE