A moldable online scheduling algorithm and its application to parallel short sequence mapping
2010
A crucial step in DNA sequence analysis is mapping short sequences generated by next-generation instruments to a reference genome. In this paper, we focus on efficient online scheduling of multi-user parallel short sequence mapping queries on a multiprocessor system. With the availability of parallel execution models, the problem at hand becomes a moldable task scheduling problem where the number of processors needed to execute a task is determined by the scheduler. We propose an online scheduling algorithm to minimize the stretch of the tasks in the system. This metric provides improved fairness to small tasks compared to flow time metric and suits well to the nature of the problem. Experimental evaluation on two workload scenarios indicate that the algorithm results in significantly smaller stretch compared to a recent algorithm and it is more fair to small sized tasks.
Keywords:
- Computer science
- Lottery scheduling
- Real-time computing
- Distributed computing
- Fixed-priority pre-emptive scheduling
- Fair-share scheduling
- Dynamic priority scheduling
- Multiprocessor scheduling
- Two-level scheduling
- Rate-monotonic scheduling
- Round-robin scheduling
- Earliest deadline first scheduling
- Parallel computing
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
27
References
8
Citations
NaN
KQI