Local Search for Deadline Driven Grid Scheduling

KLUSÁČEK, Dalibor, Luděk MATYSKA and Hana RUDOVÁ. Local Search for Deadline Driven Grid Scheduling. In Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007). 1. vydání. Brno: Ing. Zdeněk Novotný CSc., Ondráčkova 105, 628 00 Brno, 2007, p. 74-81. ISBN 978-80-7355-077-6.

Basic information

• Original name: Local Search for Deadline Driven Grid Scheduling
• Name in Czech: Lokální prohledávání pro gridové plánování s termíny dokončení
• Authors: KLUSÁČEK, Dalibor (203 Czech Republic), Luděk MATYSKA (203 Czech Republic) and Hana RUDOVÁ (203 Czech Republic, guarantor).
• Edition: 1. vydání. Brno, Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007), p. 74-81, 8 pp. 2007.
• Publisher: Ing. Zdeněk Novotný CSc., Ondráčkova 105, 628 00 Brno

Other information

• Original language: English
• Type of outcome: Proceedings paper
• Field of Study: 10201 Computer sciences, information science, bioinformatics
• Country of publisher: Czech Republic
• Confidentiality degree: is not subject to a state or trade secret
• WWW: URL
• RIV identification code: RIV/00216224:14330/07:00020506
• Organization unit: Faculty of Informatics
• ISBN: 978-80-7355-077-6
• Keywords in English: plánování; Grid; simulátor; lokální prohledávání; Tabu prohledávání
• Tags: GRID, lokální prohledávání, plánování, simulator, Tabu prohledávání
• Tags: International impact, Reviewed

Abstract

This work describes application of local search based algorithms for job scheduling in the Grid environment where dynamic changes occur. The primary intent is to consider problems with the typical quality of service constraint taking into account and minimizing the number of late jobs. To achieve this goal a~special instance of the Tabu search algorithm applicable to dynamic problems is proposed. Also a new dispatching rule generating the initial solution is introduced. Comparison with typical queue-based policies such as First Come First Served, Earliest Deadline First or Easy Backfilling is provided. Experimental results shows that local search based algorithms is a promising technique with better performance than queue-based algorithms while still fast enough to provide solutions in a reasonable time.

Abstract (in Czech)

Práce prezentuje aplikaci lokálního prohledávání na plánování v Gridovém prostředí. Hlavním cílem práce je orientace na problémy s QoS požadavky tak, aby byl minimalizován počet opožděných úloh.

Links

• GA201/07/0205, research and development project: Name: Dynamické aspekty rozvrhování

Investor: Czech Science Foundation, Dynamic Aspects of Scheduling

• MSM0021622419, plan (intention): Name: Vysoce paralelní a distribuované výpočetní systémy

Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems