This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Granularity Metric for Fine-Grain Real-Time Scheduling
December 2005 (vol. 54 no. 12)
pp. 1572-1583
ASCII Text
x 
 
Michael A. Palis, "The Granularity Metric for Fine-Grain Real-Time Scheduling," IEEE Transactions on Computers, vol. 54, no. 12, pp. 1572-1583, December, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TC.2005.204,
author = {Michael A. Palis},
title = {The Granularity Metric for Fine-Grain Real-Time Scheduling},
journal ={IEEE Transactions on Computers},
volume = {54},
number = {12},
issn = {0018-9340},
year = {2005},
pages = {1572-1583},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.204},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - The Granularity Metric for Fine-Grain Real-Time Scheduling
IS - 12
SN - 0018-9340
SP1572
EP1583
EPD - 1572-1583
A1 - Michael A. Palis,
PY - 2005
KW - Index Terms- Real-time systems
KW - scheduling
KW - quality of service provisioning
KW - online algorithms.
VL - 54
JA - IEEE Transactions on Computers
ER -
 
This paper investigates the task scheduling problem for real-time systems that provide rate of progress guarantees on task execution. A parameterized task system model, called the (r,g) task system, is introduced that allows rate of progress requirements to be specified in terms of two simple parameters: an execution rate r and a granularity g. The granularity parameter is a new metric that allows the specification of "fine-grain” timing constraints on the task's execution and is a generalization of the stretch metric used in recent research on task scheduling. It is shown that the product r \lg(1/g) is an important determiner of the existence of good online scheduling algorithms. Specifically, there is an upper bound on this product above which there are no good online algorithms, but below which an online algorithm with logarithmic competitive ratio exists. This paper also demonstrates a fundamental difference between two contrasting strategies for admission control: greedy versus nongreedy. It is shown that "greed does not pay”: there is a scheduling algorithm with a nongreedy admission policy that provably outperforms the well-known Greedy EDF scheduling algorithm.

[1] J. Anderson and A. Srinivasan, “Early Release Fair Scheduling,” Proc. 12th Euromicro Conf. Real-Time Systems, pp. 35-43, June 2000.
[2] J. Anderson and A. Srinivasan, “Pfair Scheduling: Beyond Periodic Task Systems,” Proc. Seventh Int'l Conf. Real-Time Computing Systems and Applications, pp. 297-306, Dec. 2000.
[3] B. Awerbuch, Y. Azar, and S. Plotkin, “Throughout-Competitive On-Line Routing,” Proc. 34th IEEE Symp. Foundations of Computer Science, pp. 32-40, Nov. 1993.
[4] S. Baruah, D. Chen, S. Gorinksy, and A. Mok, “Generalized Multiframe Tasks,” Int'l J. Time-Critical Computing Systems, vol. 17, pp. 5-22, 1999.
[5] S. Baruah, N. Cohen, C.G. Plaxton, and D. Varvel, “Proportionate Progress: A Notion of Fairness in Resource Allocation,” Algorithmica, vol. 15, pp. 600-625, 1996.
[6] S. Baruah, J. Gehrke, and C.G. Plaxton, “Fast Scheduling of Periodic Tasks on Multiple Resources,” Proc. Ninth Intl Parallel Processing Symp., pp. 280-288, Apr. 1995.
[7] L. Becchetti, S. Leonardi, and S. Muthukrishnan, “Scheduling to Minimize Average Stretch without Migration,” Proc. 11th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 548-557, 2000.
[8] M. Bender, S. Chakrabarti, and S. Muthukrishnan, “Flow and Stretch Metrics for Scheduling Continuous Task Streams,” Proc. Ninth Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 270-279, 1998.
[9] M. Bender, S. Muthukrishnan, and R. Rajaraman, “Improved Algorithms for Stretch Scheduling,” Proc. 13th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 762-771, 2002.
[10] B. Dasgupta and M.A. Palis, “Online Real-Time Preemptive Scheduling of Tasks with Deadlines on Multiple Machines,” Proc. Third Int'l Workshop Approximation Algorithms for Combinatorial Optimization Problems, pp. 96-107, 2000.
[11] B. Dasgupta and M.A. Palis, “Online Real-Time Preemptive Scheduling of Tasks with Deadlines on Multiple Machines,” J. Scheduling, vol. 4, no. 6, pp. 297-312, 2001.
[12] M. Dertouzos, “Control Robotics: the Procedural Control of Physical Processors,” Proc. IFIP Congress, pp. 807-813, 1974.
[13] M. Dertouzos and A. Mok, “Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks,” IEEE Trans. Software Eng., vol. 15, no. 12, pp. 1497-1506, Dec. 1989.
[14] J. Garay, J. Naor, B. Yener, and P. Zhao, “On-Line Admission Control and Packet Scheduling with Interleaving,” Proc. IEEE INFOCOM 2002, pp. 94-103, June 2002.
[15] M. Goldwasser, “Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control,” Proc. 10th ACM-SIAM Symp. Discrete Algorithms, pp. 396-405, Jan. 1999.
[16] K. Jeffay and S. Goddard, “A Theory of Rate-Based Execution,” Proc. 20th IEEE Real-Time Systems Symp., pp. 304-314, Dec. 1999.
[17] M. Jones, J. Barbera III, and A. Forin, “An Overview of the Rialto Real-Time Architecture,” Proc. Seventh ACM SIGOPS European Workshop, pp. 249-256, Sept. 1996.
[18] M. Jones, D. Rosu, and M.-C. Rosu, “CPU Reservations and Time Constraints: Efficient, Predictable Scheduling of Independent Activities,” Proc. 16th ACM Symp. Operating Systems Principles, pp. 198-211, Oct. 1997.
[19] J.Y.-T. Leung and J. Whitehead, “On the Complexity of Fixed-Priority Scheduling of Periodic Real-Time Tasks,” Performance Evaluation, vol. 2, no. 4, pp. 237-250, Dec. 1982.
[20] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real Time Environment,” J. ACM, vol. 20, pp. 46-61, 1973.
[21] A. Mok, “Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment,” doctoral dissertation, Massachusetts Inst. of Tech nology, 1983.
[22] A. Mok and D. Chen, “A Multiframe Model for Real-Time Tasks,” IEEE Trans. Software Eng., vol. 23, no. 10, pp. 635-645, Oct. 1997.
[23] S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J.E. Gehrke, “Online Scheduling to Minimize Average Stretch,” Proc. 40th Ann. IEEE Symp. Foundations of Computer Science, pp. 433-443, 1999.
[24] M.A. Palis, “On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees,” Int'l J. Foundations of Computer Science, vol. 14, no. 3, pp. 359-370, 2003.
[25] C.A. Phillips, C. Stein, E. Torng, and J. Wein, “Optimal Time-Critical Scheduling via Resource Augmentation,” Proc. 29th Ann. Symp. Theory of Computing, pp. 140-149, May 1997.
[26] S. Plotkin, “Competitive Routing of Virtual Circuits in ATM Networks,” IEEE J. Selected Areas in Comm., vol. 13, no. 6, pp. 1128-1136, Aug. 1995.
[27] A. Srinivasan and J. Anderson, “Optimal Rate-Based Scheduling on Multiprocessors,” Proc. 34th Ann. Symp. Theory of Computing, pp. 189-198, May 2002.
[28] D.K.Y. Yau and S.S. Lam, “Adaptive Rate-Controlled Scheduling for Multimedia Applications, IEEE/ACM Trans. Networking, vol. 5, no. 4, pp. 475-488, Aug. 1997.

Index Terms:
Index Terms- Real-time systems, scheduling, quality of service provisioning, online algorithms.
Citation:
Michael A. Palis, "The Granularity Metric for Fine-Grain Real-Time Scheduling," IEEE Transactions on Computers, vol. 54, no. 12, pp. 1572-1583, Dec. 2005, doi:10.1109/TC.2005.204
Usage of this product signifies your acceptance of the Terms of Use.