ABSTRACT
End-to-end flows, which have a set of chainlike subtasks, are widely used in distributed real-time systems. For instance, multimedia and automative applications require that subtasks finish executing on a chain of processors before their end-to-end deadlines. The scheduling of such chained subtasks decides the schedulability of a distributed realtime system. Since the subtask priority assignment problem is NP-hard in general, most heuristics are presented to schedule end-to-end flows in two separate steps. The first step calculates intermediate relative deadlines for frames, and the second step makes scheduling decisions under EDF scheduling. Because the quality of the priority assignment of subtasks will directly affect the schedulability of the distributed systems, the two separate steps may cause pessimism in schedulability analysis. To reduce potential pessimism, we combine the two steps in our novel dGMF-PA (distributed generalized multiframe tasks with parameter adaption) model. We present an algorithm based on mixed-integer linear programming for optimally selecting frame relative deadlines in the dGMF-PA model. An approximation algorithm is also proposed to reduce computational running time. Our approximation algorithm has a tunable speed-up factor of 1 + ϵ where ϵ can be arbitrarily small, with respect to the exact schedulability test of dGMF-PA tasks under EDF scheduling. Extensive experiments have shown that our approximation algorithm (which is a sufficient schedulability test) can schedule at most 44 % more than HOSPA, an existing state-of-the-art algorithm.
- Gurobi: The state-of-the-art mathematical programming solver. http://www.gurobi.com/.Google Scholar
- Mast: Modeling and analysis suite for real-time applications. http://mast.unican.es/.Google Scholar
- B. Andersson. Schedulability analysis of generalized multiframe traffic on multihop-networks comprising software-implemented ethernet-switches. In Proceedings of the IEEE International Symposium on Parallel and Distributed Processing, pages 1--8, April 2008.Google ScholarCross Ref
- S. Baruah. The non-cyclic recurring real-time task model. In Proceedings of the 31st IEEE Real-Time Systems Symposium, pages 173--182, Nov 2010. Google ScholarDigital Library
- S. Baruah, D. Chen, S. Gorinsky, and A. Mok. Generalized multiframe tasks. Real-Time Systems, pages 5--22, 1999. Google ScholarDigital Library
- S. K. Baruah. Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Syst., 24(1):93--128, Jan. 2003. Google ScholarDigital Library
- S. K. Baruah, R. R. Howell, and L. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems, 2:301--324, 1990. Google ScholarDigital Library
- E. Bini and G. C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, pages 129--154, 2005. Google ScholarDigital Library
- G. C. Buttazzo, G. Lipari, M. Caccamo, and L. Abeni. Elastic scheduling for flexible workload management. IEEE Transactions on Compututers, pages 289--302, 2002. Google ScholarDigital Library
- T. Chantem, X. Wang, M. Lemmon, and X. Hu. Period and deadline selection for schedulability in real-time systems. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS), pages 168--177, July 2008. Google ScholarDigital Library
- F. Dewan and N. Fisher. Efficient admission control for enforcing arbitrary real-time demand-curve interfaces. In Proceedings of the 33rd IEEE Real-Time Systems Symposium, pages 127--136, Washington, DC, USA, 2012. IEEE Computer Society. Google ScholarDigital Library
- S. Ding, H. Tomiyama, and H. Takada. Scheduling algorithms for i/o blockings with a multi-frame task model. In Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Aug 2007. Google ScholarDigital Library
- P. Ekberg, N. Guan, M. Stigge, and W. Yi. An optimal resource sharing protocol for generalized multiframe tasks. Journal of Logical and Algebraic Methods in Programming, 84(1):92--105, 2015.Google ScholarCross Ref
- P. Ekberg and W. Yi. Uniprocessor feasibility of sporadic tasks remains coNP-complete under bounded utilization. In Proceedings of the 36th IEEE Real-Time Systems Symposium (RTSS), 2015. Google ScholarDigital Library
- M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., NY, USA, 1990. Google ScholarDigital Library
- P. Jayachandran and T. Abdelzaher. Delay composition in preemptive and non-preemptive real-time pipelines. Real-Time Syst., 40(3):290--320, Dec. 2008. Google ScholarDigital Library
- J. Liu. Real-Time Systems. Prentice Hall, 2000.Google Scholar
- J. Mäki-Turja and M. Nolin. Efficient implementation of tight response-times for tasks with offsets. Real-Time Systems, 40(1):77--116, 2008. Google ScholarDigital Library
- S. Matic and T. A. Henzinger. Trading end-to-end latency for composability. In Proceedings of the 26th IEEE International Real-Time Systems Symposium (RTSS), pages 12 pp.--110, Dec 2005. Google ScholarDigital Library
- A. Mok and D. Chen. A multiframe model for real-time tasks. In Proceedings of the 17th IEEE Real-Time Systems Symposium, pages 22--29, Dec 1996. Google ScholarDigital Library
- N. Moyo, E. Nicollet, F. Lafaye, and C. Moy. On schedulability analysis of non-cyclic generalized multiframe tasks. In Proceedings of the 22nd Euromicro Conference Real-Time Systems (ECRTS), pages 271--278, July 2010. Google ScholarDigital Library
- J. C. Palencia and M. G. Harbour. Schedulability analysis for tasks with static and dynamic offsets. In Proceedings of the 19th IEEE Real-Time Systems Symposium, pages 26--37, Dec 1998. Google ScholarDigital Library
- J. C. Palencia and M. G. Harbour. Offset-based response time analysis of distributed systems scheduled under edf. In Proceedings of 15th Euromicro Conference on Real-Time Systems, pages 3--12, July 2003.Google ScholarCross Ref
- R. Pellizzoni and G. Lipari. Improved schedulability analysis of real-time transactions with earliest deadline scheduling. In Proceedings of the 11th IEEE Real Time and Embedded Technology and Applications Symposium, pages 66--75, March 2005. Google ScholarDigital Library
- B. Peng and N. Fisher. Parameter adaption for generalized multiframe tasks and applications to self-suspending tasks. In Proceedings of the 22nd Embedded and Real-Time Computing Systems and Applications (RTCSA), August 2016.Google ScholarCross Ref
- J. M. Rivas, J. J. Gutiérrez, J. C. Palencia, and M. G. Harbour. Schedulability analysis and optimization of heterogeneous edf and fp distributed real-time systems. In Proceedings of the 23rd Euromicro Conference on Real-Time Systems (ECRTS), pages 195--204, July 2011. Google ScholarDigital Library
- J. M. Rivas, J. J. Gutiérrez, J. C. Palencia, and M. G. Harbour. Deadline assignment in edf schedulers for real-time distributed systems. IEEE Transactions on Parallel and Distributed Systems, Oct 2015. Google ScholarDigital Library
- N. Tchidjo Moyo, E. Nicollet, F. Lafaye, and C. Moy. Real time scheduling analysis for DSP base band processing in multi-channel SDR set. In Proceedings of the SDR Forum Technical Conference, Washington, United States, Dec. 2009.Google Scholar
- K. Tindell and J. Clark. Holistic schedulability analysis for distributed hard real-time systems. Microprocessing and Microprogramming - Parallel processing in embedded real-time systems., 40(2-3):117--134, Apr. 1994. Google ScholarDigital Library
Recommendations
Adjustable deadline assignment for end-to-end tasks
RACS '15: Proceedings of the 2015 Conference on research in adaptive and convergent systemsA task in a multiprocessor system needs to be executed on different processors for the different parts. The different execution parts of the task must be finished by its end-to-end deadline and there are precedence constraints among the parts. The ...
Comments