Publication details
Parallel Search Made Simple
Christian Schulte
Technical Report, School of Computing, National University of Singapore, 55 Science Drive 2, Singapore 117599, To appear., September 2000
Search in constraint programming is a time consuming task. Search can be speeded up by exploring subtrees of a search tree
in parallel. This paper presents distributed search engines
that achieve parallelism by distribution across networked
computers. The main point of the paper is a simple design of
the parallel search engine. Simplicity comes as an immediate
consequence of clearly separating search, concurrency, and
distribution. The obtained distributed search engines are
simple yet offer substantial speedup on standard network
computers.
Download PDF
Show BibTeX
@TECHREPORT{TRICS:00,
title = {Parallel Search Made Simple},
author = {Christian Schulte},
year = {2000},
month = {sep},
number = {"TRA9/00"},
type = {"Technical Report"},
address = {"55 Science Drive 2, Singapore 117599"},
institution = {"School of Computing, National University of Singapore"},
note = {"To appear."},
}
Login to edit
Legal notice, Privacy policy
