The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2008 vol.57)
pp: 344-358
ABSTRACT
The problem of identifying suitable conditions for the schedulability of (non-preemptive) recurring tasks with deadlines is of great importance to real-time systems. In this article, motivated by the problem of scheduling radar dwells, we show that scheduling problems of this nature show a sharp threshold behavior with respect to system utilization. Sharp thresholds are associated with phase transitions: when the utilization of a task set is less than a critical value it can be scheduled almost surely, and when the utilization increases beyond the critical level almost no task set can be scheduled. We make connections to work on random graphs to prove sharp threshold behavior in the scheduling problem of interest. Using extensive experiments, we determine the threshold for the radar dwell scheduling problem and use it for performance optimization. The connections to random graph theory suggest new ways for understanding the average-case behavior of scheduling policies. These results emphasize the ease with which performance can be controlled in a variety of real-time systems.
INDEX TERMS
Real-time systems and embedded systems, Real time, Scheduling, Constraint satisfaction, Heuristic methods
CITATION
Sathish Gopalakrishnan, Marco Caccamo, Lui Sha, "Sharp Thresholds for Scheduling Recurring Tasks with Distance Constraints", IEEE Transactions on Computers, vol.57, no. 3, pp. 344-358, March 2008, doi:10.1109/TC.2007.70808
REFERENCES
[1] R.A. Baugh, Computer Control of Modern Radars. RCA Corp., 1973.
[2] R. Bettati and J.W.-S. Liu, “End-to-End Scheduling to Meet Deadlines in Distributed Systems,” Proc. 12th Int'l Conf. Distributed Computing Systems, pp. 452-459, 1992.
[3] B. Dutertre, “Dynamic Scan Scheduling,” Proc. 23rd IEEE Real-Time Systems Symp., pp. 327-336, Dec. 2002.
[4] P. Erdös and A. Rényi, “On Random Graphs I,” Publicationes Mathematicae Debrecen, vol. 6, pp. 290-297, 1959.
[5] P. Erdös and A. Rényi, “On the Evolution of Random Graphs,” Publications of Math. Inst. of the Hungarian Academy of Sciences, vol. 5, pp. 17-61, 1960.
[6] E. Friedgut, “Sharp Thresholds for Graph Properties, and the $k\hbox{-}{\rm SAT}$ Problem,” with an appendix by Jean Bourgain, J. Am. Math. Soc., vol. 124, pp. 1017-1054, 1999.
[7] E. Friedgut and G. Kalai, “Every Monotone Graph Property Has a Sharp Threshold,” Proc. Am. Math. Soc., vol. 124, pp. 2993-3002, 1996.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[9] S. Ghosh, R. Rajkumar, J. Hansen, and J.P. Lehoczky, “Integrated Resource Management and Scheduling with Multi-Resource Constraints,” Proc. 25th IEEE Real-Time Systems Symp., pp. 12-22, Dec. 2004.
[10] S. Gopalakrishnan, M. Caccamo, C.-S. Shih, C.-G. Lee, and L. Sha, “Finite Horizon Scheduling of Radar Dwells with Online Template Construction,” Proc. 25th IEEE Real-Time Systems Symp., pp. 23-33, Dec. 2004.
[11] S. Gopalakrishnan, C.-S. Shih, M. Caccamo, L. Sha, and C.-G. Lee, “Finite Horizon Scheduling of Radar Dwells with Online Template Construction,” Real-Time Systems, vol. 33, pp. 47-75, July 2006.
[12] J. Hansen, S. Ghosh, R. Rajkumar, and J.P. Lehoczky, “Resource Management of Highly Configurable Tasks,” Proc. Workshop Parallel and Distributed Real-Time Systems, pp. 114-121, Apr. 2004.
[13] K. Jeffay, D.F. Stanat, and C.U. Martel, “On Non-Preemptive Scheduling of Periodic and Sporadic Tasks,” Proc. IEEE Real-Time Systems Symp.), pp. 129-139, Dec. 1991.
[14] S. Kirkpatrick and B. Selman, “Critical Behavior in the Satisfiability of Random Boolean Expressions,” Science, vol. 264, pp. 1297-1301, 1994.
[15] C.-G. Lee, P.-S. Kang, C.-S. Shih, and L. Sha, “Radar Dwell Scheduling Considering Physical Characteristics of Phased Array Antenna,” Proc. 24th IEEE Real-Time Systems Symp., pp. 14-24, 2003.
[16] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[17] D. Mitchell, B. Selman, and H. Levesque, “Hard and Easy Distributions of SAT Problems,” Proc. 10th Nat'l Conf. Artificial Intelligence, pp. 459-465, 1992.
[18] A.K. Mok, D.-C. Tsou, and R. de Rooij, “The MSP-RTL Real-Time Scheduler Synthesis Tool,” Proc. 17th IEEE Real-Time Systems Symp., pp. 118-128, Dec. 1996.
[19] P. Prosser, “An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems,” Artificial Intelligence, vol. 81, pp.81-109, 1996.
[20] R. Rajkumar, C. Lee, J.P. Lehoczky, and D. Siewiorek, “A Resource Allocation Model for QoS Management,” Proc. 18th IEEE Real-Time Systems Symp., pp. 298-307, Dec. 1997.
[21] R. Rajkumar, C. Lee, J.P. Lehoczky, and D. Siewiorek, “Practical Solutions for QoS-Based Resource Allocation,” Proc. 19th IEEE Real-Time Systems Symp., pp. 296-306, Dec. 1998.
[22] B. Selman, “Stochastic Search and Threshold Phenomena: AI Meets Physics,” Proc. Int'l Joint Conf. Artificial Intelligence, Aug. 1995.
[23] C.-S. Shih, S. Gopalakrishnan, P. Ganti, M. Caccamo, and L. Sha, “Scheduling Real-Time Dwells Using Tasks with Synthetic Periods,” Proc. 24th IEEE Real-Time Systems Symp., Dec. 2003.
[24] C.-S. Shih, S. Gopalakrishnan, P. Ganti, M. Caccamo, and L. Sha, “Template-Based Real-Time Dwell Scheduling with Energy Constraint,” Proc. Ninth IEEE Real-Time and Embedded Technology and Applications Symp., May 2003.
[25] J. Sun, “Fixed-Priority End-to-End Scheduling in Distributed Real-Time Systems,” PhD dissertation, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1997.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool