Sciweavers

3206 search results - page 52 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
CLUSTER
2006
IEEE
15 years 2 months ago
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
Jiannong Cao, Alvin T. S. Chan, Yudong Sun, Sajal ...
AMAI
2004
Springer
15 years 7 months ago
Improving Exact Algorithms for MAX-2-SAT
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
Haiou Shen, Hantao Zhang
IPPS
1999
IEEE
15 years 6 months ago
NWCache: Optimizing Disk Accesses via an Optical Network/Write Cache Hybrid
In this paper we propose a simple extension to the I/O architecture of scalable multiprocessors that optimizes page swap-outs significantly. More specifically, we propose the use o...
Enrique V. Carrera, Ricardo Bianchini
PPDP
2010
Springer
15 years 22 days ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
IPTPS
2004
Springer
15 years 7 months ago
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
Moni Naor, Udi Wieder