Sciweavers

657 search results - page 58 / 132
» Parallel randomized load balancing
Sort
View
ICS
1998
Tsinghua U.
14 years 1 months ago
Load Execution Latency Reduction
In order to achieve high performance, contemporary microprocessors must effectively process the four major instruction types: ALU, branch, load, and store instructions. This paper...
Bryan Black, Brian Mueller, Stephanie Postal, Ryan...
ICNP
1997
IEEE
14 years 1 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda
SAC
2003
ACM
14 years 2 months ago
Real-Time Monitoring of Large Scientific Simulations
We present a distributed framework that enables real-time streaming and visualization of data generated by large remote simulations. We address issues arising from distributed cli...
Valerio Pascucci, Daniel E. Laney, Ray J. Frank, F...
JDA
2008
100views more  JDA 2008»
13 years 9 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
ICPP
1998
IEEE
14 years 1 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang