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

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

Namespace Prefixes

PrefixIRI
n22http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://localhost/temp/predkladatel/
n11http://purl.org/net/nknouf/ns/bibtex#
n13http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F10%3A00065891%21RIV14-MSM-14330___/
n10https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n14http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n20http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F10%3A00065891%21RIV14-MSM-14330___
rdf:type
skos:Concept n16: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 of 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 of 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/10:00065891!RIV14-MSM-14330___
n3:aktivita
n12:P
n3:aktivity
P(1M0545), P(GAP202/10/1469)
n3:dodaniDat
n20:2014
n3:domaciTvurceVysledku
n13:1762834
n3:druhVysledku
n17:D
n3:duvernostUdaju
n5:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
288932
n3:idVysledku
RIV/00216224:14330/10:00065891
n3:jazykVysledku
n15:eng
n3:klicovaSlova
infinite-state stochastic models; process creation; probabilistic verification
n3:klicoveSlovo
n19:probabilistic%20verification n19:process%20creation n19:infinite-state%20stochastic%20models
n3:kontrolniKodProRIV
[F2467B34F9E9]
n3:mistoKonaniAkce
Bordeaux, France
n3:mistoVydani
Berlin
n3:nazevZdroje
Proceedings of 37th International Colloquium on Automata, Languages and Programming (ICALP 2010)
n3:obor
n7:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
4
n3:projekt
n6:GAP202%2F10%2F1469 n6:1M0545
n3:rokUplatneniVysledku
n20:2010
n3:tvurceVysledku
Brázdil, Tomáš Luttenberger, Michael Kiefer, Stefan Esparza, Javier
n3:typAkce
n22:WRD
n3:zahajeniAkce
2010-01-01+01:00
s:issn
0302-9743
s:numberOfPages
12
n14:doi
10.1007/978-3-642-14162-1_45
n11:hasPublisher
Springer-Verlag
n10:isbn
9783642141614
n21:organizacniJednotka
14330