Techniques for multiprocessor real-time scheduling
Professor Sanjoy Baruah (University of North Carolina at Chapel Hill, USA)

As real-time computer system requirements become ever more complex, there is an increasing need for tool-support to assist in the design and analysis of such systems. In order to build these tools, it is necessary that the underlying theoretical and conceptual foundations be thoroughly understood. Issues of resource allocation and scheduling on uni-processor platforms are quite well understood today, with algorithms such as Earliest Deadline First, Rate- and Deadline Monotonic, etc. providing the formal foundations upon which sophisticated system design and analysis tools have been built.
However, we are witnessing an accelerating trend towards implementing real-time systems on multiprocessor and multi-core platforms. Accordingly, it is becoming imperative that we obtain a similar understanding of real-time resource-allocation and scheduling issues with respect to multiprocessor platforms as well. Much work remains to be done before we can claim that our understanding of multiprocessor scheduling is as complete as of uniprocessor scheduling; nevertheless, some very important and interesting results have been obtained over the past few years. This talk will survey these recent results, and suggest future directions of research in multiprocessor real-time scheduling theory.

printable slides

Click in the lower-right corner of the player to go to full screen.

(c) Artist Consortium, All Rights Reserved - 2006, 2007, 2008, 2009

Réalisation Axome - Création de sites Internet