Sciweavers

1259 search results - page 89 / 252
» The load rebalancing problem
Sort
View
SPAA
1994
ACM
14 years 1 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
IWAN
2000
Springer
14 years 16 days ago
Active Networking Means Evolution (or Enhanced Extensibility Required)
The primary goal of active networking is to increase the pace of network evolution. The approach to achieving this goal, as well as the goal of enhancing customizability, is to al...
Michael W. Hicks, Scott Nettles
EUROPAR
2008
Springer
13 years 10 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler
JVM
2004
133views Education» more  JVM 2004»
13 years 10 months ago
Towards Virtual Networks for Virtual Machine Grid Computing
Virtual machines can greatly simplify wide-area discomputing by lowering the level of abstraction to the benefit of both resource providers and users. Networking, however, can be ...
Ananth I. Sundararaj, Peter A. Dinda
EAAI
2006
123views more  EAAI 2006»
13 years 9 months ago
Applications of artificial intelligence for optimization of compressor scheduling
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...
Hanh H. Nguyen, Christine W. Chan