By Topic

Analysis of a random digraph generation technique used in the evaluation of parallel-processing static task allocation heuristics

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
$31 $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)
Wells, B.E. ; Dept. of Electr. & Comput. Eng., Alabama Univ., Huntsville, AL, USA ; Neggers, J.

One method of empirically evaluating static task allocation heuristics is to apply them to a sample of randomly generated task systems and compare the projected performance of the resulting allocations in a statistical manner with that of more established allocation heuristics. The validity of such comparisons is very much dependent on the manner in which the random task systems are generated. The authors analyze the p-method for random acyclic digraph generation empirically in terms of the expected sequentiality of randomly generated digraphs as the p parameter is varied, using mathematical entities called alignment functions and extensive computer simulation. This leads to a more complete understanding of the limitations (and possible misuses) of this methodology

Published in:

System Theory, 1993. Proceedings SSST '93., Twenty-Fifth Southeastern Symposium on

Date of Conference:

7-9 Mar 1993