
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChingChih Han, KweiJay Lin, ChaoJu Hou, "DistanceConstrained Scheduling and Its Applications to RealTime Systems," IEEE Transactions on Computers, vol. 45, no. 7, pp. 814826, July, 1996.  
BibTex  x  
@article{ 10.1109/12.508320, author = {ChingChih Han and KweiJay Lin and ChaoJu Hou}, title = {DistanceConstrained Scheduling and Its Applications to RealTime Systems}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {7}, issn = {00189340}, year = {1996}, pages = {814826}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.508320}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  DistanceConstrained Scheduling and Its Applications to RealTime Systems IS  7 SN  00189340 SP814 EP826 EPD  814826 A1  ChingChih Han, A1  KweiJay Lin, A1  ChaoJu Hou, PY  1996 KW  Distanceconstrained task systems KW  (temporal) distance constraints KW  periodic task systems KW  pinwheel problem KW  realtime scheduling/communication. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—In hard realtime systems, each task must not only be functionally correct but also meet its timing constraints. A common approach to characterizing hard realtime tasks with repetitive requests is the
In this paper, we propose the (preemptive) distanceconstrained task system model which can serve as a more intuitive and adequate scheduling model for "repetitive" task executions. We design an efficient scheduling scheme for the model, and derive a schedulability condition for the scheduling scheme. The schedulability condition is a measure for providing the fundamental predictability requirement in hard realtime applications. To show the usefulness of the distanceconstrained task model and its scheduling scheme, we also discuss how to apply the scheduling scheme to realtime sporadic task scheduling and to realtime communications.
[1] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard RealTime Environment,” J. ACM, vol. 20, no. 1, pp. 4061, 1973.
[2] C.C. Han and K.J. Lin, "Scheduling Jobs with Temporal Consistency Constraints," Proc. Sixth IEEE Workshop RealTime Operating Systems and Software, pp. 1823,Pittsburgh, May 1989.
[3] C.C. Han, K.J. Lin, and J.W.S. Liu, "Scheduling Jobs with Temporal Distance Constraints," SIAM J. Computing, vol. 24, pp. 1,1041,121, Oct. 1995.
[4] A. Elsaadany, M. Singhal, and M. Liu, "Priority Communication Schemes on Local Area Networks for Multimedia Traffic," Proc. 19th Conf. Local Computer Networks, pp. 372379, Oct. 1994.
[5] J. Boudec, “The Asynchronous Transfer Mode: A Tutorial,” Computer Networks and ISDN Systems, Vol. 24, 1992, pp. 279–309.
[6] M. Kawarasaki and B. Jabbari, “BISDN Architecture and Protocol,” IEEE J. Selected Areas in Communications, Vol. 9 No. 9 Dec. 1991, pp. 1405–1415.
[7] T. Ng and V. Patel, "Timely Failure Detection in a Large Distributed RealTime System," Proc. Int'l Workshop Object Oriented RealTime Dependable Systems,Dana Point, Calif., 1994.
[8] "Coding of Moving Pictures and Associated Audio," SC29/WG11 Committee (MPEG) Draft of Standard ISOIEC/JTC1 SC29, Nov. 1991.
[9] R. Holte, A. Mok, L. Rosier, I. Tulchinsky, and D. Varvel, The Pinwheel: A RealTime Scheduling Problem Proc. 22nd Hawaii Int'l Conf. System Science, pp. 693702, Jan. 1989.
[10] M.Y. Chan and F. Chin, "Schedulers for Larger Classes of Pinwheel Instances," Algorithmica, vol. 9, pp. 425462, 1993.
[11] S. Cheng and J.A. Stankovic,“Scheduling algorithms for hard realtime systemsa brief survey,” Hard RealTime Systems, IEEE Press, vol. 88, pp. 88173.
[12] J. Lehoczky, L. Sha, and Y. Ding, The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior Proc. IEEE RealTime Systems Symp., pp. 166171, 1989.
[13] D.W. Leinbaugh, "Guaranteed Response Time in a Hard RealTime Environment," IEEE Trans. Software Eng., Jan. 1980.
[14] J.Y.T. Leung and M.L. Merrill, "A Note on Preemptive Scheduling of Periodic, RealTime Tasks," Information Processing Letters, vol. 11, pp. 115118, Nov. 1980.
[15] J.Y.T. Leung and J. Whitehead, "On the Complexity of FixedPriority Scheduling of Periodic, RealTime Tasks," Performance Evaluation, vol. 2, pp. 237250, 1982.
[16] M. Chan and F. Chin, Schedulers for the Pinwheel Problem Based on DoubleInteger Reduction IEEE Trans. Computers, vol. 41, no. 6, pp. 755768, June 1992.
[17] R. Holte, L. Rosier, I. Tulchinsky, and D. Varvel, "Pinwheel Scheduling with Two Distinct Numbers," Theoretical Computer Science, vol. 100, no. 1, pp. 105135, June 1992.
[18] C.C. Han and K.J. Lin, "Scheduling RealTime Computations with Separation Constraints," Information Processing Letters, vol. 42, May 1992.
[19] C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, “RealTime Communication in PacketSwitched Networks,” Proc. IEEE, vol. 82, no. 1, pp. 122139, Jan. 1994.
[20] “IEEE Standards for Local and Metropolitan Area Networks: Distributed Queue Dual Bus (DQDB) Subnetwork of a Metropolitan Area Network (MAN),” IEEE802.6, July 1991.
[21] C.C. Han, C.J. Hou, and K.G. Shin, "On Slot Allocation for TimeConstrained Messages in DQDB Networks," Proc. IEEE INFOCOM '95, pp. 1,1641,171,Boston, Apr. 1995.
[22] C.C. Han and K.G. Shin, “RealTime Communication in FieldBus Multiaccess Network,” Proc. IEEE RealTime Technology and Applications Symp., pp. 8695, May 1995.