Detecting race conditions in parallel programs that use one semaphore

DOI10.1007/3-540-57155-8_272MaRDI QIDQ5060138zbMATH OpenOpenAlexFDO

Authors Hsueh-I Lu, Robert H. B. Netzer, Philip N. Klein

Publication date 18 January 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57155-8_272

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Parallel algorithms in computer science (68W10)

Recommendations

• Race-condition detection in parallel computation with semaphores (extended abstract)
• Detecting race conditions in parallel programs that use semaphores
• Synchronization debugging of hybrid parallel programs
• Efficient detection of determinacy races in cilk programs
• Race detection and reachability in nearly series-parallel DAGs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 926535 (Why is no real title available?)
• On strictly optimal schedules for the cumulative cost-optimal scheduling problem
• Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints

Cited in

(4)

• Detecting race conditions in parallel programs that use semaphores
• Synchronization debugging of hybrid parallel programs
• scientific article; zbMATH DE number 1755936 (Why is no real title available?)
• Race-condition detection in parallel computation with semaphores (extended abstract)

This page was built for publication: Detecting race conditions in parallel programs that use one semaphore

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060138)