Date Added: May 2011
Multi-core processors offer a significant performance increase over single core processors. Therefore, they have the potential to enable real-time applications that must complete large amounts of computation within stringent timing constraints that cannot be met on traditional single-core processors. However, most results in traditional multiprocessor real-time scheduling are limited to sequential programming models and ignore task parallelism. In this paper, the authors address the problem of scheduling periodic parallel tasks with implicit deadlines on multi-core processors. They first consider a synchronous task model where each task consists of segments containing equal length threads, and all threads of a segment synchronize at the end of the segment.