Schedulability analysis of multiprocessor sporadic task systems

In this chapter, we consider the scheduling of systems of independent sporadic tasks to meet hard deadlines upon platforms comprised of several identical processors. Although this field is very new, a large number of interesting and important results have recently been obtained. We focus on presenting the results within the context of what seems to be a natural classification scheme (described in Section 3.2.2). Space considerations rule out the possibility of providing proofs of these results; instead, we provide references to primary sources where possible.