About: An Acceleration of the Algorithm for the Nurse Rerostering Problem on a Graphics Processing Unit

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

About: An Acceleration of the Algorithm for the Nurse Rerostering Problem on a Graphics Processing Unit 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	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. (en)
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 (en)
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 (en)
skos:notation	RIV/68407700:21230/13:00208402!RIV14-MSM-21230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(7H12008), P(GAP103/12/1994)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Bäumelt, Zdeněk Hanzálek, Zdeněk Šůcha, Přemysl Dvořák, Jan
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
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	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	60262
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/13:00208402
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	nurse rerostering problem; parallel algorithm; GPU; heuristic; personnel/human resources scheduling (en)
http://linked.open.../riv/klicoveSlovo	personnel/human resources scheduling heuristic GPU nurse rerostering problem parallel algorithm
http://linked.open...ontrolniKodProRIV	[C2F06E0CFFB4]
http://linked.open...v/mistoKonaniAkce	Lisabon
http://linked.open...i/riv/mistoVydani	PMB 253-5525 West Boulevard, Vancouver, BC V6M 3
http://linked.open...i/riv/nazevZdroje	Lecture Notes in Management Science - 5th International Conference on Applied Operational Research, Proceedings
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	4 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Design, Monitoring and Operation of Adaptive Networked Embedded Systems Adaptive scheduling and Optimization algorithms for distributed Real-time Embeddes Systems
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Bäumelt, Zdeněk Dvořák, Jan Hanzálek, Zdeněk Šůcha, Přemysl
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-07-29 (xsd:date)
issn	2008-0050
number of pages	10 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Tadbir Operational Research Group Ltd.
http://localhost/t...ganizacniJednotka	21230

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, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software