Sciweavers

5448 search results - page 820 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
PPOPP
2010
ACM
15 years 5 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...
SOSP
2005
ACM
16 years 3 months ago
Implementing declarative overlays
Overlay networks are used today in a variety of distributed systems ranging from file-sharing and storage systems to communication infrastructures. However, designing, building a...
Boon Thau Loo, Tyson Condie, Joseph M. Hellerstein...
CLADE
2008
IEEE
16 years 1 months ago
SWARM: a scientific workflow for supporting bayesian approaches to improve metabolic models
With the exponential growth of complete genome sequences, the analysis of these sequences is becoming a powerful approach to build genome-scale metabolic models. These models can ...
Xinghua Shi, Rick Stevens
SPAA
2005
ACM
16 years 6 days ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
AIME
2009
Springer
15 years 10 months ago
Data-Efficient Information-Theoretic Test Selection
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...
Marianne Mueller, Rómer Rosales, Harald Ste...