1997
AUTHORSPiotr Berman , Moses Charikar , Marek Karpinski
ABSTRACTWe consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of 3 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2e ≈ 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem. More... »
PAGES116-125
Algorithms and Data Structures
ISBN
978-3-540-63307-5
978-3-540-69422-9
http://scigraph.springernature.com/pub.10.1007/3-540-63307-3_52
DOIhttp://dx.doi.org/10.1007/3-540-63307-3_52
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1003220286
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/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Artificial Intelligence and Image Processing",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "The Pennsylvania State University, 16802, University Park, PA, USA",
"id": "http://www.grid.ac/institutes/grid.29857.31",
"name": [
"The Pennsylvania State University, 16802, University Park, PA, USA"
],
"type": "Organization"
},
"familyName": "Berman",
"givenName": "Piotr",
"id": "sg:person.01274506210.27",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01274506210.27"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Stanford University, 94305-9045, Stanford, CA",
"id": "http://www.grid.ac/institutes/grid.168010.e",
"name": [
"Stanford University, 94305-9045, Stanford, CA"
],
"type": "Organization"
},
"familyName": "Charikar",
"givenName": "Moses",
"id": "sg:person.01017615614.29",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01017615614.29"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "International Computer Science Institute, University of Bonn, 53117 Bonn, Berkeley",
"id": "http://www.grid.ac/institutes/grid.10388.32",
"name": [
"International Computer Science Institute, University of Bonn, 53117 Bonn, Berkeley"
],
"type": "Organization"
},
"familyName": "Karpinski",
"givenName": "Marek",
"id": "sg:person.011636042271.02",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011636042271.02"
],
"type": "Person"
}
],
"datePublished": "1997",
"datePublishedReg": "1997-01-01",
"description": "We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of 3 + \u221a8 \u2248 5.828 for the deterministic version, and 3.31/ln 2.155 \u2248 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2e \u2248 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem.",
"editor": [
{
"familyName": "Dehne",
"givenName": "Frank",
"type": "Person"
},
{
"familyName": "Rau-Chaplin",
"givenName": "Andrew",
"type": "Person"
},
{
"familyName": "Sack",
"givenName": "J\u00f6rg-R\u00fcdiger",
"type": "Person"
},
{
"familyName": "Tamassia",
"givenName": "Roberto",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/3-540-63307-3_52",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-540-63307-5",
"978-3-540-69422-9"
],
"name": "Algorithms and Data Structures",
"type": "Book"
},
"keywords": [
"competitive ratio",
"related machines",
"line fashion",
"randomized algorithm",
"deterministic algorithm",
"new algorithm",
"algorithm",
"machine",
"randomized variant",
"deterministic version",
"lower bounds",
"jobs",
"version",
"bounds",
"fashion",
"load",
"variants",
"line load",
"ratio",
"problem",
"permanent jobs"
],
"name": "On-line load balancing for related machines",
"pagination": "116-125",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1003220286"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/3-540-63307-3_52"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/3-540-63307-3_52",
"https://app.dimensions.ai/details/publication/pub.1003220286"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-08-04T17:22",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/chapter/chapter_87.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/3-540-63307-3_52"
}
]
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-63307-3_52'
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-63307-3_52'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-63307-3_52'
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-63307-3_52'
This table displays all metadata directly associated to this object as RDF triples.
115 TRIPLES
22 PREDICATES
46 URIs
39 LITERALS
7 BLANK NODES