Parallel algorithms : third DIMACS implementation challenge, October 17-19, 1994 /

Gorde:
Xehetasun bibliografikoak
Egile korporatiboa: DIMACS (Group), Challenge Workshop
Beste egile batzuk: Bhatt, Sandeep Nautam
Formatua: Conference Proceeding Liburua
Hizkuntza:English
Argitaratua: Providence, R.I. : American Mathematical Society, c1997.
Saila:DIMACS series in discrete mathematics and theoretical computer science ; v. 30.
Gaiak:
Aurkibidea:
  • Connected components on distributed memory machines / Arvind Krishnamurthy, Steven S. Lumetta and David E. Culler [et al.]
  • Parallel implementation of algorithms for finding connected components in graphs / Tsan-Sheng Hsu, Vijaya Ramachandran and Nathaniel Dean
  • Connected components algorithms for mesh-connected parallel computers / Steve Goddard, Subodh Kumar and Jan F. Prins
  • Implementing parallel shortest-paths algorithms / Marios Papaefthymiou and Joseph Rodrigue
  • Finding friends-of-friends clusters quickly / Brendan Mumey
  • A practical comparison of N-body algorithms / Guy Blelloch and Girija Narlikar
  • Parallel algorithms for geometric dominance problems / Jan Petersson
  • The *Socrates massively parallel chess program / Christopher F. Joerg and Bradley C. Kuszmaul
  • Concurrent data structures and load balancing strategies for parallel branch-and-bound/A* algorithms / V.-D. Cung, S. Dowaji and B. Le Cun [et al.].