Scheduling divisible real-time loads on clusters with varying processor start times
Recent research in real-time divisible load theory (RT-DLT) has addressed the problem of distributing arbitrarily parallelizable real-time workloads among processors which become available at different instants in the future. Given a real-time job and the times as which the processors become availab...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/10025/ http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:129626 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Recent research in real-time divisible load theory (RT-DLT) has addressed the problem of distributing arbitrarily parallelizable real-time workloads among processors which become available at different instants in the future. Given a real-time job and the times as which the processors become available, we devise exact efficient algorithms to solve two important problems: (i) determine the smallest number of processors needed to complete this job by its deadline; and (ii) given a specific number of processors, determine the earliest completion time for the job on these processors. |
|---|