{"id":"https://openalex.org/W2079580591","doi":"https://doi.org/10.1145/2518148.2518157","title":"An asymptotically optimal real-time locking protocol for clustered scheduling under suspension-aware analysis","display_name":"An asymptotically optimal real-time locking protocol for clustered scheduling under suspension-aware analysis","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2079580591","doi":"https://doi.org/10.1145/2518148.2518157","mag":"2079580591"},"language":"en","primary_location":{"id":"doi:10.1145/2518148.2518157","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2518148.2518157","pdf_url":null,"source":{"id":"https://openalex.org/S4210187018","display_name":"ACM SIGBED Review","issn_l":"1551-3688","issn":["1551-3688"],"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 SIGBED Review","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/A5003988338","display_name":"Bj\u00f6rn B. Brandenburg","orcid":"https://orcid.org/0000-0001-8254-3815"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bj\u00f6rn B. Brandenburg","raw_affiliation_strings":["Max Planck Institute for Software Systems (MPI-SWS)","Max Planck Institute for Software Systems (MPI-SWS),#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems (MPI-SWS)","institution_ids":["https://openalex.org/I4210121786"]},{"raw_affiliation_string":"Max Planck Institute for Software Systems (MPI-SWS),#TAB#","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003988338"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210121786"],"apc_list":null,"apc_paid":null,"fwci":0.3171,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62377261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"10","issue":"2","first_page":"19","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"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.9998999834060669,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9951000213623047,"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"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9907000064849854,"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/priority-inversion","display_name":"Priority inversion","score":0.8500940799713135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7262433767318726},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.6856944561004639},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6135436296463013},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.5722916722297668},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5414735078811646},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5114368200302124},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.49668604135513306},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.46168962121009827},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.435440331697464},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.42616790533065796},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.38715529441833496},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3082512617111206},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.29320091009140015},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.2119891345500946},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1934046447277069},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18897324800491333},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0576900839805603}],"concepts":[{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.8500940799713135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7262433767318726},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.6856944561004639},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6135436296463013},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.5722916722297668},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5414735078811646},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5114368200302124},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.49668604135513306},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.46168962121009827},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.435440331697464},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.42616790533065796},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.38715529441833496},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3082512617111206},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.29320091009140015},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.2119891345500946},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1934046447277069},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18897324800491333},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0576900839805603},{"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/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2518148.2518157","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2518148.2518157","pdf_url":null,"source":{"id":"https://openalex.org/S4210187018","display_name":"ACM SIGBED Review","issn_l":"1551-3688","issn":["1551-3688"],"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 SIGBED Review","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.6561","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.6561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.mpi-sws.org/~bbb/papers/pdf/rtss12-wip.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1664327184","https://openalex.org/W2045683962","https://openalex.org/W2105420251","https://openalex.org/W2143006785","https://openalex.org/W2412070033","https://openalex.org/W4255153203"],"related_works":["https://openalex.org/W2038724244","https://openalex.org/W2378280738","https://openalex.org/W159796120","https://openalex.org/W2144237648","https://openalex.org/W1975235870","https://openalex.org/W191281567","https://openalex.org/W1819575592","https://openalex.org/W2997482552","https://openalex.org/W1488917491","https://openalex.org/W3130534369"],"abstract_inverted_index":{"The":[0],"purpose":[1],"of":[2],"real-time":[3,39],"locking":[4],"protocols":[5],"is":[6,19,36,51],"to":[7],"limit":[8],"priority":[9,30],"inversions":[10],"[5],":[11],"which,":[12],"intuitively,":[13],"occur":[14],"when":[15,53],"a":[16,22],"high-priority":[17],"task":[18],"delayed":[20],"by":[21],"lower-priority":[23],"task.":[24],"Such":[25],"locking-related":[26],"delay,":[27],"also":[28],"called":[29],"inversion":[31],"blocking":[32],"(":[33],"pi-blocking":[34,50],"),":[35],"problematic":[37],"in":[38,45],"systems":[40],"because":[41],"it":[42],"can":[43],"result":[44],"deadline":[46],"misses.":[47],"However,":[48],"some":[49],"unavoidable":[52],"using":[54],"locks":[55],"and":[56,61],"thus":[57],"must":[58],"be":[59],"bounded":[60],"accounted":[62],"for":[63],"during":[64],"schedulability":[65],"analysis.":[66]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}