Parallel Algorithms: Third DIMACS Implementation Challenge, October 17-19, 1994
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
adjacency matrix applications B&B algorithm Barnes-Hut Barnes-Hut algorithm best-first cells chess program Cilk cluster coarse-grain program Computer Chess Computer Science concurrent write operations connected components algorithms data structure dense graphs DIMACS dimensions distributed memory edge list efficient execution Figure finding connected components fine-grain program game tree global phase graph algorithms grid hash table implementation input points interactions Jamboree search kd-tree label d(u load balancing MasPar mesh multipole negamax number of edges number of nodes number of processors optimal parallel algorithms parallel computer parallel programs parent partial locking particle performance physical processor planar PMTA pointer doubling pointer jumping PRAM algorithm priority queues problem Proc random graphs reduce remote edges rooted star running scheduler search algorithm sequential algorithms serial shortest-paths Socrates sparse graphs speedup StarTech Subsection techniques tertiary graphs thread total number transposition table treap tree loop tree search update vertex vertices