A new on-line scheduling algorithm for distributed real-time system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3061, Issue , 2004, Pages 241-251

  Hakem, Mourad ^a   Butelle, Franck ^a  

^a UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION MANAGEMENT; INTERACTIVE COMPUTER SYSTEMS; REAL TIME SYSTEMS;

ALL PAIRS SHORTEST PATHS; APERIODIC TASK; DISTRIBUTED REAL TIME SYSTEM; DISTRIBUTED SCHEDULING ALGORITHMS; KEY FEATURE; LOCAL LOADS; ON-LINE ALGORITHMS;

SCHEDULING ALGORITHMS;

EID: 34548710204     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25958-9_22     Document Type: Article

References (11)

1. Graham, R. L., Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Dis. Math. 5 (1979)
2. Chang, H.Y., Livny, M.: Distributed scheduling under deadline constraints: a comparison of sender-initiated and receiver initiated approaches. In: Proc. IEEE Int. Conf. on Distr. Comp. Syst. (1986) 175-180
3. Ramos Corchado, F. F.: A MultiAgent approach to dynamic request placement in the Global Information Systems. PhD thesis, Université de Technologie de Compiègne (1997)
4. Shivaratri, N. G., Singhal, M.: A transfer policy for global scheduling algorithms to schedule tasks with deadline. In: Proc. IEEE Int. Conf. on Distr. Comp. Syst. (1991) 248-255
5. Zhao, W., Ramamritham, K.: Distributed scheduling using bidding and focussed adressing. In: Proc. IEEE Real-time Systems Symposium. (1985) 103-111
6. Ramamritham, K., Stankovic, J.A., Zhao, W.: Distributed schedulings of tasks with deadlines and resource requirements. In: Proc. IEEE trans. on Computers. Volume 38. (1989) 1110-1123
7. Stankovic, J. A., Krithivasan Ramamritham, S. C.: Evaluation of a flexible task scheduling algorithm for distributed hard real time systems. In: Proc. IEEE trans. on Computers. Volume C-34. (1985) 1130-143
8. Chetto, H., Chetto, M.: Some results of the earliest deadline scheduling algorithm. In: Proc. IEEE trans. on Soft. Eng. Volume 15. (1989) 1261-1269
9. Schwan, K., Zhou, H.: Dynamic scheduling of hard real-time tasks and hard realtime threads. In: Proc. IEEE Trans. on Softw. Eng. Volume 18. (1992) 736-747
10. Butelle, P., Lavault, C.: Distributed algorithms for all-pairs shortest paths and minimum diameter spanning tree problems. In: Distributed Computing: OPODIS'98 (Proceedings of the 2nd Int. Conf. On Principles Of Distributed Systems), Hermès (1999) 77-88
11. Liu, C. L., Layland, J. W.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journ. of the Assoc. for Comp. Machinery (1973) 46-61