{"id":"https://openalex.org/W2123864088","doi":"https://doi.org/10.1109/icpp.2003.1240603","title":"Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational grid","display_name":"Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational grid","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2123864088","doi":"https://doi.org/10.1109/icpp.2003.1240603","mag":"2123864088"},"language":"en","primary_location":{"id":"doi:10.1109/icpp.2003.1240603","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2003.1240603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Parallel Processing, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5018083376","display_name":"Nariaki Fujimoto","orcid":"https://orcid.org/0000-0002-8570-4001"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"N. Fujimoto","raw_affiliation_strings":["Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan","Graduate School of Information Science and Technology, Osaka Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka Univ","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111729293","display_name":"Kenichi Hagihara","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K. Hagihara","raw_affiliation_strings":["Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan","Graduate School of Information Science and Technology, Osaka Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka Univ","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":2.9727,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.92811908,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"391","last_page":"398"},"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.9997000098228455,"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.9997000098228455,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8482521772384644},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6773910522460938},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.664189875125885},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6560191512107849},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6085686087608337},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4912537932395935},{"id":"https://openalex.org/keywords/grid-computing","display_name":"Grid computing","score":0.46844106912612915},{"id":"https://openalex.org/keywords/power-consumption","display_name":"Power consumption","score":0.4356313943862915},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.433610200881958},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4245074987411499},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34434375166893005},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.26995494961738586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2212482988834381}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8482521772384644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6773910522460938},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.664189875125885},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6560191512107849},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6085686087608337},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4912537932395935},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.46844106912612915},{"id":"https://openalex.org/C2984118289","wikidata":"https://www.wikidata.org/wiki/Q29954","display_name":"Power consumption","level":3,"score":0.4356313943862915},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.433610200881958},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4245074987411499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34434375166893005},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.26995494961738586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2212482988834381},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icpp.2003.1240603","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2003.1240603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Parallel Processing, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.3.8881","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.8881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-hagi.ist.osaka-u.ac.jp/~fujimoto/publications/icpp2003.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.80.5913","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.5913","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-hagi.ist.osaka-u.ac.jp/~fujimoto/publications/icpp2003.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.44999998807907104}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1560961201","https://openalex.org/W1842876248","https://openalex.org/W1982084418","https://openalex.org/W1992734168","https://openalex.org/W2009990213","https://openalex.org/W2014071862","https://openalex.org/W2089269509","https://openalex.org/W2093979815","https://openalex.org/W2103363198","https://openalex.org/W2104680817","https://openalex.org/W2117540160","https://openalex.org/W2128451186","https://openalex.org/W2146438496","https://openalex.org/W2611804663","https://openalex.org/W2743045177","https://openalex.org/W4250886557","https://openalex.org/W6639209455"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2101020326","https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909"],"abstract_inverted_index":{"The":[0,65,118],"most":[1],"common":[2],"objective":[3],"function":[4],"of":[5,32,60,79,89,130,169],"task":[6],"scheduling":[7,53,103],"problems":[8],"is":[9,43,46,63,68,75],"makespan.":[10],"However,":[11],"on":[12,127],"a":[13,33,55,61,98,113,136,145,154],"computational":[14],"grid,":[15],"the":[16,25,29,40,76,81,86,90,94,109,128,140,167],"2nd":[17],"optimal":[18,26,163],"makespan":[19,27],"may":[20],"be":[21,150],"much":[22],"longer":[23],"than":[24],"because":[28],"computing":[30,141],"power":[31,142],"grid":[34,82,114],"varies":[35,172],"over":[36,173],"time.":[37],"So,":[38],"if":[39],"performance":[41,129],"measure":[42],"makespan,":[44],"there":[45],"no":[47],"approximation":[48],"algorithm":[49,101,120],"in":[50,152],"general":[51],"for":[52,93,102],"onto":[54,112],"grid.":[56],"A":[57],"novel":[58],"criterion":[59,67],"schedule":[62],"proposed.":[64],"proposed":[66,119],"called":[69],"total":[70,77],"processor":[71,171],"cycle":[72],"consumption,":[73],"which":[74],"number":[78],"instructions":[80],"could":[83],"compute":[84],"until":[85],"completion":[87],"time":[88,174],"schedule.":[91],"Moreover,":[92],"criterion,":[95],"this":[96],"gives":[97],"(l+":[99],"m(loge(m-1)+1)/n)-approximation":[100],"n":[104],"independent":[105],"coarse-grained":[106],"tasks":[107],"with":[108,115],"same":[110],"length":[111],"m":[116],"processors.":[117],"does":[121],"not":[122],"use":[123],"any":[124],"prediction":[125],"information":[126],"underlying":[131],"resources.":[132],"This":[133],"result":[134,138],"implies":[135],"nontrivial":[137],"that":[139,159],"consumed":[143],"by":[144,161],"parameter":[146],"sweep":[147],"application":[148],"can":[149],"limited":[151],"such":[153],"case":[155],"within":[156],"(1+m(loge(m-1)+1)/n)":[157],"times":[158],"required":[160],"an":[162],"schedule,":[164],"regardless":[165],"how":[166],"speed":[168],"each":[170]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}