About: Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171.

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171. Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	We consider the problem of preemptive scheduling on uniformly related machines.We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4 competitive deterministic and 2.71 competitive randomized online algorithms. In addition, it matches the performance of the previously...... We consider the problem of preemptive scheduling on uniformly related machines.We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4 competitive deterministic and 2.71 competitive randomized online algorithms. In addition, it matches the performance of the previously...... (en)
Title	Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171. Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171. (en)
skos:prefLabel	Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171. Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171. (en)
skos:notation	RIV/67985840:_____/03:05030199!RIV/2004/MSM/A05004/N
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/01/1195), P(LN00A056), P(ME 476), Z(AV0Z1019905)
http://linked.open...vai/riv/dodaniDat	2004
http://linked.open...aciTvurceVysledku	Sgall, Jiří
http://linked.open.../riv/druhVysledku	V - Výzkumná zpráva
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Matematický ústav AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	619723
http://linked.open...ai/riv/idVysledku	RIV/67985840:_____/03:05030199
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	online scheduling; preemption; uniformly related machines (en)
http://linked.open.../riv/klicoveSlovo	online scheduling uniformly related machines preemption
http://linked.open...ontrolniKodProRIV	[F5404381F207]
http://linked.open...i/riv/mistoVydani	Praha
http://linked.open...telVyzkumneZpravy	Charles University
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...ocetUcastnikuAkce	0 (xsd:int)
http://linked.open...nichUcastnikuAkce	0 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute of Theoretical Computer Science (Center of Young Science) Combinatorial algorithms and combinatorial problems in complexity theory http://linked.opendata.cz/resource/domain/vavai/projekt/ME%20476
http://linked.open...UplatneniVysledku	2003
http://linked.open...iv/tvurceVysledku	Sgall, Jiří Ebenlendr, T.
http://linked.open...rzeVyzkumneZpravy	(1)
http://linked.open...n/vavai/riv/zamer	Complex development of all branches of mathematics with regard to the needs of physics and technology
number of pages	21 (xsd:int)

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software