Sciweavers

132 search results - page 18 / 27
» Capsules: Expressing Composable Computations in a Parallel P...
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
Effective performance measurement and analysis of multithreaded applications
Understanding why the performance of a multithreaded program does not improve linearly with the number of cores in a sharedmemory node populated with one or more multicore process...
Nathan R. Tallent, John M. Mellor-Crummey
DCOSS
2005
Springer
14 years 28 days ago
Macro-programming Wireless Sensor Networks Using Kairos
The literature on programming sensor networks has focused so far on g higher-level abstractions for expressing local node behavior. Kairos is a natural next step in sensor network ...
Ramakrishna Gummadi, Omprakash Gnawali, Ramesh Gov...
CONCUR
1999
Springer
13 years 11 months ago
From Synchrony to Asynchrony
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...
Albert Benveniste, Benoît Caillaud, Paul Le ...
JCSS
2008
81views more  JCSS 2008»
13 years 7 months ago
A simulator for adaptive parallel applications
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
DAC
2011
ACM
12 years 7 months ago
Litmus tests for comparing memory consistency models: how long do they need to be?
Memory consistency litmus tests are small parallel programs that are designed to illustrate subtle differences between memory consistency models by exhibiting different outcomes...
Sela Mador-Haim, Rajeev Alur, Milo M. K. Martin