Abstract
This paper presents a new method of scheduling with using a modification of Muntz-Coffman algorithm. This novel method takes into account two-processor tasks. As a specification of system graph is used, which consider one-processor tasks too, and attribute of the divisibility/indivisibility of tasks. Scheduling of these tasks is preparing on NoC (Network on Chip) architecture which consists of two and three processors. In this paper algorithm of scheduling tasks using new approach to prioritize and prepare ranking of tasks on chosen architecture are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kopetz, H.: Real-time Systems: Design Principles for Distributed Embedded Applications. Springer, US (2011)
Lee, E.A., Seshia, S.A.: Introduction to Embedded Systems: A Cyber-Physical Systems Approach. MIT Press, Cambridge (2011)
Rajesh, K.G.: Co-synthesis of hardware and software for digital embedded systems, Ph.D. thesis, 10 December 1993
Smutnicki, C.: Algorytmy szeregowania zadań. Oficyna Wydawnicza Politechniki Wrocławskiej, Wrocław (2012)
Pinedo, M.L.: Scheduling Theory, Algorithms and Systems. Springer, Heidelberg (2008)
Tynski, A.: Zagadnienie szeregowania zadań z uwzględnieniem transportu. Modele,własności i algortmy, Ph.D. thesis, Wrocław (2008)
Ost, L., Mandelli, M., Almeida, G.M., Moller, L., Indrusiak, L.S., Sassatelli, G., Moraes, F.: Power-aware dynamic mapping heuristics for NoC-based MPSoCs using a unified model-based approach. ACM Trans. Embed. Comput. Syst. (TECS) 12(3), 75 (2013)
Khan, G.N., Iniewski, K. (eds.): Embedded and Networking Systems: Design, Software, and Implementation. CRC Press, Boca Raton (2013)
Eles, P., Peng, Z., Kuchcinski, K., Doboli, A.: System level hardware/software partitioning based on simulated annealing and tabu search. Des. Autom. Embed. Syst. 2(1), 5–32 (1997)
Błądek, I., Drozdowski, M., Fuinand, F., Schepler, X.: On contiguous and non-contiguous parallel task scheduling. J. Sched. 18, 487–495 (2015)
Popieralski, W.: Algorytmy stadne w optymalizacji problem przepływowego szeregowania zadań, Ph.D. Thesis (2013)
Dorota, D.: Scheduling tasks in embedded systems based on NoC architecture using simulated annealing. In: Dependability and Complex Systems DepCoS-RELCOMEX, Brunów, Poland (2017)
Błażewicz, J., Drozdowski, M., Węglarz, J.: Szeregowanie zadań wieloprocesorowych w systemie jenorodnych duoprocesorów. Zeszyty Naukowe Politechniki Śląskiej (1988)
Błażewicz, J., Drabowski, M., Węglarz, J.: Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. Comput. 35, 389–393 (1986)
Błażewicz, J., Drozdowski, M., Guinand, F., Trystam, D.: Scheduling a divisible task in a two-dimensional toroidal mesh. Discret. Appl. Math. 94, 35–50 (1999)
Muntz, R.R., Coffman, E.G.: Optimal preemptive scheduling on two-processor systems. Trans. Comput. 18, 1014–1020 (1969)
Błażewicz, J., Cellary, W., Słowiński, R., Węglarz, J.: Badania operacyjne dla informatyków. Warszawa, WNT (1983)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Dorota, D. (2019). Dual-Processor Tasks Scheduling Using Modified Muntz-Coffman Algorithm. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Contemporary Complex Systems and Their Dependability. DepCoS-RELCOMEX 2018. Advances in Intelligent Systems and Computing, vol 761. Springer, Cham. https://doi.org/10.1007/978-3-319-91446-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-91446-6_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91445-9
Online ISBN: 978-3-319-91446-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)