This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n10http://localhost/temp/predkladatel/
n20http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n13http://linked.opendata.cz/resource/domain/vavai/subjekt/
n12http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n9http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F12%3A00057350%21RIV13-GA0-14330___/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F12%3A00057350%21RIV13-GA0-14330___
rdf:type
skos:Concept n12:Vysledek
dcterms:description
We study the problem of scheduling tasks for execution by a processor when the tasks can stochastically generate new tasks. Tasks can be of different types, and each type has a fixed, known probability of generating other tasks. We present results on the random variable S-sigma modeling the maximal space needed by the processor to store the currently active tasks when acting under the scheduler sigma. We obtain tail bounds for the distribution of S-sigma for both offline and online schedulers, and investigate the expected value E[S-sigma]. We study the problem of scheduling tasks for execution by a processor when the tasks can stochastically generate new tasks. Tasks can be of different types, and each type has a fixed, known probability of generating other tasks. We present results on the random variable S-sigma modeling the maximal space needed by the processor to store the currently active tasks when acting under the scheduler sigma. We obtain tail bounds for the distribution of S-sigma for both offline and online schedulers, and investigate the expected value E[S-sigma].
dcterms:title
Space-efficient scheduling of stochastically generated tasks Space-efficient scheduling of stochastically generated tasks
skos:prefLabel
Space-efficient scheduling of stochastically generated tasks Space-efficient scheduling of stochastically generated tasks
skos:notation
RIV/00216224:14330/12:00057350!RIV13-GA0-14330___
n12:predkladatel
n13:orjk%3A14330
n3:aktivita
n5:P
n3:aktivity
P(GAP202/10/1469)
n3:cisloPeriodika
January
n3:dodaniDat
n14:2013
n3:domaciTvurceVysledku
n20:1762834
n3:druhVysledku
n6:J
n3:duvernostUdaju
n8:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
170137
n3:idVysledku
RIV/00216224:14330/12:00057350
n3:jazykVysledku
n18:eng
n3:klicovaSlova
Stochastic models; Space-efficient scheduling; Multithreaded programs; Branching processes
n3:klicoveSlovo
n4:Stochastic%20models n4:Multithreaded%20programs n4:Branching%20processes n4:Space-efficient%20scheduling
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[16B3A951D22E]
n3:nazevZdroje
Information and Computation
n3:obor
n15:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
4
n3:projekt
n16:GAP202%2F10%2F1469
n3:rokUplatneniVysledku
n14:2012
n3:svazekPeriodika
210
n3:tvurceVysledku
Luttenberger, Michael Kiefer, Stefan Esparza, Javier Brázdil, Tomáš
n3:wos
000299597500007
s:issn
0890-5401
s:numberOfPages
24
n9:doi
10.1016/j.ic.2011.10.005
n10:organizacniJednotka
14330