{"id":"https://openalex.org/W2500236510","doi":"https://doi.org/10.1145/2938378","title":"Competitively Scheduling Tasks with Intermediate Parallelizability","display_name":"Competitively Scheduling Tasks with Intermediate Parallelizability","publication_year":2016,"publication_date":"2016-06-28","ids":{"openalex":"https://openalex.org/W2500236510","doi":"https://doi.org/10.1145/2938378","mag":"2500236510"},"language":"en","primary_location":{"id":"doi:10.1145/2938378","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2938378","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-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":false,"raw_author_name":"Sungjin Im","raw_affiliation_strings":["University of California, Merced, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Merced, CA","institution_ids":["https://openalex.org/I156087764"]}]},{"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/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Moseley","raw_affiliation_strings":["Washington University in St. Louis, St. Louis, MO"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Washington University in St. Louis, St. Louis, MO","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046525615","display_name":"Kirk Pruhs","orcid":"https://orcid.org/0000-0001-5680-1753"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kirk Pruhs","raw_affiliation_strings":["University of Pittsburgh, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pittsburgh, Pittsburgh, PA","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027040066","display_name":"Eric Torng","orcid":"https://orcid.org/0000-0002-1400-0840"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric Torng","raw_affiliation_strings":["Michigan State University, East Lansing, MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Michigan State University, East Lansing, MI","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5909,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.72741935,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":"1","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.998199999332428,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9855999946594238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.8628856539726257},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6835399866104126},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5869312286376953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5424602031707764},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4587026834487915},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3768824338912964},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3441605567932129},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34048712253570557},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31447887420654297},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07430601119995117}],"concepts":[{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.8628856539726257},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6835399866104126},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5869312286376953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5424602031707764},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4587026834487915},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3768824338912964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3441605567932129},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34048712253570557},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31447887420654297},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07430601119995117}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2938378","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2938378","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W196419053","https://openalex.org/W204261080","https://openalex.org/W1945689612","https://openalex.org/W1965378629","https://openalex.org/W1972868674","https://openalex.org/W1998382156","https://openalex.org/W2025878354","https://openalex.org/W2029626238","https://openalex.org/W2053806044","https://openalex.org/W2112288559","https://openalex.org/W2124402683","https://openalex.org/W2397558994"],"related_works":["https://openalex.org/W4285069850","https://openalex.org/W2891970004","https://openalex.org/W1996916724","https://openalex.org/W4240963716","https://openalex.org/W1974634278","https://openalex.org/W1596637634","https://openalex.org/W2321918740","https://openalex.org/W2154273227","https://openalex.org/W1967209836","https://openalex.org/W2165839536"],"abstract_inverted_index":{"We":[0,49],"introduce":[1],"a":[2,52],"scheduling":[3,22],"algorithm":[4],"Intermediate-SRPT,":[5],"and":[6,32,71],"show":[7,51],"that":[8],"it":[9],"is":[10,26],"O":[11],"(log":[12],"P":[13,37],")-competitive":[14],"with":[15],"respect":[16],"to":[17,46],"average":[18],"flow":[19],"time":[20],"when":[21],"jobs":[23],"whose":[24],"parallelizability":[25],"intermediate":[27],"between":[28,41],"being":[29],"fully":[30],"parallelizable":[31],"sequential.":[33],"Here,":[34],"the":[35,39,42,47,58],"parameter":[36],"denotes":[38],"ratio":[40],"maximum":[43],"job":[44],"size":[45],"minimum.":[48],"also":[50],"general":[53],"matching":[54],"lower":[55],"bound":[56],"on":[57,64],"competitive":[59],"ratio.":[60],"Our":[61],"analysis":[62],"builds":[63],"an":[65],"interesting":[66],"combination":[67],"of":[68],"potential":[69],"function":[70],"local":[72],"competitiveness":[73],"arguments.":[74]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}