Allocating and scheduling tasks in multiple fieldbus real-time systems

IEEE International Conference on Emerging Technologies and Factory Automation, ETFA

Volumn 1, Issue January, 2003, Pages 137-144

  Richard, M ^a   Richard, P ^a   Cottet, F ^a  

^a ENSMA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORY AUTOMATION; INTERACTIVE COMPUTER SYSTEMS; NUMERICAL METHODS; SCHEDULING;

ALLOCATION AND SCHEDULING; DEAD-LINE MONOTONIC; END-TO-END DEADLINE; FEASIBLE SCHEDULE; FIXED-PRIORITY SCHEDULERS; HOLISTIC ANALYSIS; NUMERICAL RESULTS; REAL TIME DISTRIBUTED SYSTEMS;

REAL TIME SYSTEMS;

EID: 33646152595     PISSN: 19460740     EISSN: 19460759     Source Type: Conference Proceeding    
DOI: 10.1109/ETFA.2003.1247699     Document Type: Conference Paper

References (18)

1. J. Thomesset "Fieldbuses and interoperability," Control Engineering Practice, vol. 7, pp. 81-94, 1999.
2. M. Richard, P. Richard, and F. Collet, 'Task and message priority assignment in automotive systems," in 4th FeT 1FAC Conference on Fieldbus Systems and their Applications, 15,16 November 2001. pp. 105-112.
3. J. Leung and J. Whitehead, "On the complexity of fixed-priority scheduling of periodic real-lime tasks," Performance Evaluation, vol- 4, pp. 237-250, 1982.
4. J. R Lehoczky, "Fixed priority scheduling of periodic task sets with arbitrary deadlines," in Proceedings of Real-Time Systems Symposlum, 1991, pp. 166-171.
5. M. W. Mutka and J.-P Li, "A tool for allocating periodic real-time tasks to a set of processors," Journal Systems Software, vol. 29, pp. 135-148, 1995.
6. 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," Journal of Real-Time Systems, vol. 13, no, 2, pp. 167-199, 1997.
7. J. Orozco, R. Cayssials, J. Santos, and E. Ferro, "Precedence constraints in hard real-time distributed systems," in Proceedings of the 3rd International Conference on Engineering of Complex Computer Systems (1CECCS). 1997, pp. 33-38.
8. P. Altenbernd and H. Hansson, "The slack method: A new method for static allocation of hard real-time tasks,1' Journal of Real-Time Systems, vol. 13, no. 2, pp. 103-130, Septembre 97.
9. K. Tindell. A. Bums, and A. Wellings, "Allocating hard real-time tasks (an np-hard problem made easy)," Real-Time Systems, vol, 4, no. 2, pp. 145-165, 1992.
10. S. Saez, J. Vila, and A. Crespo, "Using exact feasibility, tests for allocating real-time tasks in multiprocessor systems," in Proceedings of the 10th Euromicro Workshop on Real Tune Systems. Berlin, Germany, 17-19 June 1998
11. Y. OH and S. H. Son, "Allocating fixed-priority periodic tasks on multiprocessor systems," Real-Time System Journal, vol. 9, no. 3, pp. 207-239. 1995.
12. D.-T. Peng, K. G. Shin, and T, F. Abdelzaher, "Assignment and schedul-ing communicating periodic tasks in distributed real-time systems," IEEE Transactions on Software Engineering, vol- 23, no. 12, 1997.
13. J. Jonsson and J. Vasell. "Evaluation and comparison of task allocation and scheduling methods for distributed real-time systems," in Proceedings of the IEEE Workshop on Real-Time Applications. Montreal, Canada, 21-25 October 1996, pp. 226-229.
14. K. W. Tindell, "Fixed priority scheduling of hard real-time systems," Ph.D. dissertation, Univerisity of York, 1994.
15. K. W. Tindell and J. Clark. "Holistic schedulability analysis for distributed hard real-time systems," Microprocessors and Microprogramming, vol. 40, 1994.
16. P. Bratley, M. Florian, and P. Robillard, "Scheduling with earliest start and due date constraints on multiple machines," Naval Research Logistic Quaterly, vol. 22, no. 1, pp. 165-173, 1975.
17. J. C. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in hard real-time evironment," ACM, vol, 20, no. 1, pp. 46-61, 1973.
18. M. Richard, Contribution a la validation des systemes temps reei distribues : ordonnancemenl a priorite's fixes et placement. PhD Thesis, University of Poitiers, 2002