Loading...
Please wait, while we are loading the content...
Similar Documents
Assigning Real-Time Tasks on Heterogeneous Multiprocessors with Two Types of Processors
| Content Provider | Semantic Scholar |
|---|---|
| Author | Andersson, Björn Bletsas, Konstantinos |
| Copyright Year | 2009 |
| Abstract | Consider the problem of scheduling a set of implicit deadline sporadic tasks on a heterogeneous multiprocessor so as to meet all deadlines. Tasks cannot migrate and the platform is restricted in that each processor is either of type-1 or type-2 (with each task characterized by a different speed of execution upon each type of processor). We present an algorithm for this problem with a time complexity of O(n*m), where n is the number of tasks and m is the number of processors. It offers the guarantee that if a task set can be scheduled by any non-migrative algorithm to meet deadlines then our algorithm meets deadlines as well if given processors twice as fast. Although this result is proven for only a restricted heterogeneous multiprocessor, we consider it significant for being the first realtime scheduling algorithm to use a lowcomplexity binpacking approach to schedule tasks on a heterogeneous multiprocessor with provably good performance. Assigning Real-Time Tasks on Heterogeneous Multiprocessors with Two Types of Processors Bjorn Andersson and Konstantinos Bletsas IPP-HURRAY Research Group, CISTER/ISEP, Polytechnic Institute of Porto Rua Dr. Antonio Bernardino de Almeida 431, 4200-072 Porto, Portugal bandersson@dei.isep.ipp.pt, ksbs@isep.ipp.pt |
| Starting Page | 1 |
| Ending Page | 12 |
| Page Count | 12 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cister.isep.ipp.pt/docs/assigning_real_time_tasks_on_heterogeneous_multiprocessors_with_two_types_of_processors/514/attach.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |