Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications

Authors:
Laszlo Ladányi;Ted K. Ralphs;M. J. Saltzman
Affiliations:
-;-;-
Venue:
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Year:
2002

Citing 6
Cited 1

Parallel depth first search. Part I. implementation

International Journal of Parallel Programming
Parallel depth first search. Part II. analysis

International Journal of Parallel Programming
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Analyzing scalability of parallel algorithms and architectures

Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Branch, Cut, and Price: Sequential and Parallel

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]

Parallel branch and cut for capacitated vehicle routing

Parallel Computing - Special issue: Parallel computing in logistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scalability is a critical issue in the design of parallel software for large-scale search problems. Previous research has not addressed this issue for data-intensive applications. We describe the design of a library for parallel search that focuses on efficient data and search tree management for such applications in distributed computing environments.