
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sathish Gopalakrishnan, Marco Caccamo, Lui Sha, "Sharp Thresholds for Scheduling Recurring Tasks with Distance Constraints," IEEE Transactions on Computers, vol. 57, no. 3, pp. 344358, March, 2008.  
BibTex  x  
@article{ 10.1109/TC.2007.70808, author = {Sathish Gopalakrishnan and Marco Caccamo and Lui Sha}, title = {Sharp Thresholds for Scheduling Recurring Tasks with Distance Constraints}, journal ={IEEE Transactions on Computers}, volume = {57}, number = {3}, issn = {00189340}, year = {2008}, pages = {344358}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.70808}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Sharp Thresholds for Scheduling Recurring Tasks with Distance Constraints IS  3 SN  00189340 SP344 EP358 EPD  344358 A1  Sathish Gopalakrishnan, A1  Marco Caccamo, A1  Lui Sha, PY  2008 KW  Realtime systems and embedded systems KW  Real time KW  Scheduling KW  Constraint satisfaction KW  Heuristic methods VL  57 JA  IEEE Transactions on Computers ER   
[1] R.A. Baugh, Computer Control of Modern Radars. RCA Corp., 1973.
[2] R. Bettati and J.W.S. Liu, “EndtoEnd Scheduling to Meet Deadlines in Distributed Systems,” Proc. 12th Int'l Conf. Distributed Computing Systems, pp. 452459, 1992.
[3] B. Dutertre, “Dynamic Scan Scheduling,” Proc. 23rd IEEE RealTime Systems Symp., pp. 327336, Dec. 2002.
[4] P. Erdös and A. Rényi, “On Random Graphs I,” Publicationes Mathematicae Debrecen, vol. 6, pp. 290297, 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. 1761, 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. 10171054, 1999.
[7] E. Friedgut and G. Kalai, “Every Monotone Graph Property Has a Sharp Threshold,” Proc. Am. Math. Soc., vol. 124, pp. 29933002, 1996.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. W.H. Freeman, 1979.
[9] S. Ghosh, R. Rajkumar, J. Hansen, and J.P. Lehoczky, “Integrated Resource Management and Scheduling with MultiResource Constraints,” Proc. 25th IEEE RealTime Systems Symp., pp. 1222, 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 RealTime Systems Symp., pp. 2333, 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,” RealTime Systems, vol. 33, pp. 4775, July 2006.
[12] J. Hansen, S. Ghosh, R. Rajkumar, and J.P. Lehoczky, “Resource Management of Highly Configurable Tasks,” Proc. Workshop Parallel and Distributed RealTime Systems, pp. 114121, Apr. 2004.
[13] K. Jeffay, D.F. Stanat, and C.U. Martel, “On NonPreemptive Scheduling of Periodic and Sporadic Tasks,” Proc. IEEE RealTime Systems Symp.), pp. 129139, Dec. 1991.
[14] S. Kirkpatrick and B. Selman, “Critical Behavior in the Satisfiability of Random Boolean Expressions,” Science, vol. 264, pp. 12971301, 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 RealTime Systems Symp., pp. 1424, 2003.
[16] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard RealTime Environment,” J. ACM, vol. 20, no. 1, pp. 4661, 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. 459465, 1992.
[18] A.K. Mok, D.C. Tsou, and R. de Rooij, “The MSPRTL RealTime Scheduler Synthesis Tool,” Proc. 17th IEEE RealTime Systems Symp., pp. 118128, Dec. 1996.
[19] P. Prosser, “An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems,” Artificial Intelligence, vol. 81, pp.81109, 1996.
[20] R. Rajkumar, C. Lee, J.P. Lehoczky, and D. Siewiorek, “A Resource Allocation Model for QoS Management,” Proc. 18th IEEE RealTime Systems Symp., pp. 298307, Dec. 1997.
[21] R. Rajkumar, C. Lee, J.P. Lehoczky, and D. Siewiorek, “Practical Solutions for QoSBased Resource Allocation,” Proc. 19th IEEE RealTime Systems Symp., pp. 296306, 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 RealTime Dwells Using Tasks with Synthetic Periods,” Proc. 24th IEEE RealTime Systems Symp., Dec. 2003.
[24] C.S. Shih, S. Gopalakrishnan, P. Ganti, M. Caccamo, and L. Sha, “TemplateBased RealTime Dwell Scheduling with Energy Constraint,” Proc. Ninth IEEE RealTime and Embedded Technology and Applications Symp., May 2003.
[25] J. Sun, “FixedPriority EndtoEnd Scheduling in Distributed RealTime Systems,” PhD dissertation, Dept. of Computer Science, Univ. of Illinois at UrbanaChampaign, 1997.