Sciweavers

182 search results - page 31 / 37
» Static program transformations for efficient software model ...
Sort
View
HIPC
2007
Springer
15 years 8 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CAL
2010
15 years 1 months ago
SMT-Directory: Efficient Load-Load Ordering for SMT
Memory models like SC, TSO, and PC enforce load-load ordering, requiring that loads from any single thread appear to occur in program order to all other threads. Out-of-order execu...
A. Hilton, A. Roth
ISSTA
2006
ACM
15 years 10 months ago
Improving distributed memory applications testing by message perturbation
We present initial work on perturbation techniques that cause the manifestation of timing-related bugs in distributed memory Message Passing Interface (MPI)-based applications. Th...
Richard W. Vuduc, Martin Schulz, Daniel J. Quinlan...
ECBS
2006
IEEE
158views Hardware» more  ECBS 2006»
15 years 10 months ago
Automated Translation of C/C++ Models into a Synchronous Formalism
For complex systems that are reusing intellectual property components, functional and compositional design correctness are an important part of the design process. Common system l...
Hamoudi Kalla, Jean-Pierre Talpin, David Berner, L...
ISSTA
2004
ACM
15 years 9 months ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer