Original title: Multiprocessor Randomized On-line Scheduling
Authors: Tichý, Tomáš
Document type: Research reports
Year: 2002
Language: eng
Series: ITI Series 2002-069
Abstract: This paper studies randomized on-line non-preemptive scheduling in multiprocessor systems. In this problem each task is specified by its processing time andscheduled on any of $m$ identical processors. The objective is to minimize theexpected mekespan. We prove lemmas and theorems describing $sigma_m$-competitive randomized algorithms on $m$ processors. The main result is an........
Keywords: online; randomized; scheduling
Project no.: CEZ:AV0Z1019905 (CEP), CEZ:AV0Z1019905 (CEP), LN00A056 (CEP), GA201/01/1195 (CEP), ME 476
Funding provider: GA MŠk, GA ČR, GA MŠk

Institution: Institute of Mathematics AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0072434

Permalink: http://www.nusl.cz/ntk/nusl-26046


The record appears in these collections:
Research > Institutes ASCR > Institute of Mathematics
Reports > Research reports