{"id":"https://openalex.org/W2099270838","doi":"https://doi.org/10.1109/ispdc.2003.1267647","title":"Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid","display_name":"Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid","publication_year":2004,"publication_date":"2004-07-08","ids":{"openalex":"https://openalex.org/W2099270838","doi":"https://doi.org/10.1109/ispdc.2003.1267647","mag":"2099270838"},"language":"en","primary_location":{"id":"doi:10.1109/ispdc.2003.1267647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispdc.2003.1267647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","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/A5103158496","display_name":"Noriyuki Fujimoto","orcid":"https://orcid.org/0000-0002-8078-5025"},"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","Osaka University"],"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":"Osaka University","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 University, Toyonaka, Osaka, Japan#TAB#"],"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 University, Toyonaka, Osaka, Japan#TAB#","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7448,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.91613041,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"80","last_page":"87"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9973000288009644,"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.9966999888420105,"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/computer-science","display_name":"Computer science","score":0.8272193670272827},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6097136735916138},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5956884622573853},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5887884497642517},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5643948316574097},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5123468637466431},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4955636262893677},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4747752845287323},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4149569571018219},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.322581022977829},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2759552001953125},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.10687050223350525},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07094889879226685},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.05762869119644165}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8272193670272827},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6097136735916138},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5956884622573853},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5887884497642517},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5643948316574097},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5123468637466431},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4955636262893677},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4747752845287323},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4149569571018219},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.322581022977829},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2759552001953125},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.10687050223350525},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07094889879226685},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.05762869119644165},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ispdc.2003.1267647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispdc.2003.1267647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.5888","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5888","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/ispdc2003.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.6275","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.6275","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/ispdc2003.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1507306798","https://openalex.org/W1560961201","https://openalex.org/W1731525877","https://openalex.org/W1842876248","https://openalex.org/W1943674727","https://openalex.org/W1989006279","https://openalex.org/W1991906005","https://openalex.org/W1992734168","https://openalex.org/W1996256520","https://openalex.org/W2009990213","https://openalex.org/W2014071862","https://openalex.org/W2035609757","https://openalex.org/W2057392949","https://openalex.org/W2103363198","https://openalex.org/W2117540160","https://openalex.org/W2123864088","https://openalex.org/W2128451186","https://openalex.org/W2146438496","https://openalex.org/W2153251408","https://openalex.org/W2161509033","https://openalex.org/W2576116471","https://openalex.org/W2611804663","https://openalex.org/W2743045177","https://openalex.org/W2808376720","https://openalex.org/W4249318479","https://openalex.org/W6629967571","https://openalex.org/W6630088885","https://openalex.org/W6639209455"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W2225350526","https://openalex.org/W1545991362","https://openalex.org/W2167574351","https://openalex.org/W3003077338"],"abstract_inverted_index":{"The":[0,135],"most":[1],"common":[2],"objective":[3],"function":[4,157],"of":[5,31,34,75,112,118,127,131,147,158],"task":[6,133],"scheduling":[7,55,95],"problems":[8],"is":[9,45,48,109,115,124,153],"makespan.":[10],"However,":[11],"on":[12,144,185],"a":[13,35,57,70,73,91,105,155,174,186,209],"computational":[14],"grid,":[15],"the":[16,25,29,42,62,65,76,79,101,110,116,125,128,132,145,161,178],"2nd":[17],"optimal":[18,26,205],"makespan":[19,27],"may":[20],"be":[21,189],"much":[22],"longer":[23],"than":[24],"because":[28],"speed":[30],"each":[32],"processor":[33],"grid":[36,106,187],"varies":[37],"over":[38],"time.":[39],"So,":[40,160],"if":[41],"performance":[43,146,163],"measure":[44],"makespan,":[46],"there":[47],"no":[49],"approximation":[50],"algorithm":[51,93,137],"in":[52,207],"general":[53],"for":[54,94],"onto":[56,104],"grid.":[58],"In":[59],"contrast,":[60],"recently":[61],"authors":[63],"proposed":[64,136],"computing":[66,179],"power":[67,180],"consumed":[68,181],"by":[69,182,203],"schedule":[71,206],"as":[72,168],"criterion":[74],"schedule.":[77],"For":[78],"criterion,":[80],"this":[81],"\u00c4":[82,121,150,192],"\u00d4":[83,122,151,193],"\u00d2":[84,108,123,152,169,194,199],"\u00a1\u00d1":[85,195],"\u00d0\u00d3\ufffd":[86,196],"\ufffd":[87,197],"\u00d1":[88,114,198],"paper":[89],"gives":[90],"\u00d2-approximation":[92],"precedence":[96],"constrained":[97],"coarsegrained":[98],"tasks":[99],"with":[100],"same":[102],"length":[103,126],"where":[107],"number":[111,117],"tasks,":[113],"processors,":[119],"and":[120],"critical":[129],"path":[130],"graph.":[134],"does":[138],"not":[139],"use":[140],"any":[141],"prediction":[142],"information":[143],"underlying":[148],"resources.":[149],"usually":[154],"sublinear":[156],"\u00d2.":[159],"above":[162],"guarantee":[164],"converges":[165],"to":[166],"one":[167],"grows.":[170],"This":[171],"result":[172,176],"implies":[173],"non-trivial":[175],"that":[177,201],"an":[183,204],"application":[184],"can":[188],"limited":[190],"within":[191],"times":[200],"required":[202],"such":[208],"case.":[210],"1":[211]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}