Sciweavers

3206 search results - page 101 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
132
Voted
CCE
2004
15 years 2 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
PSTV
1992
113views Hardware» more  PSTV 1992»
15 years 3 months ago
Coverage Preserving Reduction Strategies for Reachability Analysis
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
Gerard J. Holzmann, Patrice Godefroid, Didier Piro...
114
Voted
CLUSTER
2006
IEEE
15 years 8 months ago
Designing High Performance and Scalable MPI Intra-node Communication Support for Clusters
As new processor and memory architectures advance, clusters start to be built from larger SMP systems, which makes MPI intra-node communication a critical issue in high performanc...
Lei Chai, Albert Hartono, Dhabaleswar K. Panda
130
Voted
ICPP
2003
IEEE
15 years 8 months ago
A Hardware-based Cache Pollution Filtering Mechanism for Aggressive Prefetches
Aggressive hardware-based and software-based prefetch algorithms for hiding memory access latencies were proposed to bridge the gap of the expanding speed disparity between proces...
Xiaotong Zhuang, Hsien-Hsin S. Lee
DEXA
2001
Springer
151views Database» more  DEXA 2001»
15 years 7 months ago
Cache Conscious Clustering C3
The two main techniques of improving I/O performance of Object Oriented Database Management Systems(OODBMS) are clustering and buffer replacement. Clustering is the placement of o...
Zhen He, Alonso Marquez