By Topic

Different approaches to real-time application allocation to a multiprocessor system

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

1 Author(s)
S. Vranes ; Comput. Dept. Inst. Mihailo Pupin, Belgrade, Yugoslavia

Existing approaches to the design of real-time application assignment algorithms are classified and evaluated. The different approaches considered are: one described by T.L. Casavant and J.G. Kuhl (IEEE Trans. Soft. Eng., vol.14, no.2, 1988), load balancing, interprocessor communication minimization, fixed allocation first, those that use precedence consideration methods, and constraint allocation. The influence of the module size ratio and module replication are also noted. A method is then briefly reviewed that tries to combine all mentioned policies in a flexible way. This means the user can always emphasize the criterion which is the most important for a particular real-time application

Published in:

Real Time, 1989. Proceedings., Euromicro Workshop on

Date of Conference:

14-16 Jun 1989