{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:44:10Z","timestamp":1761324250119,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"General Motors"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 1409175, CNS 1563845, CNS 1717589, CPS 1837337, DGS-1650116"],"award-info":[{"award-number":["CNS 1409175, CNS 1563845, CNS 1717589, CPS 1837337, DGS-1650116"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-17-1-0294"],"award-info":[{"award-number":["W911NF-17-1-0294"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3356401.3356404","type":"proceedings-article","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T18:56:15Z","timestamp":1572980175000},"page":"187-197","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Concurrency groups"],"prefix":"10.1145","author":[{"given":"Catherine E.","family":"Nemitz","sequence":"first","affiliation":[{"name":"The University of North Carolina at Chapel Hill"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanya","family":"Amert","sequence":"additional","affiliation":[{"name":"The University of North Carolina at Chapel Hill"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manish","family":"Goyal","sequence":"additional","affiliation":[{"name":"The University of North Carolina at Chapel Hill"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James H.","family":"Anderson","sequence":"additional","affiliation":[{"name":"The University of North Carolina at Chapel Hill"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2019. SchedCAT: Schedulability test collection and toolkit. https:\/\/github.com\/brandenburg\/schedcat. Accessed: 2019-02-07.  2019. SchedCAT: Schedulability test collection and toolkit. https:\/\/github.com\/brandenburg\/schedcat. Accessed: 2019-02-07."},{"volume-title":"IWCMC '09","author":"Bandh T.","key":"e_1_3_2_1_2_1","unstructured":"T. Bandh , G. Carle , and H. Sanneck . 2009. Graph coloring based physical-cell-ID assignment for LTE networks . In IWCMC '09 . T. Bandh, G. Carle, and H. Sanneck. 2009. Graph coloring based physical-cell-ID assignment for LTE networks. In IWCMC '09."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000032574.01332.98"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2007.35"},{"volume-title":"ECRTS '13","author":"Burns A.","key":"e_1_3_2_1_6_1","unstructured":"A. Burns and A. Wellings . 2013. A schedulability compatible multiprocessor resource sharing protocol - MrsP . In ECRTS '13 . A. Burns and A. Wellings. 2013. A schedulability compatible multiprocessor resource sharing protocol - MrsP. In ECRTS '13."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"G. Chaitin M. Auslander A. Chandra J. Cocke M. Hopkins and P. Markstein. 1981. Register allocation via coloring. Computer languages 6 1 (1981).  G. Chaitin M. Auslander A. Chandra J. Cocke M. Hopkins and P. Markstein. 1981. Register allocation via coloring. Computer languages 6 1 (1981).","DOI":"10.1016\/0096-0551(81)90048-5"},{"volume-title":"ECRTS '10","author":"Faggioli D.","key":"e_1_3_2_1_8_1","unstructured":"D. Faggioli , G. Lipari , and T. Cucinotta . 2010. The multiprocessor bandwidth inheritance protocol . In ECRTS '10 . D. Faggioli, G. Lipari, and T. Cucinotta. 2010. The multiprocessor bandwidth inheritance protocol. In ECRTS '10."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"D. Faggioli G. Lipari and T. Cucinotta. 2012. Analysis and implementation of the multiprocessor bandwidth inheritance protocol. Real-Time Systems 48 6 (2012).  D. Faggioli G. Lipari and T. Cucinotta. 2012. Analysis and implementation of the multiprocessor bandwidth inheritance protocol. Real-Time Systems 48 6 (2012).","DOI":"10.1007\/s11241-012-9162-0"},{"volume-title":"Ada-Europe International Conference on Reliable Software Technologies '17","author":"Garrido J.","key":"e_1_3_2_1_10_1","unstructured":"J. Garrido , S. Zhao , A. Burns , and A. Wellings . 2017. Supporting nested resources in MrsP . In Ada-Europe International Conference on Reliable Software Technologies '17 . J. Garrido, S. Zhao, A. Burns, and A. Wellings. 2017. Supporting nested resources in MrsP. In Ada-Europe International Conference on Reliable Software Technologies '17."},{"key":"e_1_3_2_1_11_1","unstructured":"LLC Gurobi Optimization. 2018. Gurobi Optimizer Reference Manual. http:\/\/www.gurobi.com  LLC Gurobi Optimization. 2018. Gurobi Optimizer Reference Manual. http:\/\/www.gurobi.com"},{"key":"e_1_3_2_1_12_1","volume-title":"Avoiding deadlock in multitasking systems. IBM systems journal 7, 2","author":"Havender J.","year":"1968","unstructured":"J. Havender . 1968. Avoiding deadlock in multitasking systems. IBM systems journal 7, 2 ( 1968 ). J. Havender. 1968. Avoiding deadlock in multitasking systems. IBM systems journal 7, 2 (1968)."},{"volume-title":"RTNS '15","author":"Jarrett C.","key":"e_1_3_2_1_13_1","unstructured":"C. Jarrett , B. Ward , and J. Anderson . 2015. A Contention-Sensitive Fine-Grained Locking Protocol for Multiprocessor Real-Time Systems . In RTNS '15 . C. Jarrett, B. Ward, and J. Anderson. 2015. A Contention-Sensitive Fine-Grained Locking Protocol for Multiprocessor Real-Time Systems. In RTNS '15."},{"key":"e_1_3_2_1_14_1","first-page":"1","article-title":"Graph colouring problems and their applications in scheduling","volume":"48","author":"Marx D.","year":"2004","unstructured":"D. Marx . 2004 . Graph colouring problems and their applications in scheduling . Periodica Polytechnica Electrical Engineering 48 , 1 -- 2 (2004). D. Marx. 2004. Graph colouring problems and their applications in scheduling. Periodica Polytechnica Electrical Engineering 48, 1--2 (2004).","journal-title":"Periodica Polytechnica Electrical Engineering"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"volume-title":"ECRTS '18","author":"Nemitz C.","key":"e_1_3_2_1_16_1","unstructured":"C. Nemitz , T. Amert , and J. Anderson . 2018. Using Lock Servers to Scale Real-Time Locking Protocols: Chasing Ever-Increasing Core Counts . In ECRTS '18 . C. Nemitz, T. Amert, and J. Anderson. 2018. Using Lock Servers to Scale Real-Time Locking Protocols: Chasing Ever-Increasing Core Counts. In ECRTS '18."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"C. Nemitz T. Amert and J. Anderson. 2019. Real-time multiprocessor locks with nesting: optimizing the common case. Real-Time Systems 55 2 (2019).  C. Nemitz T. Amert and J. Anderson. 2019. Real-time multiprocessor locks with nesting: optimizing the common case. Real-Time Systems 55 2 (2019).","DOI":"10.1007\/s11241-019-09328-w"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3356401.3356404"},{"key":"e_1_3_2_1_19_1","unstructured":"S. Palladino. 2010. Modelling graph coloring with integer linear programming. https:\/\/manas.tech\/blog\/2010\/09\/16\/modelling-graph-coloring-with-integer-linear-programming.html.  S. Palladino. 2010. Modelling graph coloring with integer linear programming. https:\/\/manas.tech\/blog\/2010\/09\/16\/modelling-graph-coloring-with-integer-linear-programming.html."},{"volume-title":"Real-Time Synchronization Protocols for Multiprocessors. In RTSS '88","author":"Rajkumar R.","key":"e_1_3_2_1_20_1","unstructured":"R. Rajkumar , L. Sha , and J. Lehoczky . 1988 . Real-Time Synchronization Protocols for Multiprocessors. In RTSS '88 . R. Rajkumar, L. Sha, and J. Lehoczky. 1988. Real-Time Synchronization Protocols for Multiprocessors. In RTSS '88."},{"volume-title":"RTCSA '95","author":"Takada H.","key":"e_1_3_2_1_21_1","unstructured":"H. Takada and K. Sakamura . 1995. Real-time scalability of nested spin locks . In RTCSA '95 . H. Takada and K. Sakamura. 1995. Real-time scalability of nested spin locks. In RTCSA '95."},{"volume-title":"ECRTS '12","author":"Ward B.","key":"e_1_3_2_1_23_1","unstructured":"B. Ward and J. Anderson . 2012. Supporting nested locking in multiprocessor real-time systems . In ECRTS '12 . B. Ward and J. Anderson. 2012. Supporting nested locking in multiprocessor real-time systems. In ECRTS '12."},{"volume-title":"RTNS '13","author":"Ward B.","key":"e_1_3_2_1_24_1","unstructured":"B. Ward and J. Anderson . 2013. Fine-grained multiprocessor real-time locking with improved blocking . In RTNS '13 . B. Ward and J. Anderson. 2013. Fine-grained multiprocessor real-time locking with improved blocking. In RTNS '13."},{"volume-title":"IPDPS '14","author":"Ward B.","key":"e_1_3_2_1_25_1","unstructured":"B. Ward and J. Anderson . 2014. Multi-resource real-time reader\/writer locks for multiprocessors . In IPDPS '14 . B. Ward and J. Anderson. 2014. Multi-resource real-time reader\/writer locks for multiprocessors. In IPDPS '14."},{"volume-title":"RTSS '14","author":"Wieder A.","key":"e_1_3_2_1_26_1","unstructured":"A. Wieder and B. Brandenburg . 2014. On the complexity of worst-case blocking analysis of nested critical sections . In RTSS '14 . A. Wieder and B. Brandenburg. 2014. On the complexity of worst-case blocking analysis of nested critical sections. In RTSS '14."},{"volume-title":"RTCSA '17","author":"Zhao S.","key":"e_1_3_2_1_27_1","unstructured":"S. Zhao , J. Garrido , A. Burns , and A. Wellings . 2017. New schedulability analysis for MrsP . In RTCSA '17 . S. Zhao, J. Garrido, A. Burns, and A. Wellings. 2017. New schedulability analysis for MrsP. In RTCSA '17."}],"event":{"name":"RTNS 2019: 27th International Conference on Real-Time Networks and Systems","acronym":"RTNS 2019","location":"Toulouse France"},"container-title":["Proceedings of the 27th International Conference on Real-Time Networks and Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3356401.3356404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3356401.3356404","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3356401.3356404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:52Z","timestamp":1750203892000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3356401.3356404"}},"subtitle":["a new way to look at real-time multiprocessor lock nesting"],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":25,"alternative-id":["10.1145\/3356401.3356404","10.1145\/3356401"],"URL":"https:\/\/doi.org\/10.1145\/3356401.3356404","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}