Static scheduling of pipelined periodic tasks in distributed real-time systems

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 1997, Pages 128-135

  Fohler, G ^a   Ramamritham, K ^a  

^a The Manning College of Information and Computer Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED REAL TIME SYSTEM; DISTRIBUTED SYSTEMS; META-ALGORITHMS; PERIODIC ACTIVITY; REAL-TIME APPLICATION; SIMULATION STUDIES; STATIC SCHEDULING; TIMING CONSTRAINTS;

INTERACTIVE COMPUTER SYSTEMS; SCHEDULING ALGORITHMS;

REAL TIME SYSTEMS;

EID: 84884662019     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMWRTS.1997.613773     Document Type: Conference Paper

References (14)

1. J. Bannister and K. Trivedi. Task allocation in fault-tolerant distributed systems. Acta Informatica, 20:261-281, 1983. (Pubitemid 14531850)
2. H. Chetto, M. Silly, and T. Bouchentouf. Dynamic scheduling of real-time tasks under precedence constraints. Real-Time Systems, 2(3): 181-194, Sept. 1990.
3. G. Fohler. Analyzing a pre run-time scheduling algorithm and precedence graphs. Research Report 13/92, Institut für Technische Informatik, Technische Universität Wien, Vienna, Austria, Sept. 1992.
4. G. Fohler. Realizing changes of operational modes with pre run-time scheduled hard real-time systems. In Proc. of the Second International Workshop on Responsive Computer Systems, Saitama, Japan, October 1992.
5. G. Fohler. Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems. In Proc. 16th Real-Time Systems Symposium, Pisa, Italy, Dec. 1995.
6. M. G. Harbour and J. Lehoczky. Fixed priority scheduling of periodic task sets with varying execution priority. In Proc. 12th Real-Time Systems Symposium, pages 116-128, Dec. 1991.
7. C. Krishna and K. Shin. Scheduling tasks with a quick recovery from failure. IEEE Transactions on Computers, 35(5):448-455, May 1986.
8. J. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Proc. 11th Real-Time Systems Symposium, pages 201-212, Dec. 1990.
9. N. Malcolm and W. Zhao. Hard real-time communication in multiple-access networks. Real-Time Systems, 8 (1):35-78, Jan. 1995.
10. K. Ramamritham. Allocation and scheduling of complex periodic tasks. In 10th Int. Conf. on Distributed Computing Systems, pages 108-115, 1990.
11. J. Sun, R. Bettati, and J. W.-S. Liu. An end-to-end approach to schedule tasks with shared resources in multiprocessor systems. In Proc. of the Eleventh Workshop on Real-Time Operating Systems and Sofware, May 1994.
12. K. Tindell, A. Burns, and A. Wellings. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Systems, 6(2): 133-152, March 1994.
13. A. Welzl. GRAPHGEN - Generation of Precedence Graphs. MARS Praktikum, Vienna, Austria, Dec. 1989.
14. J. Xu and D. L. Parnas. On satisfying timing constraints in hard real-time systems. IEEE Transactions on Software Engineering, 19(1):70-84, Jan. 1993.