{"id":"https://openalex.org/W2086677494","doi":"https://doi.org/10.1145/2312005.2312048","title":"A <sub>(3/2+\u03b5)</sub> approximation algorithm for scheduling moldable and non-moldable parallel tasks","display_name":"A <sub>(3/2+\u03b5)</sub> approximation algorithm for scheduling moldable and non-moldable parallel tasks","publication_year":2012,"publication_date":"2012-06-25","ids":{"openalex":"https://openalex.org/W2086677494","doi":"https://doi.org/10.1145/2312005.2312048","mag":"2086677494"},"language":"en","primary_location":{"id":"doi:10.1145/2312005.2312048","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","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/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Institut f\u00fcr Informatik, University of Kiel, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, University of Kiel, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":null,"apc_paid":null,"fwci":0.67250493,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.7722103,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"224","last_page":"235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9991999864578247,"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/T12176","display_name":"Optimization and Packing Problems","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.728651762008667},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6087403297424316},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6037803292274475},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5231574773788452},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5172132253646851},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4901154935359955},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.420045405626297},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39359259605407715},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.368848979473114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22034689784049988}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.728651762008667},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6087403297424316},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6037803292274475},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5231574773788452},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5172132253646851},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4901154935359955},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.420045405626297},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39359259605407715},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.368848979473114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22034689784049988},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2312005.2312048","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W98859305","https://openalex.org/W158608945","https://openalex.org/W175711003","https://openalex.org/W640645692","https://openalex.org/W1501066815","https://openalex.org/W1574644330","https://openalex.org/W1912586891","https://openalex.org/W1993982015","https://openalex.org/W2000619341","https://openalex.org/W2011039300","https://openalex.org/W2018125025","https://openalex.org/W2019261717","https://openalex.org/W2026129593","https://openalex.org/W2042017208","https://openalex.org/W2045215405","https://openalex.org/W2048462504","https://openalex.org/W2050328660","https://openalex.org/W2057913648","https://openalex.org/W2060963575","https://openalex.org/W2080316412","https://openalex.org/W2086190489","https://openalex.org/W2102201348","https://openalex.org/W2127960094","https://openalex.org/W2154305205","https://openalex.org/W2155766658","https://openalex.org/W2401502609","https://openalex.org/W2736018979","https://openalex.org/W3138484722","https://openalex.org/W4234582748","https://openalex.org/W6620687829"],"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/W2998357381","https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W3204654320"],"abstract_inverted_index":{"In":[0,95],"this":[1,96],"paper":[2,97],"we":[3,98,124],"study":[4],"a":[5,28,39,101],"scheduling":[6,63,84,114,133],"problem":[7,115],"with":[8,65,88,103],"moldable":[9,134],"and":[10],"non-moldable":[11,18,85],"parallel":[12,19,26,86,135],"tasks":[13,87],"on":[14,27,42],"$m$":[15],"processors.":[16,33],"A":[17],"task":[20,53],"is":[21,36,60],"one":[22],"that":[23,100],"runs":[24],"in":[25,116],"specific":[29],"given":[30],"number":[31],"of":[32,70],"The":[34,56],"goal":[35],"to":[37],"find":[38],"non-preemptive":[40],"schedule":[41,102],"the":[43,48,51,61,73,113],"m":[44],"processors":[45],"which":[46],"minimizes":[47],"makespan,":[49],"or":[50],"latest":[52],"completion":[54],"time.":[55],"previous":[57],"best":[58],"result":[59],"list":[62],"algorithm":[64,82,131],"an":[66,80,126],"absolute":[67],"approximation":[68,81,130],"ratio":[69,89],"2.":[71],"On":[72],"other":[74],"hand,":[75],"there":[76],"does":[77],"not":[78],"exist":[79],"for":[83,112,132],"smaller":[90],"than":[91],"1.5,":[92],"unless":[93],"P=NP.":[94],"show":[99],"length":[104],"(1.5":[105,127],"+":[106,121,128],"\u03b5)":[107,129],"OPT":[108],"can":[109],"be":[110],"computed":[111],"time":[117],"O(n":[118],"log":[119],"n)":[120],"f(1/\u03b5).":[122],"Furthermore":[123],"present":[125],"tasks.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}