Precedence constraints in hard real-time distributed systems

Proceedings of the IEEE International Conference on Engineering of Complex Computer Systems, ICECCS

Volumn , Issue , 1997, Pages 33-38

  Orozco, J ^a   Cayssials, R ^a   Santos, J ^a   Ferro, E ^a  

^a UNIVERSIDAD NACIONAL DEL SUR   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

REAL TIME SYSTEMS;

COMMUNICATIONS NETWORKS; DISTRIBUTED SYSTEMS; HARD REAL-TIME; HARD REAL-TIME DISTRIBUTED SYSTEMS; HARD-REAL-TIME; MULTI PROCESSOR SYSTEMS; PERIODIC TASKS; PRECEDENCE CONSTRAINTS; TIME-ALLOCATION;

COMPUTATIONAL COMPLEXITY;

EID: 56149116640     PISSN: 27708527     EISSN: 27708535     Source Type: Conference Proceeding    
DOI: 10.1109/ICECCS.1997.622294     Document Type: Conference Paper

References (12)

1. K. Ramamritham, Allocation and scheduling of complex periodic tasks, in: Proc. IOth International Conference on Distributed Computing Systems, (1990) 108-1 15.
2. K. Tindell, A. Burns and A. Wellings, Allocating hard real-time tasks: An NP-hard problem made easy, Real-Time Systems Journal, 4 (1992) 145165.
3. J. Orozco, R. Cayssials, J. Santos and E. Ferro, Design of a Learning Fuzzy Production System to Solve an NP-Hard Real-Time Assignment Problem, Proc. 8-th Euromicro Workshop on Real-Time Systems, L'Aquila, Italy, June 12-14, 1996, 146-150.
4. J. Santos, E. Ferro, J. Orozco and R. Cayssials, A Heuristic Approach to the Multitask-Multiprocessor Assignment Problem using the Empty-Slots Method and Rate Monotonic Scheduling. Real-Time Systems Journal. To be published.
5. J. Santos and J. Orozco, Rate Monotonic scheduling in hard real-time systems, Information Processing Letters, 48 (1993) 39-45.
6. H. Chetto, M. Silly and T. Bouchentouf, Dynamic scheduling of real;-time tasks under precedence constraints, Real Time Systems Journal, 2, 181194.
7. J. Xu and D. Lorge Parnas, Scheduling processes with release times, deadlines, precedence and exclusion relations, IEEE Trans. Software Eng, 16 (3) (1993) 360-369.
8. C. L. Liu and J. W. Layland, Scheduling algorithms for multiprogramming in a hard real-time-environment, J. ACM, 20 (1) (1973) 46-61.
9. R. Obenza, Rate monotonic analysis for real-time systems, IEEE Computer, 26 (3) (1993) 73-74.
10. M. Joseph and P. Pandya, Finding response times in a real-time system. The Computer Journal, 29 (5) (1986) 390-395.
11. J. P. Lehozcky, L. Sha and Y. Ding, The rate monotonic scheduling algorithm: Exact characterization and average case behavior, in: Proc. Real-Time Systems Symp. IEEE CS, (Los Alamitos, CA, 1989) 166-171.
12. K. Tindell, A. Burns and A. Wellings, Analysis of hard real-time communications, Real-Time Systems Journal, 9 (2) (1995) 147-172.