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...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/10025/ |
| _version_ | 1848891994206633984 |
|---|---|
| author | Chuprat, Suriayati Baruah, Sanjoy |
| author_facet | Chuprat, Suriayati Baruah, Sanjoy |
| author_sort | Chuprat, Suriayati |
| building | UTeM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T21:06:48Z |
| format | Conference or Workshop Item |
| id | utm-10025 |
| institution | Universiti Teknologi Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T21:06:48Z |
| publishDate | 2008 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utm-100252020-03-17T08:03:47Z http://eprints.utm.my/10025/ Scheduling divisible real-time loads on clusters with varying processor start times Chuprat, Suriayati Baruah, Sanjoy QA75 Electronic computers. Computer science 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. 2008 Conference or Workshop Item PeerReviewed Chuprat, Suriayati and Baruah, Sanjoy (2008) Scheduling divisible real-time loads on clusters with varying processor start times. In: 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2008. RTCSA '08, 25-27 Aug. 2008, Kaohsiung, Taiwan. http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:129626 doi:10.1109/RTCSA.2008.23 |
| spellingShingle | QA75 Electronic computers. Computer science Chuprat, Suriayati Baruah, Sanjoy Scheduling divisible real-time loads on clusters with varying processor start times |
| title | Scheduling divisible real-time loads on clusters with varying processor start times |
| title_full | Scheduling divisible real-time loads on clusters with varying processor start times |
| title_fullStr | Scheduling divisible real-time loads on clusters with varying processor start times |
| title_full_unstemmed | Scheduling divisible real-time loads on clusters with varying processor start times |
| title_short | Scheduling divisible real-time loads on clusters with varying processor start times |
| title_sort | scheduling divisible real-time loads on clusters with varying processor start times |
| topic | QA75 Electronic computers. Computer science |
| url | http://eprints.utm.my/10025/ http://eprints.utm.my/10025/ http://eprints.utm.my/10025/ |