{"id":"https://openalex.org/W4411086912","doi":"https://doi.org/10.1109/rtas65571.2025.00007","title":"Asymptotically Optimal Multiprocessor Real-Time Locking for non-JLFP Scheduling","display_name":"Asymptotically Optimal Multiprocessor Real-Time Locking for non-JLFP Scheduling","publication_year":2025,"publication_date":"2025-05-06","ids":{"openalex":"https://openalex.org/W4411086912","doi":"https://doi.org/10.1109/rtas65571.2025.00007"},"language":"en","primary_location":{"id":"doi:10.1109/rtas65571.2025.00007","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas65571.2025.00007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 31st Real-Time and Embedded Technology and Applications Symposium (RTAS)","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/A5001720743","display_name":"Zelin Tong","orcid":"https://orcid.org/0000-0002-4697-8747"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zelin Tong","raw_affiliation_strings":["University of North Carolina at Chapel Hill,Department of Computer Science"],"affiliations":[{"raw_affiliation_string":"University of North Carolina at Chapel Hill,Department of Computer Science","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052658635","display_name":"Syed Qaseem Ali","orcid":"https://orcid.org/0000-0002-9212-2608"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Syed Ali","raw_affiliation_strings":["University of North Carolina at Chapel Hill,Department of Computer Science"],"affiliations":[{"raw_affiliation_string":"University of North Carolina at Chapel Hill,Department of Computer Science","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114246496","display_name":"James H. Anderson","orcid":"https://orcid.org/0000-0001-7138-939X"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James H. Anderson","raw_affiliation_strings":["University of North Carolina at Chapel Hill,Department of Computer Science"],"affiliations":[{"raw_affiliation_string":"University of North Carolina at Chapel Hill,Department of Computer Science","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001720743"],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":null,"apc_paid":null,"fwci":2.4528,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.87085843,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9790999889373779,"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.9790999889373779,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9735000133514404,"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.9527999758720398,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.758072018623352},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7407644987106323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7074465155601501},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6112328767776489},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5423297882080078},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5293999910354614},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3921795189380646},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.3036670684814453},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.25736188888549805},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23589032888412476},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1588001251220703},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12482273578643799},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09850054979324341}],"concepts":[{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.758072018623352},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7407644987106323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7074465155601501},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6112328767776489},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5423297882080078},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5293999910354614},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3921795189380646},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.3036670684814453},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.25736188888549805},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23589032888412476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1588001251220703},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12482273578643799},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09850054979324341}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rtas65571.2025.00007","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas65571.2025.00007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 31st Real-Time and Embedded Technology and Applications Symposium (RTAS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G6196740178","display_name":null,"funder_award_id":"CPS 2333120,CPS 2038855,CPS 2038960,CNS 2151829","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1979351188","https://openalex.org/W1988767747","https://openalex.org/W2045683962","https://openalex.org/W2102543323","https://openalex.org/W2105420251","https://openalex.org/W2139995534","https://openalex.org/W2143006785","https://openalex.org/W2152307819","https://openalex.org/W2152365023","https://openalex.org/W2153552156","https://openalex.org/W2157407983","https://openalex.org/W2160293203","https://openalex.org/W2163091695","https://openalex.org/W2248547135","https://openalex.org/W4391583811","https://openalex.org/W4411086912","https://openalex.org/W6654168719","https://openalex.org/W6891683887","https://openalex.org/W6925714978","https://openalex.org/W6928975797"],"related_works":["https://openalex.org/W2155564881","https://openalex.org/W1833217363","https://openalex.org/W1979183926","https://openalex.org/W2161267363","https://openalex.org/W2062808533","https://openalex.org/W1809394610","https://openalex.org/W2134658009","https://openalex.org/W1511880291","https://openalex.org/W2101300711","https://openalex.org/W2153689068"],"abstract_inverted_index":{"In":[0,45],"prior":[1],"work,":[2],"a":[3],"number":[4],"of":[5,49],"asymptotically":[6,52,78],"optimal":[7,53,79],"suspension-based":[8,80],"real-time":[9,54,81],"locking":[10,33,55,73,82],"protocols":[11,34],"have":[12],"been":[13],"presented":[14],"for":[15,31,57,84],"job-level":[16],"fixed":[17],"priority":[18],"(JLFP)":[19],"schedulers,":[20],"where":[21,40],"job":[22,41],"priorities":[23,42],"do":[24],"not":[25],"change.":[26],"However,":[27],"the":[28,47,71,76],"optimality":[29],"proofs":[30],"these":[32],"break":[35],"down":[36],"under":[37],"non-JLFP":[38,59,72,85],"scheduling,":[39],"can":[43],"vary.":[44],"fact,":[46],"problem":[48,68],"designing":[50],"an":[51],"protocol":[56,74,83],"general":[58],"scheduling":[60],"has":[61],"remained":[62],"open.":[63],"This":[64],"paper":[65],"closes":[66],"this":[67],"by":[69],"presenting":[70],"(NJLP),":[75],"first":[77],"schedulers.":[86]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}