Number of the records: 1
Approximate throughput maximization in scheduling of parallel jobs on hypercubes
- 1.
SYSNO ASEP 0371008 Document Type C - Proceedings Paper (int. conf.) R&D Document Type Conference Paper Title Approximate throughput maximization in scheduling of parallel jobs on hypercubes Author(s) Zajíček, Ondřej (MU-W) SAI Source Title Information Technologies - Applications and Theory. - Seňa : Pont, 2010 / Pardubská D. - ISBN 978-80-970179-4-1 Pages s. 71-75 Number of pages 5 s. Action ITAT 2010. Conference on Theory and Practice of Information Technologies Event date 21.09.2010-25.09.2010 VEvent location Smrekovica Country SK - Slovakia Event type EUR Language eng - English Country SK - Slovakia Keywords scheduling ; hypercubes 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) EID SCOPUS 84873950334 Annotation We study scheduling of 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 an efficient 1.5-approximation algorithm for the problem. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2012
Number of the records: 1