New Titles  |  FAQ  |  Keep Informed  |  Review Cart  |  Contact Us Quick Search (Advanced Search ) Browse by Subject General Interest Logic & Foundations Number Theory Algebra & Algebraic Geometry Discrete Math & Combinatorics Analysis Differential Equations Geometry & Topology Probability & Statistics Applications Mathematical Physics Math Education

Parallel Algorithms
Edited by: Sandeep N. Bhatt, Bell Communications Research, Morristown, NJ
A co-publication of the AMS and DIMACS.
 SEARCH THIS BOOK:
DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
1997; 162 pp; hardcover
Volume: 30
ISBN-10: 0-8218-0447-2
ISBN-13: 978-0-8218-0447-6
List Price: US$54 Member Price: US$43.20
Order Code: DIMACS/30

This volume is the result of the Third DIMACS Implementation Challenge that was conducted as part of the 1993-1994 Special Year on Parallel Algorithms. The Implementation Challenge was formulated in order to provide a forum for a concerted effort to study effective algorithms for combinatorial problems and to investigate opportunities for massive speedups on parallel computers. The challenge included two problem areas for research study: tree searching algorithms, used in game search and combinatorial optimization, for example, and algorithms for sparse graphs.

Participants at sites in the U.S. and Europe undertook projects from November 1993 through October 1994. The workshop was held at DIMACS in November 1994. Participants were encouraged to share test results, to rework their implementations considering feedback at the workshop, and to submit a final report for the proceedings. Nine papers were selected for this volume.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).

Graduate students and research mathematicians interested in computer science.

• A. Krishnamurthy, S. S. Lumetta, D. E. Culler, and K. Yelick -- Connected components on distributed memory machines
• T.-S. Hsu, V. Ramachandran, and N. Dean -- Parallel implementation of algorithms for finding connected components in graphs
• S. Goddard, S. Kumar, and J. F. Prins -- Connected components algorithms for mesh-connected parallel computers
• M. Papaefthymiou and J. Rodrigue -- Implementing parallel shortest-paths algorithms
• B. Mumey -- Finding friends-of-friends clusters quickly
• G. Blelloch and G. Narlikar -- A practical comparison of $$N$$-body algorithms
• J. Petersson -- Parallel algorithms for geometric dominance problems
• C. F. Joerg and B. C. Kuszmaul -- The $$\star$$Socrates massively parallel chess program
• V.-D. Cung, S. Dowaji, B. LeCun, T. Mautor, and C. Roucairol -- Concurrent data structures and load balancing strategies for parallel branch-and-bound/A$$^\ast$$ algorithms