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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n6http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/ontology/domain/vavai/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F07%3A00019459%21RIV10-GA0-14330___/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F07%3A00019459%21RIV10-GA0-14330___
rdf:type
n14:Vysledek skos:Concept
dcterms:description
In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. Since usage of shared state storage allows for techniques unavailable in distributed memory, these are evaluated, both theoretically and practically, in a prototype implementation. Experimental data is presented to assess practical utility of those techniques, compared to static partitioning of state space, more traditional in distributed memory algorithms. In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. Since usage of shared state storage allows for techniques unavailable in distributed memory, these are evaluated, both theoretically and practically, in a prototype implementation. Experimental data is presented to assess practical utility of those techniques, compared to static partitioning of state space, more traditional in distributed memory algorithms.
dcterms:title
Shared Hash Tables in Parallel Model Checking Shared Hash Tables in Parallel Model Checking
skos:prefLabel
Shared Hash Tables in Parallel Model Checking Shared Hash Tables in Parallel Model Checking
skos:notation
RIV/00216224:14330/07:00019459!RIV10-GA0-14330___
n4:aktivita
n5:P n5:Z
n4:aktivity
P(1ET408050503), P(1M0545), P(GA201/06/1338), Z(MSM0021622419)
n4:cisloPeriodika
WP 07-04
n4:dodaniDat
n7:2010
n4:domaciTvurceVysledku
n6:5692792 n6:1292358
n4:druhVysledku
n18:J
n4:duvernostUdaju
n17:S
n4:entitaPredkladatele
n16:predkladatel
n4:idSjednocenehoVysledku
449682
n4:idVysledku
RIV/00216224:14330/07:00019459
n4:jazykVysledku
n8:eng
n4:klicovaSlova
Hash tables; locking schemes; parallel
n4:klicoveSlovo
n15:parallel n15:Hash%20tables n15:locking%20schemes
n4:kodStatuVydavatele
DE - Spolková republika Německo
n4:kontrolniKodProRIV
[97341FBA6288]
n4:nazevZdroje
CTIT Workshop Proceedings
n4:obor
n13:IN
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
2
n4:projekt
n9:1M0545 n9:GA201%2F06%2F1338 n9:1ET408050503
n4:rokUplatneniVysledku
n7:2007
n4:svazekPeriodika
2007
n4:tvurceVysledku
Barnat, Jiří Ročkai, Petr
n4:zamer
n12:MSM0021622419
s:issn
0929-0672
s:numberOfPages
15
n19:organizacniJednotka
14330