This HTML5 document contains 47 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/
n16http://purl.org/net/nknouf/ns/bibtex#
n11http://localhost/temp/predkladatel/
n21http://linked.opendata.cz/resource/domain/vavai/projekt/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n23http://linked.opendata.cz/resource/domain/vavai/subjekt/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F13%3A00202860%21RIV14-MSM-21230___/
n8http://linked.opendata.cz/ontology/domain/vavai/
n9https://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#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F13%3A00202860%21RIV14-MSM-21230___
rdf:type
n8:Vysledek skos:Concept
dcterms:description
This work proposes a GPU algorithm for a combinatorial problem known in literature as Resource Constrained Project Scheduling Problem. To solve this NP-hard problem, Tabu Search meta-heuristic is selected. All computations are performed on the GPU to minimize required communication bandwidth between the GPU and the CPU. In addition, new evaluation algorithm and effective Tabu List implementation are designed especially for GPUs. Achieved results show that the proposed GPU solution outperforms the equivalent CPU version in both quality of solutions and performance speedup. This work proposes a GPU algorithm for a combinatorial problem known in literature as Resource Constrained Project Scheduling Problem. To solve this NP-hard problem, Tabu Search meta-heuristic is selected. All computations are performed on the GPU to minimize required communication bandwidth between the GPU and the CPU. In addition, new evaluation algorithm and effective Tabu List implementation are designed especially for GPUs. Achieved results show that the proposed GPU solution outperforms the equivalent CPU version in both quality of solutions and performance speedup.
dcterms:title
A GPU algorithm design for Resource Constrained Project Scheduling Problem A GPU algorithm design for Resource Constrained Project Scheduling Problem
skos:prefLabel
A GPU algorithm design for Resource Constrained Project Scheduling Problem A GPU algorithm design for Resource Constrained Project Scheduling Problem
skos:notation
RIV/68407700:21230/13:00202860!RIV14-MSM-21230___
n8:predkladatel
n23:orjk%3A21230
n3:aktivita
n19:S n19:P
n3:aktivity
P(7H12008), S
n3:dodaniDat
n4:2014
n3:domaciTvurceVysledku
n15:7388160 n15:7678436
n3:druhVysledku
n13:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
58640
n3:idVysledku
RIV/68407700:21230/13:00202860
n3:jazykVysledku
n12:eng
n3:klicovaSlova
GPU; RCPSP; homogenous model; Tabu Search
n3:klicoveSlovo
n5:GPU n5:Tabu%20Search n5:homogenous%20model n5:RCPSP
n3:kontrolniKodProRIV
[AA7E82B0CB8E]
n3:mistoKonaniAkce
Belfast
n3:mistoVydani
Los Alamitos
n3:nazevZdroje
Proceedings of the 21st International Euromicro Conference on Parallel, Distributed and Network-based Processing
n3:obor
n17:BB
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n21:7H12008
n3:rokUplatneniVysledku
n4:2013
n3:tvurceVysledku
Šůcha, Přemysl Bukata, Libor
n3:typAkce
n22:WRD
n3:wos
000321123000052
n3:zahajeniAkce
2013-02-27+01:00
s:issn
1066-6192
s:numberOfPages
8
n14:doi
10.1109/PDP.2013.59
n16:hasPublisher
IEEE Computer Society Press
n9:isbn
978-0-7695-4939-2
n11:organizacniJednotka
21230