Sciweavers

50 search results - page 8 / 10
» Producing scheduling that causes concurrent programs to fail
Sort
View
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
13 years 11 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
SC
1992
ACM
13 years 9 months ago
Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs
A common debugging strategy involves reexecuting a program (on a given input) over and over, each time gaining more information about bugs. Such techniques can fail on message-pas...
Robert H. B. Netzer, Barton P. Miller
PLDI
2009
ACM
14 years 17 days ago
LiteRace: effective sampling for lightweight data-race detection
Data races are one of the most common and subtle causes of pernicious concurrency bugs. Static techniques for preventing data races are overly conservative and do not scale well t...
Daniel Marino, Madanlal Musuvathi, Satish Narayana...
POPL
2012
ACM
12 years 1 months ago
Sound predictive race detection in polynomial time
Data races are among the most reliable indicators of programming errors in concurrent software. For at least two decades, Lamport’s happens-before (HB) relation has served as th...
Yannis Smaragdakis, Jacob Evans, Caitlin Sadowski,...
POPL
2004
ACM
14 years 6 months ago
Atomizer: a dynamic atomicity checker for multithreaded programs
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on det...
Cormac Flanagan, Stephen N. Freund