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
n19http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n12http://localhost/temp/predkladatel/
n10http://purl.org/net/nknouf/ns/bibtex#
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n20http://linked.opendata.cz/resource/domain/vavai/subjekt/
n6http://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/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F13%3A00208402%21RIV14-MSM-21230___/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F13%3A00208402%21RIV14-MSM-21230___
rdf:type
n6:Vysledek skos:Concept
dcterms:description
This paper deals with the Nurse Rerostering Problem (NRRP) performed by a parallel algorithm on a Graphics Processing Unit (GPU). This problem is focused on rescheduling of human resources in healthcare, when a roster is disrupted by unexpected circumstances. Our aim is to resolve NRRP in a parallel way to shorten the needed computational time in comparison to already known algorithms. The design of the parallel algorithm is a non-trivial task and brings many crucial issues that are described in this paper, e.g. a thread mapping issue, the utilization of the memory and the minimization of the communication overhead between the PC and the GPU. These issues must be taken into account in order to achieve the expected speedup. Our algorithm is evaluated on the benchmark datasets and compared to the optimal results given by ILP. The part of the heterogeneous parallel algorithm running on the GPU was up to 6 times faster in comparison to its sequential version. In total, our parallel algorithm provides a speedup of 1.9 (2.5) times for the NRRP instances with 19 (32) nurses in comparison to the sequential algorithm. This paper deals with the Nurse Rerostering Problem (NRRP) performed by a parallel algorithm on a Graphics Processing Unit (GPU). This problem is focused on rescheduling of human resources in healthcare, when a roster is disrupted by unexpected circumstances. Our aim is to resolve NRRP in a parallel way to shorten the needed computational time in comparison to already known algorithms. The design of the parallel algorithm is a non-trivial task and brings many crucial issues that are described in this paper, e.g. a thread mapping issue, the utilization of the memory and the minimization of the communication overhead between the PC and the GPU. These issues must be taken into account in order to achieve the expected speedup. Our algorithm is evaluated on the benchmark datasets and compared to the optimal results given by ILP. The part of the heterogeneous parallel algorithm running on the GPU was up to 6 times faster in comparison to its sequential version. In total, our parallel algorithm provides a speedup of 1.9 (2.5) times for the NRRP instances with 19 (32) nurses in comparison to the sequential algorithm.
dcterms:title
An Acceleration of the Algorithm for the Nurse Rerostering Problem on a Graphics Processing Unit An Acceleration of the Algorithm for the Nurse Rerostering Problem on a Graphics Processing Unit
skos:prefLabel
An Acceleration of the Algorithm for the Nurse Rerostering Problem on a Graphics Processing Unit An Acceleration of the Algorithm for the Nurse Rerostering Problem on a Graphics Processing Unit
skos:notation
RIV/68407700:21230/13:00208402!RIV14-MSM-21230___
n6:predkladatel
n20:orjk%3A21230
n3:aktivita
n17:P
n3:aktivity
P(7H12008), P(GAP103/12/1994)
n3:dodaniDat
n4:2014
n3:domaciTvurceVysledku
n14:4491033 n14:7678436 n14:5834805 n14:3446956
n3:druhVysledku
n9:D
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n8:predkladatel
n3:idSjednocenehoVysledku
60262
n3:idVysledku
RIV/68407700:21230/13:00208402
n3:jazykVysledku
n13:eng
n3:klicovaSlova
nurse rerostering problem; parallel algorithm; GPU; heuristic; personnel/human resources scheduling
n3:klicoveSlovo
n11:heuristic n11:GPU n11:personnel%2Fhuman%20resources%20scheduling n11:parallel%20algorithm n11:nurse%20rerostering%20problem
n3:kontrolniKodProRIV
[C2F06E0CFFB4]
n3:mistoKonaniAkce
Lisabon
n3:mistoVydani
PMB 253-5525 West Boulevard, Vancouver, BC V6M 3
n3:nazevZdroje
Lecture Notes in Management Science - 5th International Conference on Applied Operational Research, Proceedings
n3:obor
n21:JD
n3:pocetDomacichTvurcuVysledku
4
n3:pocetTvurcuVysledku
4
n3:projekt
n7:7H12008 n7:GAP103%2F12%2F1994
n3:rokUplatneniVysledku
n4:2013
n3:tvurceVysledku
Bäumelt, Zdeněk Hanzálek, Zdeněk Dvořák, Jan Šůcha, Přemysl
n3:typAkce
n19:WRD
n3:zahajeniAkce
2013-07-29+02:00
s:issn
2008-0050
s:numberOfPages
10
n10:hasPublisher
Tadbir Operational Research Group Ltd.
n12:organizacniJednotka
21230