This HTML5 document contains 49 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/
n17http://localhost/temp/predkladatel/
n15http://purl.org/net/nknouf/ns/bibtex#
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/ontology/domain/vavai/
n13https://schema.org/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n21http://bibframe.org/vocab/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F10%3A00067181%21RIV14-MSM-14330___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F10%3A00067181%21RIV14-MSM-14330___
rdf:type
skos:Concept n10:Vysledek
dcterms:description
This paper has been inspired by the study of the complex data set from the Czech National Grid MetaCentrum. Unlike other widely used workloads from Parallel Workloads Archive or Grid Workloads Archive, this data set includes additional information concerning machine failures, job requirements and machine parameters which allows to perform more realistic simulations. We show that large differences in the performance of various scheduling algorithms appear when these additional information are used. Moreover, we studied other publicly available workloads and partially reconstructed information concerning their machine failures and job requirements using statistical and analytical models to demonstrate that similar behavior is also expectable for other workloads. We suggest that additional information about both machines and jobs should be incorporated into the workloads archives to allow proper and more realistic simulations. This paper has been inspired by the study of the complex data set from the Czech National Grid MetaCentrum. Unlike other widely used workloads from Parallel Workloads Archive or Grid Workloads Archive, this data set includes additional information concerning machine failures, job requirements and machine parameters which allows to perform more realistic simulations. We show that large differences in the performance of various scheduling algorithms appear when these additional information are used. Moreover, we studied other publicly available workloads and partially reconstructed information concerning their machine failures and job requirements using statistical and analytical models to demonstrate that similar behavior is also expectable for other workloads. We suggest that additional information about both machines and jobs should be incorporated into the workloads archives to allow proper and more realistic simulations.
dcterms:title
The importance of complete data sets for job scheduling simulations The importance of complete data sets for job scheduling simulations
skos:prefLabel
The importance of complete data sets for job scheduling simulations The importance of complete data sets for job scheduling simulations
skos:notation
RIV/00216224:14330/10:00067181!RIV14-MSM-14330___
n3:aktivita
n11:Z n11:S
n3:aktivity
S, Z(MSM0021622419)
n3:dodaniDat
n7:2014
n3:domaciTvurceVysledku
n8:9970819 n8:8739781
n3:druhVysledku
n18:D
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
263137
n3:idVysledku
RIV/00216224:14330/10:00067181
n3:jazykVysledku
n20:eng
n3:klicovaSlova
Grid; Cluster; Scheduling; MetaCentrum; Workload; Failures; Specific Job Requirements
n3:klicoveSlovo
n4:Cluster n4:Failures n4:Grid n4:Workload n4:Scheduling n4:Specific%20Job%20Requirements n4:MetaCentrum
n3:kontrolniKodProRIV
[4C32959B823C]
n3:mistoKonaniAkce
Atlanta (USA)
n3:mistoVydani
Heidelberg
n3:nazevZdroje
Job Scheduling Strategies for Parallel Processing, Revised Selected Papers
n3:obor
n14:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n7:2010
n3:tvurceVysledku
Klusáček, Dalibor Rudová, Hana
n3:typAkce
n22:WRD
n3:wos
000286164600008
n3:zahajeniAkce
2010-01-01+01:00
n3:zamer
n12:MSM0021622419
s:issn
0302-9743
s:numberOfPages
22
n21:doi
10.1007/978-3-642-16505-4_8
n15:hasPublisher
Springer, Lecture Notes in Computer Science 6253
n13:isbn
9783642165047
n17:organizacniJednotka
14330