Sciweavers

4889 search results - page 522 / 978
» A Refactoring Approach to Parallelism
Sort
View
CLUSTER
1999
IEEE
15 years 6 months ago
Simulative performance analysis of gossip failure detection for scalable distributed systems
Three protocols for gossip-based failure detection services in large-scale heterogeneous clusters are analyzed and compared. The basic gossip protocol provides a means by which fai...
Mark W. Burns, Alan D. George, Bradley A. Wallace
MIDDLEWARE
2010
Springer
15 years 5 months ago
Automatically Generating Symbolic Prefetches for Distributed Transactional Memories
Abstract. Developing efficient distributed applications while managing complexity can be challenging. Managing network latency is a key challenge for distributed applications. We ...
Alokika Dash, Brian Demsky
WINET
2010
176views more  WINET 2010»
15 years 5 months ago
An improved mechanism for multiple MBMS sessions assignment in B3G cellular networks
In Universal Mobile Telecommunication System (UMTS), the downlink capacity is limited by the base station transmission power. Therefore, power control plays an important role to mi...
Antonios G. Alexiou, Christos Bouras, Vasileios Ko...
IEEEHPCS
2010
15 years 5 months ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...
IPPS
2010
IEEE
15 years 5 months ago
Using focused regression for accurate time-constrained scaling of scientific applications
Many large-scale clusters now have hundreds of thousands of processors, and processor counts will be over one million within a few years. Computational scientists must scale their ...
Bradley J. Barnes, Jeonifer Garren, David K. Lowen...