The Partitioned Dynamic-Priority Scheduling of Sporadic Task Systems

Download Now
Provided by: Wayne Stansfield
Topic: Hardware
Format: PDF
Most prior theoretical research concerning the multiprocessor scheduling of sporadic task systems has imposed the additional constraint that all tasks have their deadline parameter equal to their period parameter. In this paper, the authors have removed this constraint, and have considered the scheduling of arbitrary sporadic task systems upon preemptive multiprocessor platforms, under the partitioned paradigm of multiprocessor scheduling. They have designed an algorithm for performing the partitioning of a given collection of sporadic tasks upon a specified number of processors, and have proved the correctness of, and evaluated the effectiveness of, this partitioned algorithm.
Download Now

Find By Topic