Skip to search formSkip to main contentSkip to account menu

Out-of-core algorithm

Known as: External memory algorithm, I/O algorithm, Out-of-core 
Out-of-core or external memory algorithms are algorithms that are designed to process data that is too large to fit into a computer's main memory at… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Auxiliary memoryCentral processing unitDigital elevation modelDigital signal processing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Automatic synthesis of out-of-core algorithms
We present a system for the automatic synthesis of efficient algorithms specialized for a particular memory hierarchy and a set… 
2010
2010
The Minimal Bounding Volume Hierarchy
Bounding volume hierarchies (BVH) are a commonly used method for speeding up ray tracing. Even though the memory footprint of a… 
2008
2008
Solving large complex problems using a higher-order basis: parallel in-core and out-of-core integral-equation solvers
The future of computational electromagnetics is changing drastically with the new generation of computer chips, which are multi… 
Highly Cited
2004
Highly Cited
2004
Engineering an External Memory Minimum Spanning Tree Algorithm
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than… 
2004
2004
Acquisition, modelling and rendering of very large urban environments
We describe a vehicle borne data acquisition system for urban environments and associated 3D data management and interactive… 
1999
1999
Efficient Methods for Out-of-Core Sparse Cholesky Factorization
We consider the problem of sparse Cholesky factorization with limited main memory. The goal is to efficiently factor matrices… 
Highly Cited
1999
Highly Cited
1999
Real-time visualization of scalably large collections of heterogeneous objects
This paper presents results for real-time visualization of out-of-core collections of 3D objects. This is a significant extension… 
1991
1991
A program system for ab initio MO calculations on vector and parallel processing machines III. Integral reordering and four-index transformation
1988
1988
Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
This paper describes a new implementation of algorithms for solving large, dense symmetric eigen-problems <italic>AX</italic… 
1974
1974
Large capacity equation solver for structural analysis
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)