Bounds For Scheduling In Non-Identical Uniform Multiprocessor Systems

Bounds For Scheduling In Non-Identical Uniform Multiprocessor Systems

With multiprocessors and multicore processors becoming ubiquitous, focus has shifted from research on uniprocessors to that on multiprocessors. Results derived for the uniprocessor case unfortunately do not always directly extend to the multiprocessor case in a straightforward manner. This necessita...

Full description

Bibliographic Details
Main Author: Darera, Vivek N
Other Authors: Jenkins, Lawrence
Language:en_US
Published: 2008
Subjects:
Multiprocessing
Multiprocessor Systems - Scheduling Algorithms
Dynamic-Priority Scheduling
Fixed-Priority Scheduling
Uniform Multiprocessor Model
Multiprocessor Scheduling
Allocation Decreasing Algorithm
Earliest Deadline First (EDF)
Rate Monotonic (RM)
Computer Science
Online Access:http://hdl.handle.net/2005/342

Internet

http://hdl.handle.net/2005/342

Similar Items