Minimizing the number of processors for real-time distributed systems

In this paper we pr esent a ne w sear ch method for par -titioning and scheduling a set of periodic tasks on a multi-pr ocessor or distrib uted ar chitectur e. The schedule is Þxed-priority driven and task migr ation is not allowed. The aimof this algorithm is to minimize the number of pr ocessor sused for scheduling a set of tasks. Mor eo ver , we assumethat the number of pr ocessor s obtained by our method isoptimal in respect to the holistic analysis. The paper thencompar es experimental results from the pr esented methodto the FBB-FFD [9] partitioning algorithm in a multipr o-cessor conte xt.

[1]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[2]  Pierre N. Robillard,et al.  Scheduling with earliest start and due date constraints on multiple machines , 1975 .

[3]  Petru Eles,et al.  Holistic scheduling and analysis of mixed time/event-triggered distributed embedded systems , 2002, Proceedings of the Tenth International Symposium on Hardware/Software Codesign. CODES 2002 (IEEE Cat. No.02TH8627).

[4]  Sanjoy K. Baruah,et al.  Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors , 2004, IEEE Transactions on Computers.

[5]  Sanjoy K. Baruah,et al.  The partitioned multiprocessor scheduling of sporadic task systems , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[6]  Giorgio C. Buttazzo,et al.  Biasing effects in schedulability measures , 2004, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004..

[7]  Jan Jonsson,et al.  Evaluation and comparison of task allocation and scheduling methods for distributed real-time systems , 1996, Proceedings of ICECCS '96: 2nd IEEE International Conference on Engineering of Complex Computer Systems (held jointly with 6th CSESAW and 4th IEEE RTAW).

[8]  Joan Vila i Carbó,et al.  Using exact feasibility tests for allocating real-time tasks in multiprocessor systems , 1998, Proceeding. 10th EUROMICRO Workshop on Real-Time Systems (Cat. No.98EX168).

[9]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[10]  Sang Hyuk Son,et al.  New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems , 1995, IEEE Trans. Computers.

[11]  Matt W. Mutka,et al.  A tool for allocating periodic real-time tasks to a set of processors , 1995, J. Syst. Softw..

[12]  Sanjoy K. Baruah,et al.  Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors , 2003, Real-Time Systems.

[13]  Giuseppe Lipari,et al.  Improved schedulability analysis of EDF on multiprocessor platforms , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[14]  Mikael Sjödin,et al.  Improved response-time analysis calculations , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[15]  Michaël Richard.  Contribution à la validation des systèmes temps réel distribués : ordonnancement à priorités fixes et placement , 2002 .

[16]  Ricardo Cayssials,et al.  A Heuristic Approach to the Multitask-Multiprocessor Assignment Problem using the Empty-Slots Method and Rate Monotonic Scheduling , 1997, Real-Time Systems.

[17]  Sang Hyuk Son,et al.  Allocating fixed-priority periodic tasks on multiprocessor systems , 1995, Real-Time Systems.

[18]  Pascal Richard,et al.  Allocating and scheduling tasks in multiple fieldbus real-time systems , 2003, EFTA 2003. 2003 IEEE Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.03TH8696).

[19]  Ricardo Cayssials,et al.  Precedence constraints in hard real-time distributed systems , 1997, Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168).

[20]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[21]  Theodore P. Baker,et al.  An analysis of EDF schedulability on a multiprocessor , 2005, IEEE Transactions on Parallel and Distributed Systems.

[22]  Theodore P. Baker.  An Analysis of Deadline-Monotonic Schedulability on a Multiprocessor , 2003 .

[23]  Giuseppe Lipari,et al.  Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling , 2007, J. Comput. Syst. Sci..

[24]  Kang G. Shin,et al.  Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems , 1997, IEEE Trans. Software Eng..

[25]  Marco Spuri,et al.  Holistic Analysis for Deadline Scheduled Real-Time Distributed Systems , 1996 .

[26]  Alan Burns,et al.  Allocating hard real-time tasks: An NP-Hard problem made easy , 1992, Real-Time Systems.

[27]  Hans A. Hansson,et al.  The Slack Method: A New Method for Static Allocation of Hard Real-Time Tasks , 1998, Real-Time Systems.

[28]  Sanjoy K. Baruah,et al.  The partitioned scheduling of sporadic tasks according to static-priorities , 2006, 18th Euromicro Conference on Real-Time Systems (ECRTS'06).

[29]  Krithi Ramamritham,et al.  Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems , 1989, IEEE Trans. Parallel Distributed Syst..