Number of the records: 1  

Online competitive algorithms for maximizing weighzed throughput of unit jobs. ITI Series 2003-172

  1. 1.
    0175447 - MU-W 20030142 RIV CZ eng V - Research Report
    Bartal, Y. - Chin, F. Y. L. - Chrobak, M. - Fung, S. P. Y. - Jawor, W. - Lavi, R. - Sgall, Jiří - Tichý, Tomáš
    Online competitive algorithms for maximizing weighzed throughput of unit jobs. ITI Series 2003-172.
    Praha: Charles University, 2003. 25 s.
    R&D Projects: GA MŠMT LN00A056; GA MŠMT ME 476; GA ČR GA201/01/1195; GA AV ČR IAA1019401
    Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
    Keywords : scheduling problem * quality-of-service applications
    Subject RIV: BA - General Mathematics

    We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applications, equivalently as an online scheduling problem forunit-length jobs, where each job is specified by its release time, deadline, and a nonnegative weight (QoS value). The goal is to maximize the emph{weighted throughput}, that is the total weight of scheduled jobs.
    Permanent Link: http://hdl.handle.net/11104/0072430

     
     

Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.