{"id":"https://openalex.org/W4231381424","doi":"https://doi.org/10.1109/sc.2000.10041","title":"Randomization, Speculation, and Adaptation in Batch Schedulers","display_name":"Randomization, Speculation, and Adaptation in Batch Schedulers","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W4231381424","doi":"https://doi.org/10.1109/sc.2000.10041"},"language":"en","primary_location":{"id":"doi:10.1109/sc.2000.10041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sc.2000.10041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM/IEEE SC 2000 Conference (SC'00)","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/A5004869903","display_name":"Dejan Perkovic","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. Perkovic","raw_affiliation_strings":["University of Maryland"],"affiliations":[{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110212075","display_name":"Peter J. Keleher","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P.J. Keleher","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004869903"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":3.46496143,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.92621971,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"7"},"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.9997000098228455,"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.9997000098228455,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9954000115394592,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9865000247955322,"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.7597960233688354},{"id":"https://openalex.org/keywords/speculation","display_name":"Speculation","score":0.6217768788337708},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5962722301483154},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5785330533981323},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5138166546821594},{"id":"https://openalex.org/keywords/adaptation","display_name":"Adaptation (eye)","score":0.4909532368183136},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4879440665245056},{"id":"https://openalex.org/keywords/slowdown","display_name":"Slowdown","score":0.4823548197746277},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4664791226387024},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.40418267250061035},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2660018801689148},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.14328143000602722},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1375962495803833},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08378928899765015},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07851332426071167}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7597960233688354},{"id":"https://openalex.org/C47941915","wikidata":"https://www.wikidata.org/wiki/Q107885","display_name":"Speculation","level":2,"score":0.6217768788337708},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5962722301483154},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5785330533981323},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5138166546821594},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.4909532368183136},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4879440665245056},{"id":"https://openalex.org/C2777242750","wikidata":"https://www.wikidata.org/wiki/Q31351","display_name":"Slowdown","level":2,"score":0.4823548197746277},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4664791226387024},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40418267250061035},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2660018801689148},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.14328143000602722},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1375962495803833},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08378928899765015},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07851332426071167},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sc.2000.10041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sc.2000.10041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM/IEEE SC 2000 Conference (SC'00)","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.5699999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W199897230","https://openalex.org/W1487076132","https://openalex.org/W1545972097","https://openalex.org/W1581615656","https://openalex.org/W1932332931","https://openalex.org/W1987340991","https://openalex.org/W2105555642","https://openalex.org/W2130612989","https://openalex.org/W2150074609","https://openalex.org/W4292688220"],"related_works":["https://openalex.org/W4243792164","https://openalex.org/W2147782221","https://openalex.org/W2076161440","https://openalex.org/W3107943460","https://openalex.org/W2799624154","https://openalex.org/W4250172181","https://openalex.org/W2489870153","https://openalex.org/W3091416521","https://openalex.org/W2003989576","https://openalex.org/W2358378335"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"extensions":[3,60],"to":[4,102,132],"the":[5,19,29,47,93,110,126],"backfilling":[6,36,97],"job-scheduling":[7],"algorithm":[8,52],"that":[9,17,39,61,74,80],"significantly":[10,55,86],"improve":[11],"its":[12],"performance.":[13],"We":[14,27,78,91],"introduce":[15],"variations":[16],"sort":[18],"\"backfilling":[20],"order\"":[21],"in":[22,34,71],"priority-based":[23],"and":[24,37,85,98],"randomized":[25],"fashions.":[26],"examine":[28],"effectiveness":[30],"of":[31,49,95,112,116,122,136],"guarantees":[32,41],"present":[33],"conservative":[35,137],"find":[38,79],"initial":[40],"have":[42],"limited":[43],"practical":[44],"value,":[45],"while":[46],"performance":[48],"a":[50],"\"no-guarantee\"":[51],"can":[53],"be":[54],"better":[56],"when":[57],"combined":[58],"with":[59],"we":[62,108],"introduce.":[63],"Our":[64],"study":[65],"differs":[66],"from":[67,88],"many":[68],"similar":[69],"studies":[70],"using":[72],"traces":[73],"contain":[75],"user":[76],"estimates.":[77],"actual":[81],"overestimates":[82],"are":[83],"large":[84,105],"different":[87],"simple":[89],"models.":[90],"propose":[92],"use":[94],"speculative":[96,99],"test":[100],"runs":[101],"counteract":[103],"these":[104,123],"overestimations.":[106],"Finally,":[107],"explore":[109],"impact":[111],"dynamic,":[113],"system-directed":[114],"adaptation":[115],"application":[117],"parallelism.":[118],"The":[119],"cumulative":[120],"improvements":[121],"techniques":[124],"decrease":[125],"bounded":[127],"slowdown,":[128],"our":[129],"primary":[130],"metric,":[131],"less":[133],"then":[134],"15%":[135],"backfilling.":[138]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
