{"id":"https://openalex.org/W2081840458","doi":"https://doi.org/10.1145/1073970.1073983","title":"Scheduling malleable tasks with precedence constraints","display_name":"Scheduling malleable tasks with precedence constraints","publication_year":2005,"publication_date":"2005-07-18","ids":{"openalex":"https://openalex.org/W2081840458","doi":"https://doi.org/10.1145/1073970.1073983","mag":"2081840458"},"language":"en","primary_location":{"id":"doi:10.1145/1073970.1073983","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073970.1073983","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures","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/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Universit\u00e4t zu Kiel, Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t zu Kiel, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111498494","display_name":"Hu Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hu Zhang","raw_affiliation_strings":["McMaster University, Hamilton, ON, Canada","#N# McMaster University, Hamilton, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"McMaster University, Hamilton, ON, Canada","institution_ids":["https://openalex.org/I98251732"]},{"raw_affiliation_string":"#N# McMaster University, Hamilton, ON, Canada","institution_ids":["https://openalex.org/I98251732"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.0773,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.9952176,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"86","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9993000030517578,"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.9940000176429749,"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/rounding","display_name":"Rounding","score":0.7600412368774414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7484873533248901},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7141363024711609},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5620737075805664},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5465084314346313},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5127838253974915},{"id":"https://openalex.org/keywords/allotment","display_name":"Allotment","score":0.4974668323993683},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39821720123291016},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38569051027297974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17579591274261475}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7600412368774414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7484873533248901},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7141363024711609},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5620737075805664},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5465084314346313},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5127838253974915},{"id":"https://openalex.org/C2775999810","wikidata":"https://www.wikidata.org/wiki/Q8054653","display_name":"Allotment","level":2,"score":0.4974668323993683},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39821720123291016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38569051027297974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17579591274261475},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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":1,"locations":[{"id":"doi:10.1145/1073970.1073983","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073970.1073983","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures","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":28,"referenced_works":["https://openalex.org/W1545060479","https://openalex.org/W1546023401","https://openalex.org/W1850405760","https://openalex.org/W1967030015","https://openalex.org/W1975231449","https://openalex.org/W1978417313","https://openalex.org/W1985211757","https://openalex.org/W1991452911","https://openalex.org/W1993720874","https://openalex.org/W2018125025","https://openalex.org/W2042017208","https://openalex.org/W2050487400","https://openalex.org/W2057913648","https://openalex.org/W2061094380","https://openalex.org/W2064757275","https://openalex.org/W2065689629","https://openalex.org/W2086190489","https://openalex.org/W2089269509","https://openalex.org/W2113581482","https://openalex.org/W2139411793","https://openalex.org/W2150446509","https://openalex.org/W2152424925","https://openalex.org/W2154305205","https://openalex.org/W2159891949","https://openalex.org/W2401502609","https://openalex.org/W2406029110","https://openalex.org/W3023226084","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W2176656443","https://openalex.org/W2330227439","https://openalex.org/W2320873867","https://openalex.org/W2357293591","https://openalex.org/W2351571841","https://openalex.org/W4205286891","https://openalex.org/W2386918049","https://openalex.org/W3185398749","https://openalex.org/W2149404148","https://openalex.org/W2543175834"],"abstract_inverted_index":{"In":[0,104,135,148],"this":[1],"paper":[2],"we":[3,34,94,108,151,184],"propose":[4,95],"an":[5,17],"approximation":[6,98,192],"algorithm":[7,99,145,196],"for":[8,20,39,100,118,163],"scheduling":[9,102,144],"malleable":[10,21,40,47,78,127],"tasks":[11,22],"with":[12,23],"precedence":[13],"constraints.":[14],"Based":[15],"on":[16],"interesting":[18],"model":[19],"continuous":[24],"processor":[25],"allotments":[26],"by":[27],"Prasanna":[28],"and":[29,57,87,159,166],"Musicus":[30],"[22,":[31],"23,":[32],"24],":[33],"define":[35],"two":[36,153],"natural":[37],"assumptions":[38,72],"tasks:":[41],"the":[42,52,58,63,73,83,91,101,105,123,136,142,149,164,167,173,182,191,213],"processing":[43,92],"time":[44],"of":[45,54,65,76,85,133,141,175,181,194],"any":[46,77],"task":[48,79,128],"is":[49,60,80,88,129,146,172,197,209],"non-increasing":[50],"in":[51,62,82,90],"number":[53,64,84,132,174],"processors":[55,86],"allotted,":[56],"speedup":[59],"concave":[61],"processors.":[66,134,176],"We":[67,203],"show":[68,185,205],"that":[69,190,206],"under":[70],"these":[71],"work":[74],"function":[75],"non-decreasing":[81],"convex":[89],"time.Furthermore,":[93],"a":[96,110,115,131,139,187],"two-phase":[97],"problem.":[103],"first":[106],"phase":[107,138],"solve":[109],"linear":[111],"program":[112],"to":[113,212],"obtain":[114],"fractional":[116,124],"allotment":[117,165],"all":[119],"tasks.":[120],"By":[121,177],"rounding":[122],"solution,":[125],"each":[126],"assigned":[130],"second":[137],"variant":[140],"list":[143],"employed.":[147],"phases":[150],"use":[152],"parameters":[154],"\u03bc":[155],"\u2208{1...":[156],"\u230a":[157],"(m+1)/2\u230b}":[158],"\u03c1":[160],"\u2208":[161],"[0,1]":[162],"rounding,":[168],"respectively,":[169],"where":[170],"m":[171],"choosing":[178],"appropriate":[179],"values":[180],"parameters,":[183],"(via":[186],"nonlinear":[188],"program)":[189],"ratio":[193],"our":[195,207],"at":[198],"most":[199],"100/63+100(\u221a6469+13)/5481":[200],"\u2248":[201],"3.291919.":[202],"also":[204],"result":[208],"very":[210],"close":[211],"best":[214],"asymptotic":[215],"one.":[216]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}