RUDOVÁ, Hana. Dynamic Scheduling. In Istituto di Scienza e Tecnologie dell'Informazione, Consiglio Nazionale delle Ricerche, invited talk. 2008.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Dynamic Scheduling
Name in Czech Dynamické rovrhování
Authors RUDOVÁ, Hana (203 Czech Republic, guarantor, belonging to the institution).
Edition Istituto di Scienza e Tecnologie dell'Informazione, Consiglio Nazionale delle Ricerche, invited talk, 2008.
Other information
Original language English
Type of outcome Requested lectures
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Italy
Confidentiality degree is not subject to a state or trade secret
WWW URL
RIV identification code RIV/00216224:14330/08:00041928
Organization unit Faculty of Informatics
Keywords in English scheduling; dynamic problems; local search;grid scheduling; course timetabling
Tags course timetabling, dynamic problems, grid scheduling, Local Search, scheduling
Tags International impact
Changed by Changed by: doc. Mgr. Hana Rudová, Ph.D., učo 3840. Changed: 2/5/2011 08:29.
Abstract
Scheduling represents a wide area of problems with many different aspects given by practical applications and studied by various theoretical approaches. Complete information necessary for scheduling is sometimes available before the problem is solved. However, the problem often changes as time goes, scheduler must react on the changed state of the problem and dynamic schedule updates are needed. This talk will describe the general scheduling problem from the point of view of static and dynamic/changing problems. Solving methodologies based on local search methods and dispatching rules will be presented and their applicability for dynamic problem solving will be discussed. Application of the dynamic job scheduling in the Grid environment will be presented. A novel incremental use of local search algorithms allows to construct better solutions in a reasonable time. Also we will demonstrate application of local search methods for solving large scale timetabling problem at Purdue University.
Abstract (in Czech)
Cílem prezentace je popsat algoritmy pro řešení problémů dynamického rozvrhování, které byly použity v aplikacích plánování na Gridech a universitního rozvrhování. Zároveň je zde ukázána aplikace těchto algoritmů na uvedené problémy.
Links
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: 27/5/2024 12:58