KLUSÁČEK, Dalibor and Hana RUDOVÁ. Improving QoS in Computational Grids through Schedule-based Approach. In Scheduling and Planning Applications Workshop (SPARK) at the International Conference on Automated Planning and Scheduling (ICAPS'08). 2008.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Improving QoS in Computational Grids through Schedule-based Approach
Name in Czech Zlepšování kvality služby ve výpočetních Gridech pomocí tvorby rozvrhu
Authors KLUSÁČEK, Dalibor (203 Czech Republic, guarantor, belonging to the institution) and Hana RUDOVÁ (203 Czech Republic, belonging to the institution).
Edition Scheduling and Planning Applications Workshop (SPARK) at the International Conference on Automated Planning and Scheduling (ICAPS'08), 2008.
Other information
Original language English
Type of outcome Presentations at conferences
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Australia
Confidentiality degree is not subject to a state or trade secret
WWW URL
RIV identification code RIV/00216224:14330/08:00042057
Organization unit Faculty of Informatics
Keywords in English Grid; Scheduling; Scheduling policy; Local Search; Backfilling; Gap; Gap filling
Tags Backfilling, Gap, Gap filling, GRID, Local Search, scheduling, Scheduling policy
Tags International impact, Reviewed
Changed by Changed by: doc. Mgr. Hana Rudová, Ph.D., učo 3840. Changed: 2/5/2011 08:37.
Abstract
While Grid users are often interested in satisfaction of their Quality of Service (QoS) requirements, these cannot be satisfactory handled by commonly used queue-based approaches. This paper concentrates on the application of schedule-based methods which allow both efficient handling of QoS requirements as well as traditional machine usage objective. An incremental application of our methods reacting on dynamic character of the problem allows to achieve reasonable runtime. Even more, we show that the schedule-based methods significantly outperform queue-based approaches by means of the weighted machine usage reflecting heterogeneity of the resources common for the Grid environments. A new formalized description of two schedule-based methods is introduced to schedule dynamically arriving jobs onto the machines of the computational Grid. Proposed methods are compared with some of the most common queue-based scheduling algorithms.
Abstract (in Czech)
Tato práce prezentuje výhody plánování úloh na výpočetních Gridech založeném na tvorbě rozvrhu. Jako optimalizační kritérium byla zvolena řada reálných kritérií, např. vytížení strojů, doba běhu plánovacích algoritmů, makespan a počet neopožděných úloh, který reprezentuje kvalitu služby (QoS) doručenou koncovému uživateli - vlastníkovi úloh. Navržený přístup využívající rozvrh, jednoduché heuristiky zaplňování děr a tabu prohledávání pro optimalizaci rozvrhu byl experimentálně ověřen sadou experimentů, jež ukázala výrazně jeho lepší výsledky, než při použití klasických, frontových plánovacích algoritmů (FCFS, EASY a Flexible Backfilling).
Links
GA201/07/0205, research and development projectName: 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
PrintDisplayed: 30/4/2024 17:12