Sciweavers

3148 search results - page 331 / 630
» On the Dynamic Initialization of Parallel Computers
Sort
View
95
Voted
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
15 years 10 months ago
0/1 Knapsack on Hardware: A Complete Solution
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
K. Nibbelink, S. Rajopadhye, R. McConnell
137
Voted
ESCIENCE
2007
IEEE
15 years 7 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
168
Voted
GRID
2008
Springer
15 years 3 months ago
Replica Placement Strategies in Data Grid
Replication is a technique used in Data Grid environments that helps to reduce access latency and network bandwidth utilization. Replication also increases data availability thereb...
Rashedur M. Rahman, Ken Barker, Reda Alhajj
PPOPP
1999
ACM
15 years 7 months ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
112
Voted
ICPPW
2002
IEEE
15 years 8 months ago
Dynamic Expansion of M : N Protection Groups in GMPLS Optical Networks
Abstract— In order to provide reliable connections across metropolitan and wide-area optical networks, the network operator must provide some degree of redundancy so that traffic...
David W. Griffith, SuKyoung Lee