Ontology type: schema:Chapter
1993
AUTHORSHsueh -I Lu , Philip N. Klein , Robert H. B. Netzer
ABSTRACTWe address a problem arising in debugging parallel programs, detecting race conditions in programs using a single semaphore for synchronization. It is NP-complete to detect races in programs that use many semaphores. For the case of a single semaphore, we give an algorithm that takes O(n1.5p) time, where p is the number of processors and n is the total number of semaphore operations executed. Our algorithm constructs a representation from which one can determine in constant time whether a race exists between two given events. More... »
PAGES471-482
Algorithms and Data Structures
ISBN
978-3-540-57155-1
978-3-540-47918-5
http://scigraph.springernature.com/pub.10.1007/3-540-57155-8_272
DOIhttp://dx.doi.org/10.1007/3-540-57155-8_272
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1034688863
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/06",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Biological Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0604",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Genetics",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Department of Computer Science, Brown University, 02912, Providence, RI, USA",
"id": "http://www.grid.ac/institutes/grid.40263.33",
"name": [
"Department of Computer Science, Brown University, 02912, Providence, RI, USA"
],
"type": "Organization"
},
"familyName": "Lu",
"givenName": "Hsueh -I",
"id": "sg:person.013345515575.46",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013345515575.46"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Brown University, 02912, Providence, RI, USA",
"id": "http://www.grid.ac/institutes/grid.40263.33",
"name": [
"Department of Computer Science, Brown University, 02912, Providence, RI, USA"
],
"type": "Organization"
},
"familyName": "Klein",
"givenName": "Philip N.",
"id": "sg:person.0701364100.14",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0701364100.14"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Brown University, 02912, Providence, RI, USA",
"id": "http://www.grid.ac/institutes/grid.40263.33",
"name": [
"Department of Computer Science, Brown University, 02912, Providence, RI, USA"
],
"type": "Organization"
},
"familyName": "Netzer",
"givenName": "Robert H. B.",
"id": "sg:person.015172024763.29",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015172024763.29"
],
"type": "Person"
}
],
"datePublished": "1993",
"datePublishedReg": "1993-01-01",
"description": "We address a problem arising in debugging parallel programs, detecting race conditions in programs using a single semaphore for synchronization. It is NP-complete to detect races in programs that use many semaphores. For the case of a single semaphore, we give an algorithm that takes O(n1.5p) time, where p is the number of processors and n is the total number of semaphore operations executed. Our algorithm constructs a representation from which one can determine in constant time whether a race exists between two given events.",
"editor": [
{
"familyName": "Dehne",
"givenName": "Frank",
"type": "Person"
},
{
"familyName": "Sack",
"givenName": "J\u00f6rg-R\u00fcdiger",
"type": "Person"
},
{
"familyName": "Santoro",
"givenName": "Nicola",
"type": "Person"
},
{
"familyName": "Whitesides",
"givenName": "Sue",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/3-540-57155-8_272",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-540-57155-1",
"978-3-540-47918-5"
],
"name": "Algorithms and Data Structures",
"type": "Book"
},
"keywords": [
"parallel programs",
"race conditions",
"number of processors",
"semaphores",
"semaphore operations",
"constant time",
"algorithm",
"processors",
"synchronization",
"NPs",
"representation",
"program",
"time",
"number",
"operation",
"one",
"total number",
"conditions",
"cases",
"events",
"race",
"problem"
],
"name": "Detecting race conditions in parallel programs that use one semaphore",
"pagination": "471-482",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1034688863"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/3-540-57155-8_272"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/3-540-57155-8_272",
"https://app.dimensions.ai/details/publication/pub.1034688863"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:54",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_448.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/3-540-57155-8_272"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-57155-8_272'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-57155-8_272'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-57155-8_272'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-57155-8_272'
This table displays all metadata directly associated to this object as RDF triples.
111 TRIPLES
23 PREDICATES
48 URIs
41 LITERALS
7 BLANK NODES