Parallel Algorithms: Third DIMACS Implementation Challenge, October 17-19, 1994

Sandeep Nautam Bhatt
American Mathematical Soc., 1. jan. 1997 - 162 sider
This volume is the result of the Third DIMACS Implementation Challenge that was conducted as part of the 1993-94 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 speed-ups on parallel computers. The challenge invluded 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 US 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.

Hva folk mener - Skriv en omtale

Vi har ikke funnet noen omtaler på noen av de vanlige stedene.


Parallel implementation of algorithms for finding connected components
Connected components algorithms for meshconnected parallel computers
Implementing parallel shortestpaths algorithms
A practical comparison of TVbody algorithms
Parallel algorithms for geometric dominance problems
The Socrates massively parallel chess program
Concurrent data structures and load balancing strategies for parallel

Andre utgaver - Vis alle

Vanlige uttrykk og setninger

Bibliografisk informasjon