By Topic

Optimal and near-optimal techniques for multiprocessor scheduling of multiple-rate algorithms on synchronous multiprocessor 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)
P. R. Gelabert ; Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; T. P. Barnwell

The authors describe two multiprocessor compiler techniques that generate synchronous multiprocessor schedules for multiple-rate algorithms represented by fully specified flow graphs (FSFGs) which contain up-samplers and down-samplers. The first scheduling technique is based on a modified multi-cyclic multiprocessor compiler that finds globally optimal solutions. The second technique generates near-optimal solutions by trading global optimality for a lower scheduling complexity. These scheduling techniques are illustrated with examples

Published in:

Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on  (Volume:5 )

Date of Conference:

10-13 May 1992