Number of the records: 1  

Approximate throughput maximization in scheduling of parallel jobs on hypercubes

  1. 1.
    SYSNO ASEP0371008
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleApproximate throughput maximization in scheduling of parallel jobs on hypercubes
    Author(s) Zajíček, Ondřej (MU-W) SAI
    Source TitleInformation Technologies - Applications and Theory. - Seňa : Pont, 2010 / Pardubská D. - ISBN 978-80-970179-4-1
    Pagess. 71-75
    Number of pages5 s.
    ActionITAT 2010. Conference on Theory and Practice of Information Technologies
    Event date21.09.2010-25.09.2010
    VEvent locationSmrekovica
    CountrySK - Slovakia
    Event typeEUR
    Languageeng - English
    CountrySK - Slovakia
    Keywordsscheduling ; hypercubes
    Subject RIVBA - General Mathematics
    R&D ProjectsIAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    1M0545 GA MŠk - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z10190503 - MU-W (2005-2011)
    EID SCOPUS84873950334
    AnnotationWe 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.
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing2012
Number of the records: 1