Sciweavers

140 search results - page 27 / 28
» On Reducing False Sharing while Improving Locality on Shared...
Sort
View
SPAA
1995
ACM
13 years 8 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
CCGRID
2003
IEEE
13 years 10 months ago
Discretionary Caching for I/O on Clusters
I/O bottlenecks are already a problem in many largescale applications that manipulate huge datasets. This problem is expected to get worse as applications get larger, and the I/O ...
Murali Vilayannur, Anand Sivasubramaniam, Mahmut T...
ISORC
2000
IEEE
13 years 9 months ago
TCP Throughput and Buffer Management
There have been many debates about the feasibility of providing guaranteed Quality of Service (QoS) when network traffic travels beyond the enterprise domain and into the vast unk...
Todd Lizambri, Fernando Duran, Shukri Wakid
MICRO
2009
IEEE
121views Hardware» more  MICRO 2009»
13 years 11 months ago
Application-aware prioritization mechanisms for on-chip networks
Network-on-Chips (NoCs) are likely to become a critical shared resource in future many-core processors. The challenge is to develop policies and mechanisms that enable multiple ap...
Reetuparna Das, Onur Mutlu, Thomas Moscibroda, Chi...
SASO
2009
IEEE
13 years 12 months ago
Distributed W-Learning: Multi-Policy Optimization in Self-Organizing Systems
—Large-scale agent-based systems are required to self-optimize towards multiple, potentially conflicting, policies of varying spatial and temporal scope. As a result, not all ag...
Ivana Dusparic, Vinny Cahill