A Polynomial Algorithm to Prove Deadlock-Freeness of Wormhole Networks.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/pdp/TaktakED10
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/pdp/TaktakED10
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Emmanuelle_Encrenaz
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jean_Lou_Desbarbieux
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sami_Taktak
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FPDP.2010.19
>
foaf:
homepage
<
https://doi.org/10.1109/PDP.2010.19
>
dc:
identifier
DBLP conf/pdp/TaktakED10
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FPDP.2010.19
(xsd:string)
dcterms:
issued
2010
(xsd:gYear)
rdfs:
label
A Polynomial Algorithm to Prove Deadlock-Freeness of Wormhole Networks.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Emmanuelle_Encrenaz
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jean_Lou_Desbarbieux
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sami_Taktak
>
swrc:
pages
121-128
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/pdp/2010
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/pdp/TaktakED10/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/pdp/TaktakED10
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/pdp/pdp2010.html#TaktakED10
>
rdfs:
seeAlso
<
https://doi.org/10.1109/PDP.2010.19
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/pdp
>
dc:
subject
Network, deadlock, wormhole, routing function, dependency graph
(xsd:string)
dc:
title
A Polynomial Algorithm to Prove Deadlock-Freeness of Wormhole Networks.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document