|
Abhishek Singh’s Homepage |
I have joined the Concurrency
Incubation Group at Microsoft.
About Me
IIT
UNC
Here is a summary of research
I did at UNC.
Co-scheduling Real-time
and Non Real-time Tasks
We present a novel co-scheduling algorithm for
real-time (RT) and non real-time
response time sensitive (TS) tasks. Previous
co-scheduling algorithms focussed on providing
isolation to the tasks without considering the impact
of scheduling of the RT
tasks on the response times of the TS tasks. To best
utilize the available processing capacity,
the number of jobs qualifying for acceptable
performance should be maximized.
A good scheduling algorithm would reduce the deadline
overrun times for soft real-time
tasks and the response times for the TS tasks, while meeting
deadline guarantees for
the RT tasks. We propose Stochastic Processor Sharing
(SPS) algorithm that uses the empirical
probability distribution of execution times of the RT
tasks to schedule the RT tasks
such that their maximum expected processor share at
any instant is minimized. We
show theoretically and empirically that SPS provideds
significant performance benefits
in terms of reducing response
times of TS jobs over current co-scheduling algorithms.
Publications –
Singh, A. and Jeffay, K. 2007.
Co-Scheduling Variable Execution Time Requirement Real-Time Tasks and Non
Real-Time Tasks.
In Proceedings of the 19th
Euromicro Conference on Real-Time Systems (July 04 - 06, 2007).
ECRTS. IEEE Computer Society,
DOI= http://dx.doi.org/10.1109/ECRTS.2007.87
Alternate pdf
PhD Dissertation Draft (
around 18Mb file ) pdf