{"id":"https://openalex.org/W2034733796","doi":"https://doi.org/10.1109/clustr.2008.4663779","title":"Divisible load scheduling with improved asymptotic optimality","display_name":"Divisible load scheduling with improved asymptotic optimality","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2034733796","doi":"https://doi.org/10.1109/clustr.2008.4663779","mag":"2034733796"},"language":"en","primary_location":{"id":"doi:10.1109/clustr.2008.4663779","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clustr.2008.4663779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Cluster Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009108314","display_name":"Reiji Suda","orcid":"https://orcid.org/0000-0001-8797-6011"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]},{"id":"https://openalex.org/I4210086780","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19","country_code":"JP","type":"government","lineage":["https://openalex.org/I4210086780"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Reiji Suda","raw_affiliation_strings":["CREST, Japan Science and Technology Agency, Kawaguchi, Saitama, Japan","Department of Computer Science, University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"CREST, Japan Science and Technology Agency, Kawaguchi, Saitama, Japan","institution_ids":["https://openalex.org/I4210086780"]},{"raw_affiliation_string":"Department of Computer Science, University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009108314"],"corresponding_institution_ids":["https://openalex.org/I74801974","https://openalex.org/I4210086780"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1027832,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"262","last_page":"267"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8234332799911499},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.63239586353302},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.580681324005127},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5644117593765259},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.521121084690094},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4825591444969177},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.47768455743789673},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4692007899284363},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.4579680263996124},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4521414041519165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3618616461753845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31439661979675293}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8234332799911499},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.63239586353302},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.580681324005127},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5644117593765259},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.521121084690094},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4825591444969177},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.47768455743789673},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4692007899284363},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.4579680263996124},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4521414041519165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3618616461753845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31439661979675293},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/clustr.2008.4663779","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clustr.2008.4663779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Cluster Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W57243869","https://openalex.org/W1501013319","https://openalex.org/W1583060467","https://openalex.org/W2007614376","https://openalex.org/W2057289205","https://openalex.org/W2098946804","https://openalex.org/W2116629270","https://openalex.org/W2134166504","https://openalex.org/W2149301601","https://openalex.org/W2162927809","https://openalex.org/W2162983061","https://openalex.org/W2166669414"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2509452605","https://openalex.org/W2112121444","https://openalex.org/W2148608945","https://openalex.org/W3112689649","https://openalex.org/W2998357381","https://openalex.org/W2808535280","https://openalex.org/W2101020326","https://openalex.org/W2090648144","https://openalex.org/W3122821775"],"abstract_inverted_index":{"Divisible":[0],"load":[1],"model":[2],"allows":[3],"scheduling":[4],"algorithms":[5],"that":[6,20,85],"give":[7],"nearly":[8],"optimal":[9,35],"makespan":[10,27],"with":[11,63],"practical":[12],"computational":[13],"complexity.":[14],"Beaumont":[15,116],"et":[16,117],"al.":[17,118],"have":[18,53],"shown":[19],"their":[21,58],"algorithm":[22,59,91,110,114],"produces":[23],"a":[24],"schedule":[25],"whose":[26],"is":[28,92],"within":[29],"1+O(1/radicT)":[30],"times":[31],"larger":[32],"than":[33],"the":[34,38,47,77,86,102,105,113],"solution":[36],"when":[37],"total":[39],"amount":[40],"of":[41,57,66,80,89],"tasks":[42],"T":[43],"scales":[44],"up":[45],"and":[46,83],"other":[48],"conditions":[49],"are":[50],"fixed.":[51],"We":[52],"proposed":[54],"an":[55],"extension":[56],"for":[60],"multiple":[61],"masters":[62],"heterogeneous":[64],"performance":[65,79,88],"processors":[67],"but":[68],"limited":[69],"to":[70],"uniform":[71],"network":[72],"performance.":[73],"This":[74],"paper":[75],"analyzes":[76],"asymptotic":[78,87],"our":[81,90,109],"algorithm,":[82],"shows":[84],"either":[93],"1+O(1/radicT),":[94],"1+O(log":[95],"T/T)":[96],"or":[97],"1+O(1/T":[98],"),":[99],"depending":[100],"on":[101],"problem.":[103],"For":[104],"latter":[106],"two":[107],"cases,":[108],"asymptotically":[111],"outperforms":[112],"by":[115]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}