A new elastic scheduling task model in the node of a control and measurement system

• Autorzy: Miczulski W. , Powroźnik P.
• Języki publikacji: EN

Abstrakty

EN

The paper presents a new elastic scheduling task model which has been used in the uniprocessor node of a control measuring system. This model allows the selection of a new set of periods for the occurrence of tasks executed in the node of a system in the case when it is necessary to perform additional aperiodic tasks or there is a need to change the time parameters of existing tasks. Selection of periods is performed by heuristic algorithms. This paper presents the results of the experimental use of an elastic scheduling model with a GRASP heuristic algorithm.

Słowa kluczowe

EN

task scheduling; elastic scheduling task model; heuristic algorithms; measurement and control systems; time deadline fulfilment

• Wydawca: Komitet Metrologii i Aparatury Naukowej PAN
• Czasopismo: Metrology and Measurement Systems
• Rocznik: 2013
• Tom: Vol. 20, nr 1
• Strony: 87--98
• Opis fizyczny: Bibliogr. 22 poz., rys., tab., wykr.

Twórcy

autor

Miczulski W.

autor

Powroźnik P.

• University of Zielona Gora, Faculty of Electrical Engineering, Computer Science and Telecommunications, Podgórna 50, 65-246 Zielona Góra, Poland,

Bibliografia

• [1] Janiak, A., Kołodka, P., Krysiak, T. (2010). Scheduling jobs with changeable job values and different release dates - solution algorithms. Electrical Review, 9, 91-96.
• [2] Allahverdi, A., Cheng, C.T., Kovalyov, M.Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187, 985-1032.
• [3] Raut, S., Swami, S., Gupta, J. N. (2008). Scheduling a capacitated single machine with time deteriorating job values. Int. J. Production Economics, 114, 769-780.
• [4] Janiak, A. (1999). Selected problems and scheduling algorithms and resource allocation. Akademicka Oficyna Wydawnicza PLJ.
• [5] Bellanger, A., Oulamara, A., Kovalyov M.Y. (2010). Minimizing total completion time on a batching machine with job processing time compatibilities. Electronic Notes in Discrete Math., 36, 1295-1302.
• [6] Janiak, A., Krysiak, T. (2007). Single processor scheduling with job values depending on their completion times. Springer, 129-138.
• [7] Tang, L., Zhao, Y. (2008). Scheduling a single semi-continuous batching machine. Discrete Applied Mathematics, Omega, 36, 992-1004.
• [8] Janiak, A., Janiak, W.A., Januszkiewicz, R. (2009). Algorithms For Parallel Processor Scheduling With Distinct Due Windows And Unit-Time Jobs. Bulletin Of The Polish Academy Of Sciences Technical Sciences, 57.
• [9] Błażewicz, J., Kovalyov, M. Y., Machowiak, M., Trystram, D., Węglarz, J. (2006). Preemptable Malleable Task Scheduling Problem. IEEE Transactions On Computers, 55, 486-490.
• [10] Winczaszek, M. (2006). Some scheduling problems with due windows assignment. Ph.D. Thesis. Politechnika Wrocławska.
• [11] Liu, C., Layland, J. (1973). Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. Journal of the Association for Computing Machinery, 1, 46-61.
• [12] Cervin, A., Eker, J. (2000). Feedback Scheduling of Control Tasks. 39th IEEE Conference on Decision and Control, Sydney, Australia.
• [13] Buttazzo, G., Lipari, G., Caccamo, M., Abeni, L. (2002). Elastic scheduling for flexible workload management. IEEE Transactions on Computers, 51(3), 289-302.
• [14] Chantem, T., Hu, S., Lemmon, M. (2006). Generalized Elastic Scheduling. Real-Time Systems Symposium, 27th IEEE International Volume, 236-245.
• [15] Powroźnik, P. (2009). Elastic Scheduling Task Model with Evolution Algorithm in the Control Measurement Systems. Electrical Review, 2, 79-82.
• [16] Miczulski, W., Powroźnik, P. (2011). Analysis of the properties of some heuristic algorithms used in Elastic Task Model Scheduling. Electrical Review, 9a, 107-111.
• [17] Mikołajczak, B., Stokłosa, J. (1986). Computational complexity of algorithms. Wydawnictwo Politechniki Poznańskiej.
• [18] Powroźnik, P. (2012). Influence of the parameters of fitness function for the periods set selection in elastic task model scheduling. Studia Informatica, Gliwice, 33(3A), 101-110.
• [19] Powroźnik, P. (2009). Selection analysis of evolution algorithm of chosen initially parameters in task scheduling elastic model. In Proc. XVII Polish Conf. Modelowanie i symulacja systemów pomiarowych, XVII Sympozjum. Krynica, Polska, 127-134.
• [20] Powroźnik, P. (2010). Verification of correct operation of tabu search algorithm in elastic task model sched-uling in control and measurement systems. In Proc. VIII Polish Conf. Systemy pomiarowe w badaniach naukowych i w przemyśle SP'2010 Łagów, Konferencja Naukowa SP 2010, Łagów, Polska, 21-23 czerwca 2010, 131-134.
• [21] Powroźnik, P. (2010). Elastic Task Model Scheduling based on Simulated Annealing in node of Control Measurement Systems. In Proc. V Polish Conf. Kongres Metrologii - KM 2010, V Kongres Metrologii, Łódź, Polska, 100-101.
• [22] Powroźnik, P. (2011). Properties of some heuristic algorithms: A*, GRASP and ants algorithm used in elastic task model scheduling. In Proc. XVIII Polish Conf. Modelowanie i symulacja systemów pomiarowych, XVIII Sympozjum. Krynica, Polska, 123-130.