Results 1 
4 of
4
Blocking for external graph searching
 IN PROC. ACM PODS CONFERENCE (PODS93
, 1993
"... In this paper, we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented any number of times on the disk in order to take advantage of redundancy. We give matching upper and lower bounds for ..."
Abstract

Cited by 43 (4 self)
 Add to MetaCart
(Show Context)
In this paper, we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented any number of times on the disk in order to take advantage of redundancy. We give matching upper and lower bounds for complete dary trees and ddimensional grid graphs, as well as for classes of general graphs that intuitively speaking have a close to uniform number of neighbors around each vertex. We also show that for the special case of grid graphs blocked with isothetic hypercubes, there is a provably better speedup if even a small amount of redundancy is permitted.
Relative Complexity of Algebras
, 1981
"... A simple algebraic model is proposed fr measuring the relative complexity of programming systems. The appropriateness of this model is illustrated by its use as a framework for the statement and proof of results dealing with codingindependent limitations on the relative complexity of basic alge ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A simple algebraic model is proposed fr measuring the relative complexity of programming systems. The appropriateness of this model is illustrated by its use as a framework for the statement and proof of results dealing with codingindependent limitations on the relative complexity of basic algebras.
On the Implementation of Kernel Numerical Algorithms for Computational Fluid Dynamics on Hypercubes
, 1986
"... We discuss some issues that arise in the implementation of numerical algorithms for computational fluid dynamics (CFD) on multiprocessor systems such as hypercubes. We identify several important kernel numerical algorithms from CFD that map well onto the hypercube architecture. We emphasize the i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We discuss some issues that arise in the implementation of numerical algorithms for computational fluid dynamics (CFD) on multiprocessor systems such as hypercubes. We identify several important kernel numerical algorithms from CFD that map well onto the hypercube architecture. We emphasize the importance of considering the optimal mapping for a collection of kernel algorithms used in an application program rather than just on individual optimal mappings. Several examples illustrating the tradeoffs between rearranging data to fit a particular kernel algorithm and using suboptimal mappings will be discussed.
Systems Theory Relative Complexity of Algebras
"... Abstract. A simple algebraic model is proposed for measuring the relative complexity of programming systems. The appropriateness of this model is illustrated by its use as a framework for the statement and proof of results dealing with codingindependent limitations on the relative complexity of bas ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. A simple algebraic model is proposed for measuring the relative complexity of programming systems. The appropriateness of this model is illustrated by its use as a framework for the statement and proof of results dealing with codingindependent limitations on the relative complexity of basic algebras. I.