By Topic

Bounds for Maxium Parallelism in a Bilogic Graph Model of Computations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Given an acyclic directed graph where vertices represent computational tasks, arcs represent transfer of control, and two labels—called input and output logics—associated with each vertex show either the concurrency or the mutual exclusiveness of tasks, procedures are given to determine a lower and an upper bound on the number of processors required for maximum parallelism. The lower bound is obtained via a mean path length approach, while the upper bound is based on the structure of the graph. A detailed algorithm is given for the latter. First, some reduction rules are applied yielding a subset of the vertices which can be performed in parallel. Then the maximum cut in the graph is determined taking into account mutually exclusive vertices. Results are given for example graphs.

Published in:

Computers, IEEE Transactions on  (Volume:C-18 ,  Issue: 11 )