By Topic

Scheduling of periodic time critical applications for pipelined execution on heterogeneous 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
$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)
S. Ranaweera ; LSI Logic Corp., Colorado Springs, CO, USA ; D. P. Agrawal

Allocation of tasks of a periodic, time critical application, onto a set of processors, with task duplication is examined here. Pipelined execution, where computations and communications take place simultaneously, is employed to meet the required flow rate of the application. The prime objective of the algorithm is to reduce the number of pipeline stages and/or the pipeline period and thereby reducing pipeline latency. The algorithm is well suited for both homogeneous and heterogeneous systems and it is scalable. The order of complexity of the algorithm is O(/spl nu//sup 2/), where /spl nu/ is the number of nodes in directed acyclic task graph (DAG) representing the application. Simulations have indicated that the proposed algorithm generates 9%-52% shorter pipelines.

Published in:

Parallel Processing, 2001. International Conference on

Date of Conference:

3-7 Sept. 2001