Sciweavers

87 search results - page 3 / 18
» On Optimal Deadlock Detection Scheduling
Sort
View
IPPS
2010
IEEE
13 years 3 months ago
Handling errors in parallel programs based on happens before relations
Abstract--Intervals are a new model for parallel programming based on an explicit happens before relation. Intervals permit fine-grained but high-level control of the program sched...
Nicholas D. Matsakis, Thomas R. Gross
ASPLOS
2010
ACM
14 years 15 days ago
A randomized scheduler with probabilistic guarantees of finding bugs
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
Sebastian Burckhardt, Pravesh Kothari, Madanlal Mu...
IPSN
2005
Springer
13 years 11 months ago
Towards optimal sleep scheduling in sensor networks for rare-event detection
— Lifetime maximization is one key element in the design of sensor-network-based surveillance applications. We propose a protocol for node sleep scheduling that guarantees a boun...
Qing Cao, Tarek F. Abdelzaher, Tian He, John A. St...
ECOOP
2004
Springer
13 years 11 months ago
Increasing Concurrency in Databases Using Program Analysis
Programmers have come to expect better integration between databases and the programming languages they use. While this trend continues unabated, database concurrency scheduling ha...
Roman Vitenberg, Kristian Kvilekval, Ambuj K. Sing...