Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Categorization of Realtime Multiprocessor Scheduling Problems and Algorithms
 

Summary: A Categorization of Real­time Multiprocessor
Scheduling Problems and Algorithms
John Carpenter, Shelby Funk, Philip Holman, Anand Srinivasan,
James Anderson, and Sanjoy Baruah
Department of Computer Science, University of North Carolina at Chapel Hill
1 Introduction
Real­time multiprocessor systems are now commonplace. Designs range from single­chip archi­
tectures, with a modest number of processors, to large­scale signal­processing systems, such as
synthetic­aperture radar systems. For uniprocessor systems, the problem of ensuring that deadline
constraints are met has been widely studied: e#ective scheduling algorithms that take into account
the many complexities that arise in real systems (e.g., synchronization costs, system overheads, etc.)
are well understood. In contrast, researchers are just beginning to understand the trade­o#s that
exist in multiprocessor systems. In this chapter, we analyze the trade­o#s involved in scheduling
independent, periodic real­time tasks on a multiprocessor.
Research on real­time scheduling has largely focused on the problem of scheduling of recurring
processes, or tasks. The periodic task model of Liu and Layland is the simplest model of a recurring
process [16, 17]. In this model, a task T is characterized by two parameters: a worst­case execution
requirement e and a period p. Such a task is invoked at each nonnegative integer multiple of p. (Task
invocations are also called job releases or job arrivals.) Each invocation requires at most e units
1

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences