A comparative analysis of parallel disk-based Methods for enumerating implicit graphs

Authors:
Eric Robinson;Daniel Kunkle;Gene Cooperman
Affiliations:
Northeastern University, Boston, MA;Northeastern University, Boston, MA;Northeastern University, Boston, MA
Venue:
Proceedings of the 2007 international workshop on Parallel symbolic computation
Year:
2007

Citing 14
Cited 7

New methods for using Cayley graphs in interconnection networks

Discrete Applied Mathematics - Special double volume: interconnection networks
Model-checking CSP

A classical mind
New sequential and parallel algorithms for generating high dimension Hecke algebras using the condensation technique

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Constructing permutation representations for matrix groups

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Duplicate record elimination in large data files

ACM Transactions on Database Systems (TODS)
Memory-based and disk-based algorithms for very high degree permutation groups

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Frontier search

Journal of the ACM (JACM)
A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Twenty-six moves suffice for Rubik's cube

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
A disk-based parallel implementation for direct condensation of large permutation modules

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Best-first frontier search with delayed duplicate detection

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Structured duplicate detection in external-memory graph search

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Domain-independent structured duplicate detection

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Large-scale parallel breadth-first search

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3

Solving Rubik's Cube: disk is the new RAM

Communications of the ACM - The psychology of security: why do good users make bad decisions?
Harnessing parallel disks to solve Rubik's cube

Journal of Symbolic Computation
Minimizing disk I/O in two-bit breadth-first search

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Roomy: a system for space limited computations

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Fast multiplication of large permutations for disk, flash memory and RAM

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
An efficient programming model for memory-intensive recursive algorithms using parallel disks

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Minimizing writes in parallel external memory search

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and from artificial intelligence. In the field of parallel search, disk-based search has been forced on researchers because the historical growth in the amount of RAM per CPU core has now stopped. Indeed, the current trend toward multi-core CPUs now threatens to take us backwards. This article makes an original contribution to the design of disk-based parallel search algorithms. It presents a survey of disk-based techniques side-by-side, for the first time. This allows researchers to choose from a menu of techniques, and also to create new hybrid algorithms from the building blocks presented here.