On fixed priority scheduling, offsets and co-prime task periods

Information Processing Letters

Volumn 67, Issue 2, 1998, Pages 65-69

  Audsley, N C ^a   Burns, A ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Fixed priority dispatching; Performance evaluation; Real time; Scheduling analysis

Indexed keywords

REAL TIME SYSTEMS;

FIXED PRIORITY DISPATCHING; SCHEDULING ANALYSIS;

DATA PROCESSING;

EID: 0032118568     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00087-8     Document Type: Article

References (6)

1. A. Burchard, J. Liebeherr, Y. Og, S.H. Son, New strategies for assigning real-time tasks to multiprocessor systems, IEEE Trans. Comput. 44 (12) (1995) 1429-1442.
2. M.S. Fineberg, O. Serlin, Multiprogramming for hybrid computation, in: Proceedings AFIPS Fall Joint Computing Conference, 1967, pp. 1-13.
3. D.E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd edn., Addison-Wesley, 1981.
4. J.Y.T. Leung, J. Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks, Performance Evaluation 2 (4) (1982) 237-250.
5. C.L. Liu, J.W. Layland, Scheduling algorithms for multiprogramming in a hard real-time environment, J. ACM 20 (1) (1973) 46-61.
6. K.H. Rosen, Elementary Number Theory and its Applications, Addison-Wesley, 1985.