Number of the records: 1
Approximate throughput maximization in scheduling of parallel jobs on hypercubes
- 1.0371008 - MÚ 2012 RIV SK eng C - Conference Paper (international conference)
Zajíček, Ondřej
Approximate throughput maximization in scheduling of parallel jobs on hypercubes.
Information Technologies - Applications and Theory. Seňa: Pont, 2010 - (Pardubská, D.), s. 71-75. ISBN 978-80-970179-4-1.
[ITAT 2010. Conference on Theory and Practice of Information Technologies. Smrekovica (SK), 21.09.2010-25.09.2010]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : scheduling * hypercubes
Subject RIV: BA - General Mathematics
http://ceur-ws.org/Vol-683/paper11.pdf
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.
Permanent Link: http://hdl.handle.net/11104/0204656
File Download Size Commentary Version Access Zajicek.pdf 1 231.5 KB Publisher’s postprint open-access
Number of the records: 1