By Topic

Imprecise computation technique to schedule AND/OR tasks with global end-to-end deadline in distributed real-time systems

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

3 Author(s)
El-Haweet, W.A. ; Dept. of Comput. Sci. & Autom. Control, Alexandria Univ., Egypt ; El-Meligy, H.H. ; El-Salam, I.A.

Directed acyclic graphs (DAGs) are used to represent AND/OR precedence constraint systems where AND tasks are ready to execute when all of their direct predecessors are completed and OR tasks are ready to execute when one or more but not necessarily all of their direct predecessors are completed. A proposed imprecise computation technique ICT is introduced to maximize the solution quality within the available time. To examine and evaluate ICT, a random graph generator algorithm (RGG) is created to provide a wide range of random DAGs to be used in the simulation experiments.

Published in:

SICE 2003 Annual Conference  (Volume:1 )

Date of Conference:

4-6 Aug. 2003