Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCatherine E. Nemitz
Person information
- affiliation: Davidson College, NC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c8]Tanya Amert, Catherine E. Nemitz:
Work-in-Progress: Impacts of Critical-Section Granularity When Accessing Shared Resources. RTSS 2023: 439-442- [i1]Georg von der Brüggen, Ian Gray, Catherine E. Nemitz:
Functionally Safe Multi-Core Systems (Dagstuhl Seminar 23341). Dagstuhl Reports 13(8): 71-90 (2023) - 2021
- [b1]Catherine E. Nemitz:
Efficient Synchronization for Real-Time Systems with Nested Resource Access. University of North Carolina, Chapel Hill, USA, 2021 - [j4]Catherine E. Nemitz, Shai Caspin, James H. Anderson, Bryan C. Ward:
Light Reading: Optimizing Reader/Writer Locking for Read-Dominant Real-Time Workloads (Artifact). Dagstuhl Artifacts Ser. 7(1): 03:1-03:3 (2021) - [j3]Catherine E. Nemitz
, Tanya Amert, Manish Goyal, James H. Anderson:
Concurrency groups: a new way to look at real-time multiprocessor lock nesting. Real Time Syst. 57(1-2): 190-226 (2021) - [c7]Catherine E. Nemitz, Shai Caspin, James H. Anderson, Bryan C. Ward:
Light Reading: Optimizing Reader/Writer Locking for Read-Dominant Real-Time Workloads. ECRTS 2021: 6:1-6:22 - [c6]Claire Nord, Shai Caspin, Catherine E. Nemitz, Howard E. Shrobe, Hamed Okhravi, James H. Anderson, Nathan Burow, Bryan C. Ward:
TORTIS: Retry-Free Software Transactional Memory for Real-Time Systems. RTSS 2021: 469-481
2010 – 2019
- 2019
- [j2]Catherine E. Nemitz, Tanya Amert, James H. Anderson:
Real-time multiprocessor locks with nesting: optimizing the common case. Real Time Syst. 55(2): 296-348 (2019) - [c5]Catherine E. Nemitz, Tanya Amert, Manish Goyal, James H. Anderson:
Concurrency groups: a new way to look at real-time multiprocessor lock nesting. RTNS 2019: 187-197 - 2018
- [j1]Catherine E. Nemitz, Tanya Amert, James H. Anderson:
Using Lock Servers to Scale Real-Time Locking Protocols: Chasing Ever-Increasing Core Counts (Artifact). Dagstuhl Artifacts Ser. 4(2): 02:1-02:3 (2018) - [c4]Catherine E. Nemitz, Tanya Amert, James H. Anderson:
Using Lock Servers to Scale Real-Time Locking Protocols: Chasing Ever-Increasing Core Counts. ECRTS 2018: 25:1-25:24 - [c3]Catherine E. Nemitz, James H. Anderson:
Work-in-Progress: Lock-Based Software Transactional Memory for Real-Time Systems. RTSS 2018: 147-150 - 2017
- [c2]Catherine E. Nemitz, Tanya Amert, James H. Anderson:
Real-time multiprocessor locks with nesting: optimizing the common case. RTNS 2017: 38-47 - 2016
- [c1]Catherine E. Nemitz, Kecheng Yang, Ming Yang, Pontus Ekberg, James H. Anderson:
Multiprocessor Real-Time Locking Protocols for Replicated Resources. ECRTS 2016: 50-60
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
