{"id":"https://openalex.org/W2788302869","doi":"https://doi.org/10.1145/3210377.3210402","title":"Online Non-preemptive Scheduling on Unrelated Machines with Rejections","display_name":"Online Non-preemptive Scheduling on Unrelated Machines with Rejections","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2788302869","doi":"https://doi.org/10.1145/3210377.3210402","mag":"2788302869"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210402","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210402","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210402","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210402","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085905772","display_name":"Giorgio Lucarelli","orcid":"https://orcid.org/0000-0001-7368-355X"},"institutions":[{"id":"https://openalex.org/I4387152457","display_name":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","ror":"https://ror.org/04x6jg419","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Giorgio Lucarelli","raw_affiliation_strings":["LCOMS, Univ. Lorraine, France"],"affiliations":[{"raw_affiliation_string":"LCOMS, Univ. Lorraine, France","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044201440","display_name":"Benjamin Moseley","orcid":"https://orcid.org/0000-0001-8162-017X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Moseley","raw_affiliation_strings":["Carnegie Mellon University, USA","Carnegie -Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie -Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077796278","display_name":"Nguy\u1ec5n Kim Th\u1eafng","orcid":"https://orcid.org/0000-0002-6085-9453"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210107733","display_name":"Informatique, BioInformatique, Syst\u00e8mes Complexes","ror":"https://ror.org/01aqxgr98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210107733","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nguyen Kim Thang","raw_affiliation_strings":["IBISC, Univ \u00c9vry, Universit\u00e9 Paris-Saclay, France"],"affiliations":[{"raw_affiliation_string":"IBISC, Univ \u00c9vry, Universit\u00e9 Paris-Saclay, France","institution_ids":["https://openalex.org/I4210107733","https://openalex.org/I277688954"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012405751","display_name":"Abhinav Srivastav","orcid":null},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210107733","display_name":"Informatique, BioInformatique, Syst\u00e8mes Complexes","ror":"https://ror.org/01aqxgr98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210107733","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Abhinav Srivastav","raw_affiliation_strings":["IBISC, Univ \u00c9vry, Universit\u00e9 Paris-Saclay, France"],"affiliations":[{"raw_affiliation_string":"IBISC, Univ \u00c9vry, Universit\u00e9 Paris-Saclay, France","institution_ids":["https://openalex.org/I4210107733","https://openalex.org/I277688954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106430515","display_name":"Denis Trystram","orcid":null},"institutions":[{"id":"https://openalex.org/I106785703","display_name":"Institut polytechnique de Grenoble","ror":"https://ror.org/05sbt2524","country_code":"FR","type":"education","lineage":["https://openalex.org/I106785703","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210101348","display_name":"Centre Inria de l'Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/00n8d6z93","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210101348"]},{"id":"https://openalex.org/I4210104430","display_name":"Laboratoire d'Informatique de Grenoble","ror":"https://ror.org/01c8rcg82","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210104430","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Denis Trystram","raw_affiliation_strings":["Univ. Grenoble Alpes, CNRS, Inria, Grenoble INP, LIG, France"],"affiliations":[{"raw_affiliation_string":"Univ. Grenoble Alpes, CNRS, Inria, Grenoble INP, LIG, France","institution_ids":["https://openalex.org/I4210101348","https://openalex.org/I1294671590","https://openalex.org/I106785703","https://openalex.org/I4210104430","https://openalex.org/I899635006"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5085905772"],"corresponding_institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.02370493,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":"2","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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.998199999332428,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7988954782485962},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.7938491106033325},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7366816997528076},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7352712750434875},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.633056104183197},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5026242733001709},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.483573853969574},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.4232305884361267},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4165036678314209},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3983200490474701},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.38354456424713135},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37684011459350586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2323322296142578},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13554412126541138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12728780508041382},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0960644781589508}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7988954782485962},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.7938491106033325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7366816997528076},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7352712750434875},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.633056104183197},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5026242733001709},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.483573853969574},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.4232305884361267},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4165036678314209},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3983200490474701},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.38354456424713135},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37684011459350586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2323322296142578},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13554412126541138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12728780508041382},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0960644781589508},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/3210377.3210402","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210402","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210402","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"doi:10.1145/3460880","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3460880","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3460880","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1802.10309","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1802.10309","pdf_url":"https://arxiv.org/pdf/1802.10309","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:HAL:hal-01986312v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01986312","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SPAA 2018 - 30th ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2018, Vienna, Austria. pp.291-300, ⟨10.1145/3210377.3210402⟩","raw_type":"Conference papers"},{"id":"pmh:oai:HAL:hal-03341772v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03341772","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Parallel Computing, 2021, 8 (2), pp.1-22. ⟨10.1145/3460880⟩","raw_type":"Journal articles"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/20999","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/20999","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},{"id":"doi:10.48550/arxiv.1802.10309","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1802.10309","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:2788302869","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3210377.3210402","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210402","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210402","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G1041279674","display_name":null,"funder_award_id":"ANR-19-P3IA-0003","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G1084238560","display_name":"AF: Small: Collaborative Research: Algorithmic and Computational Frontiers of MapReduce for Big Data Analysis","funder_award_id":"1617724","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1288077169","display_name":null,"funder_award_id":"CMMI-1938909","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1601568894","display_name":null,"funder_award_id":"CCF-1725661","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2092057362","display_name":null,"funder_award_id":"19-P3IA-0003","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2103506358","display_name":null,"funder_award_id":"(ANR-19-P3IA-0003)","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2673416368","display_name":null,"funder_award_id":"CCF-1733873","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3194597172","display_name":null,"funder_award_id":"ANR-15-CE40-0015","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G3203415976","display_name":null,"funder_award_id":"ANR-15-CE40-0015-01","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G3292004523","display_name":"SPX:  Collaborative Research:  Harnessing the Power of High-Bandwidth Memory via Provably Efficient Parallel Algorithms","funder_award_id":"1824303","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3680960908","display_name":null,"funder_award_id":"ANR-19-P3IA-000","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4586274889","display_name":"Optimal Scheduling of Parallelizable Jobs in Cloud Computing Environments","funder_award_id":"1938909","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5954070948","display_name":null,"funder_award_id":"CMMI-","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6851345361","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7361967927","display_name":"AITF: Applied Algorithmic Foundation for Scheduling Multiprogrammed Parallelizable Workloads","funder_award_id":"1733873","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G782747244","display_name":null,"funder_award_id":"17256","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8200235217","display_name":"SPX:  Collaborative Research:  Harnessing the Power of High-Bandwidth Memory via Provably Efficient Parallel Algorithms","funder_award_id":"1725661","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8318455765","display_name":null,"funder_award_id":"ANR-19","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8411882594","display_name":null,"funder_award_id":"CCF-1845146","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2788302869.pdf","grobid_xml":"https://content.openalex.org/works/W2788302869.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W204261080","https://openalex.org/W435588996","https://openalex.org/W1532723983","https://openalex.org/W1972868674","https://openalex.org/W2086365412","https://openalex.org/W2099961254","https://openalex.org/W2138779116","https://openalex.org/W2152025418","https://openalex.org/W2406628834","https://openalex.org/W2412956146","https://openalex.org/W2949398645","https://openalex.org/W2951755587","https://openalex.org/W4235684105","https://openalex.org/W4246623841"],"related_works":["https://openalex.org/W2964057209","https://openalex.org/W3028886217","https://openalex.org/W2025222277","https://openalex.org/W613477167","https://openalex.org/W2467224554","https://openalex.org/W2067015604","https://openalex.org/W2088244045","https://openalex.org/W2438857218","https://openalex.org/W3081701422","https://openalex.org/W2913815839","https://openalex.org/W1834104545","https://openalex.org/W3092462268","https://openalex.org/W3105569215","https://openalex.org/W2186606863","https://openalex.org/W3120273551","https://openalex.org/W2981033832","https://openalex.org/W2186165344","https://openalex.org/W2126132735","https://openalex.org/W2346320679","https://openalex.org/W2533245651"],"abstract_inverted_index":{"When":[0],"a":[1,9,15,42,65,140,199,207],"computer":[2],"system":[3,46],"schedules":[4],"jobs":[5],"there":[6,63],"is":[7,41,64,85,136],"typically":[8],"significant":[10],"cost":[11,20],"associated":[12],"with":[13,170],"preempting":[14],"job":[16],"during":[17],"execution.":[18],"This":[19,83,122,161],"can":[21,158,163],"be":[22,159,164,225],"from":[23],"the":[24,29,50,130,134,154,175,181,186,193,215,230,236,239],"expensive":[25],"task":[26],"of":[27,38,52,143,210,232,238,241],"saving":[28],"memory's":[30],"state":[31],"and":[32,36,57,69,105,184,244],"loading":[33],"data":[34,58],"into":[35],"out":[37],"memory.":[39],"There":[40],"need":[43],"for":[44,96,179],"non-preemptive":[45,73,126],"schedulers":[47,75,234],"to":[48,78,88,138,166,227],"avoid":[49],"costs":[51],"preemption":[53],"on":[54,92],"desktops,":[55],"servers":[56],"centers.":[59],"Despite":[60],"this":[61,150],"need,":[62],"gap":[66,84],"between":[67],"theory":[68],"practice.":[70],"Indeed,":[71,99],"few":[72,148],"online":[74,94,125,243],"are":[76],"known":[77],"have":[79,198],"strong":[80,89,155],"foundational":[81],"guarantees.":[82,121,173],"likely":[86],"due":[87],"lower":[90,156],"bounds":[91,157],"any":[93],"algorithm":[95,135],"popular":[97],"objectives.":[98],"typical":[100],"worst":[101],"case":[102],"analysis":[103],"approaches,":[104],"even":[106],"resource":[107],"augmented":[108],"approaches":[109],"such":[110],"as":[111],"speed":[112,222],"augmentation,":[113],"result":[114],"in":[115,129,229,235],"all":[116],"algorithms":[117,178,197],"having":[118],"poor":[119],"performance":[120],"paper":[123,151,176,216],"considers":[124],"scheduling":[127,168],"problems":[128],"worst-case":[131,172],"model":[132,162],"where":[133],"allowed":[137],"reject":[139],"small":[141,200],"fraction":[142,209],"jobs.":[144,211],"By":[145],"rejecting":[146,205],"only":[147,206],"jobs,":[149],"shows":[152],"that":[153,218],"circumvented.":[160],"used":[165],"discover":[167],"policies":[169],"desirable":[171],"Specifically,":[174],"presents":[177],"minimizing":[180,185],"total":[182,187],"flow-time":[183,189],"weighted":[188],"plus":[190],"energy":[191],"under":[192],"speed-scaling":[194],"mechanism.":[195],"The":[196],"constant":[201,208],"competitive":[202],"ratio":[203],"while":[204],"Beyond":[212],"specific":[213],"results,":[214],"asserts":[217],"alternative":[219],"models":[220],"beyond":[221],"augmentation":[223],"should":[224],"explored":[226],"aid":[228],"discovery":[231],"good":[233],"face":[237],"requirement":[240],"being":[242],"non-preemptive.":[245]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}