Restricted migration of periodic and sporadic tasks on uniform heterogeneous mul- tiprocessors is considered. Migration between different processors of a multiprocessor causes overhead that may be prohibitively high for real-time systems, where accurate timing is es- sential. Nonetheless, periodic tasks, which generate jobs at regular intervals, may be able to migrate without causing overhead if the migration can be controlled. In particular, if consecu- tive jobs of the same task do not share any data then they may be allowed to execute on different processors without incurring migration overhead — i.e., restricted migration may be permitted. On uniform multiprocessors, each processor has an associated speed. A job executing on a processor of speeds for t units of time will performs◊t units of work. A utilization-based test for restricted migration on uniform multiprocessors is presented where each processor sched- ules jobs using the earliest deadline first (EDF) scheduling algorithm. RESUME. Nous considerons des migrations restreintes pour des tâches periodiques et spora- diques pour des plates-formes heterogenes. Les migrations entre processeurs differents causent une surcharge qui peut potentiellement etre importante pour des systemes temps reel, ou la predictabilite est essentielle. Neanmoins, les tâches periodiques, qui generent des travaux a intervalles reguliers, peuvent migrer sans causer une surcharge, si les migrations sont contro- lees. En particulier, si des travaux consecutifs de la meme tâche ne partagent pas de donnees, ils peuvent s'executer sur des processeurs differents sans induire une surcharge lors de la mi- gration, c'est-a-dire, qu'une migration restreinte peut etre autorisee. Sur des plates-formes uni- formes, chaque processeur possede une vitesse. Un travail s'executant sur un processeur de vitesse s pendantt unites de temps progressera des ◊ t unites de travail. Un test oriente uti- lisation, pour les migrations restreintes et les plates-formes uniformes est presente ou chaque processeur ordonnance les travaux avec la strategie earliest deadline first (EDF).
[1]
Sanjoy K. Baruah,et al.
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
,
2003,
Real-Time Systems.
[2]
Michael L. Dertouzos,et al.
Control Robotics: The Procedural Control of Physical Processes
,
1974,
IFIP Congress.
[3]
David S. Johnson,et al.
Near-optimal bin packing algorithms
,
1973
.
[4]
Chung Laung Liu,et al.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
,
1989,
JACM.
[5]
Sanjoy K. Baruah,et al.
Multiprocessor fixed-priority scheduling with restricted interprocessor migrations
,
2003,
15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..
[6]
Aloysius Ka-Lau Mok,et al.
Fundamental design problems of distributed systems for the hard-real-time environment
,
1983
.
[7]
James W. Layland,et al.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
,
1989,
JACM.
[8]
David S. Johnson,et al.
Fast Algorithms for Bin Packing
,
1974,
J. Comput. Syst. Sci..
[9]
Sanjoy K. Baruah,et al.
Characteristics of EDF schedulability on uniform multiprocessors
,
2003,
15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..