Sciweavers

1929 search results - page 88 / 386
» Load Balancing with Memory
Sort
View
ANCS
2005
ACM
15 years 8 months ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley
131
Voted
IJPP
2010
156views more  IJPP 2010»
14 years 11 months ago
ForestGOMP: An Efficient OpenMP Environment for NUMA Architectures
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
François Broquedis, Nathalie Furmento, Bric...
127
Voted
IEEEPACT
2005
IEEE
15 years 8 months ago
Communication Optimizations for Fine-Grained UPC Applications
Global address space languages like UPC exhibit high performance and portability on a broad class of shared and distributed memory parallel architectures. The most scalable applic...
Wei-Yu Chen, Costin Iancu, Katherine A. Yelick
120
Voted
ISSS
1996
IEEE
114views Hardware» more  ISSS 1996»
15 years 6 months ago
Flow Graph Balancing for Minimizing the Required Memory Bandwidth
In this paper we present the problem of flow graph balancing for minimizingthe required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cy...
Sven Wuytack, Francky Catthoor, Gjalt G. de Jong, ...
119
Voted
HPDC
1999
IEEE
15 years 6 months ago
PARED: A Framework for the Adaptive Solution of PDEs
We describe our experience using PARED, an object oriented system for the adaptive solution of PDEs in a distributed computing environment. PARED handles selective mesh refinement...
José G. Castaños, John E. Savage