{"id":"https://openalex.org/W2463947075","doi":"https://doi.org/10.1145/2935764.2935824","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2463947075","doi":"https://doi.org/10.1145/2935764.2935824","mag":"2463947075"},"language":"en","primary_location":{"id":"doi:10.1145/2935764.2935824","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935824","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th 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/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sungjin Im","raw_affiliation_strings":["University of California, Merced, Merced, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Merced, Merced, USA","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071922030","display_name":"Maryam Shadloo","orcid":null},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maryam Shadloo","raw_affiliation_strings":["University of California, Merced, Merced, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Merced, Merced, USA","institution_ids":["https://openalex.org/I156087764"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006392819"],"corresponding_institution_ids":["https://openalex.org/I156087764"],"apc_list":null,"apc_paid":null,"fwci":0.5791,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70865008,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"207","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9970999956130981,"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/computer-science","display_name":"Computer science","score":0.7035782933235168},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.5131381154060364},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.512736439704895},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5120483040809631},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.4815852642059326},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.47955557703971863},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4731403589248657},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.4688637852668762},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.4402993321418762},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42969226837158203},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42908918857574463},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.42302921414375305},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3621629476547241},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2761036455631256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20879584550857544},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12352919578552246}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7035782933235168},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.5131381154060364},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.512736439704895},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5120483040809631},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.4815852642059326},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.47955557703971863},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4731403589248657},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.4688637852668762},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.4402993321418762},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42969226837158203},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42908918857574463},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.42302921414375305},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3621629476547241},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2761036455631256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20879584550857544},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12352919578552246},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2935764.2935824","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935824","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8899999856948853,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W170424756","https://openalex.org/W1596968903","https://openalex.org/W1629553384","https://openalex.org/W1680337629","https://openalex.org/W1931592052","https://openalex.org/W1967762975","https://openalex.org/W2005012890","https://openalex.org/W2011972928","https://openalex.org/W2014008637","https://openalex.org/W2014365311","https://openalex.org/W2041438374","https://openalex.org/W2049060423","https://openalex.org/W2069832779","https://openalex.org/W2076145388","https://openalex.org/W2096825534","https://openalex.org/W2097078863","https://openalex.org/W2099961254","https://openalex.org/W2137563419","https://openalex.org/W2160693425","https://openalex.org/W2161884835","https://openalex.org/W2176257353","https://openalex.org/W2356268455","https://openalex.org/W2493333348","https://openalex.org/W2737902931","https://openalex.org/W4213018579"],"related_works":["https://openalex.org/W2076915000","https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2962917430","https://openalex.org/W2040347389","https://openalex.org/W2952081610","https://openalex.org/W4299801389","https://openalex.org/W1983383464","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":{"Modern":[0],"processors":[1,95],"typically":[2],"allow":[3],"dynamic":[4],"speed-scaling":[5],"offering":[6],"an":[7],"effective":[8],"trade-off":[9],"between":[10],"high":[11],"throughput":[12],"and":[13,63,140,145,175],"energy":[14,58],"efficiency.":[15],"In":[16,79,167],"a":[17,20,34,52,65,118,129,163],"classical":[18],"model,":[19],"processor/machine":[21],"runs":[22,190],"at":[23],"speed":[24],"s":[25],"when":[26,102,151],"consuming":[27],"power":[28],"s\u03b1":[29],"where":[30,138,195],"\u03b1":[31,173],">1":[32,174],"is":[33,120,153,197],"constant.":[35],"Yao":[36],"et":[37],"al.":[38],"[FOCS":[39],"1995]":[40],"studied":[41,86],"the":[42,56,81,88,111,135,143,157,180,198],"problem":[43,82,112,185],"of":[44,90,110,200],"completing":[45],"all":[46],"jobs":[47,103,201],"before":[48],"their":[49,60],"deadlines":[50],"on":[51,165,186],"single":[53],"machine":[54],"with":[55],"minimum":[57,146],"in":[59,87,191],"seminal":[61],"work":[62,72],"gave":[64],"nice":[66],"polynomial":[67],"time":[68,194],"algorithm.":[69],"The":[70],"influential":[71],"has":[73,83],"been":[74,84],"extended":[75],"to":[76,202],"various":[77],"settings.":[78],"particular,":[80],"extensively":[85],"presence":[89],"multiple":[91,187],"machines":[92,188],"as":[93],"multi-core":[94],"have":[96],"become":[97],"dominant":[98],"computing":[99],"units.":[100],"However,":[101],"must":[104],"be":[105,125,203],"scheduled":[106],"non-preemptively,":[107],"our":[108],"understanding":[109],"remains":[113],"fairly":[114],"unsatisfactory.":[115],"Often,":[116],"preempting":[117],"job":[119,147],"prohibited":[121],"since":[122],"it":[123],"could":[124],"very":[126],"costly.":[127],"Previously,":[128],"O((wmax":[130],"wmin)\u03b1)-approximation":[131],"was":[132],"known":[133,159],"for":[134,170,183],"non-preemptive":[136],"setting":[137],"wmax":[139],"wmin":[141],"denote":[142],"maximum":[144],"sizes,":[148],"respectively.":[149],"Even":[150],"there":[152],"only":[154],"one":[155],"machine,":[156],"best":[158],"approximation":[160],"factor":[161],"had":[162],"dependency":[164],"\u03b1.":[166],"this":[168,184],"paper,":[169],"any":[171],"fixed":[172],"\u03b5":[176],">0,":[177],"we":[178],"give":[179],"first":[181],"(1+\u03b5)-approximation":[182],"which":[189],"nO(polylog":[192],"(n))":[193],"n":[196],"number":[199],"scheduled.":[204]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-07-22T00:00:00"}