{"id":"https://openalex.org/W2104338317","doi":"https://doi.org/10.1109/ipps.1995.395946","title":"Fast scheduling of periodic tasks on multiple resources","display_name":"Fast scheduling of periodic tasks on multiple resources","publication_year":2002,"publication_date":"2002-11-19","ids":{"openalex":"https://openalex.org/W2104338317","doi":"https://doi.org/10.1109/ipps.1995.395946","mag":"2104338317"},"language":"en","primary_location":{"id":"doi:10.1109/ipps.1995.395946","doi":"https://doi.org/10.1109/ipps.1995.395946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipps.1995.395946","pdf_url":null,"source":{"id":"https://openalex.org/S4306420034","display_name":"International Parallel Processing Symposium","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 9th International Parallel Processing Symposium","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5038442224","display_name":"Sanjoy Baruah","orcid":"https://orcid.org/0000-0002-4541-3445","observed_orcids":["https://orcid.org/0000-0002-4541-3445"]},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S.K. Baruah","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Vermont, Burlington, VT, USA","Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Vermont, Burlington, VT, USA","institution_ids":["https://openalex.org/I111236770"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA","institution_ids":["https://openalex.org/I111236770"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023537206","display_name":"Johannes E. Gehrke","orcid":"https://orcid.org/0009-0006-6293-5209","observed_orcids":["https://orcid.org/0009-0006-6293-5209"]},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]},{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.E. Gehrke","raw_affiliation_strings":["Department of Computer Science, University of Texas, Austin, Austin, TX, USA","Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA","institution_ids":["https://openalex.org/I111236770"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087882429","display_name":"C. Gregory Plaxton","orcid":"https://orcid.org/0000-0001-7084-1612","observed_orcids":["https://orcid.org/0000-0001-7084-1612"]},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]},{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C.G. Plaxton","raw_affiliation_strings":["Department of Computer Science, University of Texas, Austin, Austin, TX, USA","Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA","institution_ids":["https://openalex.org/I111236770"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.5821,"has_fulltext":false,"cited_by_count":215,"citation_normalized_percentile":{"value":0.99075435,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"280","last_page":"288"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.7749000191688538,"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"}},"topics":[{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.7749000191688538,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.15189999341964722,"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/T12288","display_name":"Optimization and Search Problems","score":0.010200000368058681,"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/periodic-scheduling","display_name":"periodic scheduling","score":0.8420000076293945},{"id":"https://openalex.org/keywords/real-time-scheduling","display_name":"real-time scheduling","score":0.6520000100135803},{"id":"https://openalex.org/keywords/scheduling-algorithms","display_name":"scheduling algorithms","score":0.5849999785423279},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.5540000200271606}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6910732388496399},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6139872074127197},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5492397546768188},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5072996020317078},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46931907534599304},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3660163879394531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2456175982952118},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1198941171169281}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipps.1995.395946","doi":"https://doi.org/10.1109/ipps.1995.395946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipps.1995.395946","pdf_url":null,"source":{"id":"https://openalex.org/S4306420034","display_name":"International Parallel Processing Symposium","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 9th International Parallel Processing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1970691969","https://openalex.org/W1980289219","https://openalex.org/W1996641400","https://openalex.org/W2056830486","https://openalex.org/W2086748818","https://openalex.org/W2104338317","https://openalex.org/W2109488193"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W3204654320","https://openalex.org/W2128410848","https://openalex.org/W2102390841","https://openalex.org/W2118368532","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227","https://openalex.org/W2130555437","https://openalex.org/W3023290810"],"abstract_inverted_index":{"Given":[0],"n":[1,32],"periodic":[2,21,49],"tasks,":[3],"each":[4],"characterized":[5],"by":[6],"an":[7,40],"execution":[8],"requirement":[9],"and":[10,13,52],"a":[11,18,28],"period,":[12],"m":[14,36],"identical":[15],"copies":[16],"of":[17,47],"resource,":[19],"the":[20,31,35,48],"scheduling":[22,50],"problem":[23],"is":[24],"concerned":[25],"with":[26],"generating":[27],"schedule":[29],"for":[30],"tasks":[33],"on":[34],"resources.":[37],"We":[38],"present":[39],"algorithm":[41],"that":[42],"schedules":[43],"every":[44],"feasible":[45],"instance":[46],"problem,":[51],"runs":[53],"in":[54],"O(min{mlgn,n})":[55],"time":[56],"per":[57],"slot":[58],"scheduled.>":[59]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":10}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-10T00:00:00"}