Back to Results
First PageMeta Content
Computational complexity theory / Message Passing Interface / Speedup / Algorithm / Hamiltonian path / Time complexity / Bulk synchronous parallel / Parallel algorithm / Parallel Random Access Machine / Theoretical computer science / Parallel computing / Computing


Finding Hamiltonian Paths in Tournaments on Clusters - A Provably Communication-Efficient Approach Chun-Hsi Huang Xin He
Add to Reading List

Document Date: 2004-02-16 16:47:53

Open Document

File Size: 98,06 KB

Share Result on Facebook

City

London / New York / /

Company

ACM Las Vegas NV / Cambridge University Press / Lasa Vegas NV / Goodrich / McGraw-Hill / /

Currency

pence / USD / /

/

Facility

State University of New York / Engineering State University of New York / /

IndustryTerm

parallel computing problems / interconnection network / parallel computing / divide-andconquer algorithm / lowlatency interconnection network / individual processor / sequential algorithm / parallel computing platforms / possible sequential algorithms / linear-time algorithm / parallel algorithm / graph algorithms / interconnection media / p-processor / final destination processor / communication media / /

OperatingSystem

Linux / Irix / /

Organization

Cambridge University / State University of New York at Buffalo / Provably Communication-Efficient Approach Chun-Hsi Huang Xin He Department of Computer Science / Department of Computer Science / /

Person

Coarse Grained Multicomputer / Peter S. Pacheco / Michael T. Goodrich / Morgan Kaufmann / Chun-Hsi Huang Xin / /

/

Position

Bridging Model for Parallel Computation / general-purpose model / player / /

ProvinceOrState

New York / /

PublishedMedium

Communications of the ACM / Theory of Computing / /

Technology

destination processors / graph algorithms / ethernet / possible sequential algorithms / main algorithm / Parallel Geometric Algorithms / sequential algorithm / 1 processors / final destination processor / Linux / two processors / 2000 Algorithm / divide-andconquer algorithm / 1 algorithm / parallel algorithm / BSP algorithm / individual processor / 5 processors / existing sequential algorithm / operating system / 32 processors / 32 R10000 processors / Parallel Numerical Algorithms / shared memory / Assume BSP processors / CGM algorithm / existing linear-time algorithm / then carried out using existing sequential algorithm / /

SocialTag