Efficient detection of determinacy races in cilk programs
From MaRDI portal
Publication:1293918
DOI10.1007/s002240000120zbMath0929.68023OpenAlexW1995085071MaRDI QIDQ1293918
Publication date: 29 June 1999
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240000120
Related Items (6)
The complexity of minimizing wire lengths in VLSI layouts ⋮ An equational axiomatization of systolic systems ⋮ Trends in systolic and cellular computation ⋮ Balanced computation of two-dimensional transforms on a tree machine ⋮ An asymptotically optimal layout for the shuffle-exchange graph ⋮ A framework for solving VLSI graph layout problems
This page was built for publication: Efficient detection of determinacy races in cilk programs
