{"id":"https://openalex.org/W2076885483","doi":"https://doi.org/10.1145/2612669.2612702","title":"Deadline-aware scheduling of big-data processing jobs","display_name":"Deadline-aware scheduling of big-data processing jobs","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2076885483","doi":"https://doi.org/10.1145/2612669.2612702","mag":"2076885483"},"language":"en","primary_location":{"id":"doi:10.1145/2612669.2612702","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612702","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th 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/A5044047156","display_name":"Peter Bod\u00edk","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Peter Bodik","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032872922","display_name":"Ishai Menache","orcid":"https://orcid.org/0000-0002-2540-236X"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ishai Menache","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["Technion - Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071746007","display_name":"Jonathan Yaniv","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Jonathan Yaniv","raw_affiliation_strings":["Technion - Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044047156"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":3.1033,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92446787,"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":"211","last_page":"213"},"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.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/T10715","display_name":"Distributed and Parallel Computing Systems","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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9980999827384949,"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/rounding","display_name":"Rounding","score":0.8333050012588501},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7324438095092773},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6874005198478699},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6563410758972168},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5789269208908081},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.540005087852478},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5270445942878723},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5146254301071167},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.44615182280540466},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42296499013900757},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41951465606689453},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3008274435997009},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1663990020751953}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8333050012588501},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7324438095092773},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6874005198478699},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6563410758972168},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5789269208908081},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.540005087852478},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5270445942878723},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5146254301071167},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.44615182280540466},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42296499013900757},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41951465606689453},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3008274435997009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1663990020751953},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2612669.2612702","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612702","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1964122413","https://openalex.org/W2003902046","https://openalex.org/W2014023522","https://openalex.org/W2025222277","https://openalex.org/W2025549137","https://openalex.org/W2040466547","https://openalex.org/W2057239927","https://openalex.org/W2065791450","https://openalex.org/W2119400430","https://openalex.org/W2122985136","https://openalex.org/W2173213060"],"related_works":["https://openalex.org/W1581948717","https://openalex.org/W1941111399","https://openalex.org/W2268207117","https://openalex.org/W4313357160","https://openalex.org/W4300488607","https://openalex.org/W1916943706","https://openalex.org/W2951095575","https://openalex.org/W2105543801","https://openalex.org/W2002272911","https://openalex.org/W2543175834"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,23,48,134,145],"novel":[4],"algorithm":[5,91,121,126],"for":[6,80,92,122],"scheduling":[7],"big":[8],"data":[9],"jobs":[10],"on":[11,51,84,129],"large":[12],"compute":[13],"clusters.":[14],"In":[15],"our":[16,113],"model,":[17],"each":[18,81],"job":[19,82],"is":[20,38,68,106,116,127],"represented":[21],"by":[22,30],"DAG":[24],"consisting":[25],"of":[26,47,65,74,112],"several":[27],"stages":[28],"linked":[29],"precedence":[31],"constraints.":[32],"The":[33,125],"resource":[34],"allocation":[35],"per":[36],"stage":[37,49],"malleable,":[39],"in":[40,62],"the":[41,44,52,66,71,78,93,103,110,117,123,131],"sense":[42],"that":[43],"processing":[45],"time":[46],"depends":[50,83],"resources":[53],"allocated":[54],"to":[55,69],"it":[56],"(the":[57],"dependency":[58],"can":[59],"be":[60],"arbitrary":[61],"general).The":[63],"goal":[64],"scheduler":[67],"maximize":[70],"total":[72],"value":[73,79],"completed":[75],"jobs,":[76],"where":[77],"its":[85],"completion":[86],"time.":[87],"We":[88],"design":[89],"an":[90,97,140],"problem":[94,132],"which":[95],"guarantees":[96],"expected":[98],"constant":[99],"approximation":[100,120],"factor":[101],"when":[102],"cluster":[104],"capacity":[105],"sufficiently":[107],"high.":[108],"To":[109],"best":[111],"knowledge,":[114],"this":[115],"first":[118],"constant-factor":[119],"problem.":[124],"based":[128],"formulating":[130],"as":[133],"linear":[135],"program":[136],"and":[137],"then":[138],"rounding":[139],"optimal":[141],"(fractional)":[142],"solution":[143],"into":[144],"feasible":[146],"(integral)":[147],"schedule":[148],"using":[149],"randomized":[150],"rounding.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}