Skip to main content
Conference ProceedingsOPEN ACCESS

Implementing scalable parallel search algorithms for data-intensive applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2329 LNCS(PART 1) 592-602
DOI: 10.1007/3-540-46043-8_60
1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2002 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ladányi, L., Ralphs, T. K., & Saltzman, M. J. (2002). Implementing scalable parallel search algorithms for data-intensive applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2329 LNCS, pp. 592–602). Springer Verlag. https://doi.org/10.1007/3-540-46043-8_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free