Search results
- 1.0439552 - MÚ 2015 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš
Semi-online preemptive scheduling: study of special cases.
Parallel Processing and Applied Mathematics. Vol. Part 2. Berlin: Springer, 2010 - (Wyrzykowski, R.; Dongarra, J.; Karczewski, K.), s. 11-20. Lecture Notes in Computer Science, 6068. ISBN 978-3-642-14402-8.
[Parallel processing and applied mathematics. Wroclaw (PL), 13.09.2009-16.09.2009]
Institutional research plan: CEZ:AV0Z1019905
Keywords : scheduling
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-14403-5_2
Permanent Link: http://hdl.handle.net/11104/0242818File Download Size Commentary Version Access Ebenlendr1.pdf 1 172.6 KB Publisher’s postprint require - 2.0386905 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Sgall, J.
A lower bound on deterministic online algorithms for scheduling on related machines without preemption.
Approximation and Online Algorithms. Heidelberg: Springer, 2012 - (Solis-Oba, R.; Persiano, G.), s. 102-108. Lecture Notes in Computer Science, 7164. ISBN 978-3-642-29115-9.
[9th International Workshop, WAOA 2011. Saarbrücken (DE), 08.09.2011-09.09.2011]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : algorithm analysis * problem complexity * computer science
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-29116-6_9
Permanent Link: http://hdl.handle.net/11104/0219394File Download Size Commentary Version Access Ebenlendr.pdf 2 168.5 KB Publisher’s postprint require - 3.0353476 - MÚ 2011 RIV DE eng C - Conference Paper (international conference)
Zajíček, Ondřej - Sgall, Jiří - Ebenlendr, Tomáš
Online scheduling of parallel jobs on hypercubes : maximizing the throughput.
Parallel Processing and Applied Mathematics. Vol. Part 2. Berlin: Springer, 2010 - (Wyrzykowski, R.; Dongarra, J.; Karczewski, K.), s. 52-61. Lecture Notes in Computer Science, 6068. ISBN 978-3-642-14402-8.
[Parallel processing and applied mathematics. Wroclaw (PL), 13.09.2009-16.09.2009]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : scheduling * parallel jobs * throughput
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-14403-5_6
Permanent Link: http://hdl.handle.net/11104/0192720File Download Size Commentary Version Access Ebenlendr.pdf 1 177.1 KB Publisher’s postprint require - 4.0334971 - MÚ 2010 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Sgall, Jiří
A lower bound for scheduling of unit jobs with immediate decision on parallel machines.
[Dolní odhad pro rozhodování jednotkových úloh s okamžitým rozhodnutím na paralelních počítačích.]
Approximation and online algorithms. Berlin: Springer, 2009 - (Bampis, E.; Skutella, M.), s. 43-52. Lecture notes in computer science, 5426. ISBN 978-3-540-93979-5.
[6th International Workshop on Approximation and Online Algorithms. Karlsruhe (DE), 18.09.2008-19.09.2008]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0179571File Download Size Commentary Version Access Sgall.pdf 1 2.1 MB Author’s postprint open-access - 5.0334967 - MÚ 2010 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Sgall, Jiří
Semi-online preemptive scheduling: one algorithm for all variants.
[Semi-online preemptivní rozvrhování: jeden algoritmus pro všechny varianty.]
26th International Symposium on Theoretical Aspects of Computer Science. Leibniz: Schloss Dagstuhl, 2009 - (Albers, S.; Marion, J.), s. 349-360. ISBN 978-3-939897-09-5.
[26th International Symposium on Theoretical Aspects of Computer Science. Freiburg (DE), 26.02.2009-28.02.2009]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : algorithms * scheduling
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0179568File Download Size Commentary Version Access Ebenlendr2.pdf 1 253.6 KB Author’s postprint require - 6.0318586 - MÚ 2009 RIV US eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Krčál, Marek - Sgall, Jiří
Graph balancing: A special case of scheduling unrelated parallel machines.
[Vyvažování grafů: Speciální případ rozvrhování nezávislých paralelních počítačů.]
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. San Francisco: ACM-SIAM, 2008, s. 483-490. ISBN 978-0-89871-647-4.
[Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)/10./. San Francisco (US), 20.01.2008-22.01.2008]
R&D Projects: GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : graph * graph balancing * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0167959 - 7.0096096 - MÚ 2008 RIV DE eng C - Conference Paper (international conference)
Ding, J. - Ebenlendr, Tomáš - Sgall, Jiří - Zhang, G.
Online scheduling of equal-length jobs on parallel machines.
[Online rozhodování stejně dlouhých úloh na paralelních počítačích.]
Proceedings of the 15th European Symposium on Algorithms (ESA). Berlin: Springer, 2007, s. 427-438. Lecture Notes in Computer Science, 4698. ISBN 978-3-540-75519-7.
[European Symposium on Algorithms /15./. Eilat (IL), 08.10.2007-10.10.2007]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : Online algorithms * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0155538File Download Size Commentary Version Access Ebenlendr.pdf 1 412.5 KB Publisher’s postprint require - 8.0076019 - MÚ 2007 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Jawor, W. - Sgall, Jiří
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
[Preemptivní online rozvrhování: Optimální algoritmy pro všechny rychlosti.]
Proceedings of the 14th European Symposium on Algorithms (ESA). Berlin: Springer, 2006, s. 327-339. Lecture Notes in Computer Science, 4168. ISBN 3-540-38875-3.
[European Symposium on Algorithms (ESA)/14./. Zurich (CH), 11.09.2006-13.09.2006]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR(CZ) GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0143228File Download Size Commentary Version Access Ebenlendr1.pdf 1 539.4 KB Publisher’s postprint require - 9.0041413 - MÚ 2007 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Noga, E. J. - Sgall, Jiří - Woeginger, G.
A note on semi-online machine covering.
[O semi-online pokrývání počítačů.]
Proceedings of the 3rd Workshop on Approximation and Online Algorithms (WAOA). Berlin: Springer, 2006 - (Erlebach, T.; Persinao, G.), s. 110-118. Lecture Notes in Computer Sciences, 3879. ISBN 3-540-32207-8.
[Workshop on Approximation and Online Algorithms (WAOA)/3./. Palma de Mallorca (ES), 06.10.2005-07.10.2005]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR(CZ) GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0134885File Download Size Commentary Version Access Ebenlendr.pdf 1 181.3 KB Publisher’s postprint require