Number of the records: 1
Online scheduling of parallel jobs on hypercubes : maximizing the throughput
- 1.
SYSNO ASEP 0353476 Document Type C - Proceedings Paper (int. conf.) R&D Document Type Conference Paper Title Online scheduling of parallel jobs on hypercubes : maximizing the throughput Author(s) Zajíček, Ondřej (MU-W) SAI
Sgall, Jiří (MU-W) RID, ORCID, SAI
Ebenlendr, Tomáš (MU-W) SAI, RIDSource Title Parallel Processing and Applied Mathematics, Part 2. - Berlin : Springer, 2010 / Wyrzykowski R. ; Dongarra J. ; Karczewski K. - ISBN 978-3-642-14402-8 Pages s. 52-61 Number of pages 10 s. Action Parallel processing and applied mathematics Event date 13.09.2009-16.09.2009 VEvent location Wroclaw Country PL - Poland Event type WRD Language eng - English Country DE - Germany Keywords scheduling ; parallel jobs ; throughput Subject RIV BA - General Mathematics R&D Projects IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS) CEZ AV0Z10190503 - MU-W (2005-2011) UT WOS 000282831500006 EID SCOPUS 77955112565 DOI 10.1007/978-3-642-14403-5_6 Annotation We study the online problem of scheduling unit-time parallel jobs on hypercubes. A parallel job has to be scheduled between its release time and deadline on a subcube of processors/ The objective is to maximize the number of early jobs. We provide a 1.6-competitive algorithm for the problem and prove that no deterministic algorithm is better than 1.4-competitive. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2011
Number of the records: 1