Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Rate-optimal scheduling for cyclo-static and periodic schedules

By: Liang-Fang Chao; Sha, E.H.-M.;

1995 / IEEE / 0-7803-2431-5


This item was taken from the IEEE Periodical ' Rate-optimal scheduling for cyclo-static and periodic schedules ' In order to realize DSP applications on multiprocessor systems with the optimal throughput, the properties and efficient techniques need to be derived. Rate-optimal scheduling with minimum unfolding has been studied in the past for static schedules only. The scheduling models called cyclo-static and periodic schedules allow more flexibility in processor assignment. This paper derives the minimum unfolding factors required to achieve rate-optimal schedules for cyclo-static and periodic schedules. The necessary and sufficient conditions for the existence of these schedules are also derived. From these results, it is shown that unfolding is necessary under these two models for certain data flow graphs to achieve rate-optimality. Furthermore, all the theorems are proved in a constructive way, in which an efficient shortest-path algorithm is used for scheduling.