[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/AwerbuchS90>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Baruch_Awerbuch>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Michael_E._Saks>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FFSCS.1990.89525>
foaf:homepage <https://doi.org/10.1109/FSCS.1990.89525>
dc:identifier DBLP conf/focs/AwerbuchS90 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FFSCS.1990.89525 (xsd:string)
dcterms:issued 1990 (xsd:gYear)
rdfs:label A Dining Philosophers Algorithm with Polynomial Response Time (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Baruch_Awerbuch>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Michael_E._Saks>
swrc:pages 65-74 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS31a>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/AwerbuchS90/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/AwerbuchS90>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs90.html#AwerbuchS90>
rdfs:seeAlso <https://doi.org/10.1109/FSCS.1990.89525>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject distribution queue, job scheduling, dynamic job creation, job arrival density, conflicting jobs, asynchronous model, concurrent jobs, maximum execution time, dining philosophers algorithm, polynomial response time, distributed online algorithm, resource constraints, resource allocation, arbitrary networks, resource requirements, upper bound, message transmission time (xsd:string)
dc:title A Dining Philosophers Algorithm with Polynomial Response Time (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document