Keywords
Computer scienceParallel computingCluster analysisSpeedupAlgorithmSet (abstract data type)IBMParallel algorithmExploitNode (physics)Parallelism (grammar)Message passingProgramming language
Affiliated Institutions
Related Publications
Actors: A Model of Concurrent Computation in Distributed Systems
A foundational model of concurrency is developed in this thesis. It examines issues in the design of parallel systems and show why the actor model is suitable for exploiting lar...
Communication and Memory Efficient Parallel Decision Tree Construction
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2003 SIAM International Conference on Data Mining (SDM)Communication and Memory Efficient Parallel Decisi...
Preliminary results in accelerating profile HMM search on FPGAs
Comparison between biosequences and probabilistic models is an increasingly important part of modern DNA and protein sequence analysis. The large and growing number of such mode...
VSEARCH: a versatile open source tool for metagenomics
Background VSEARCH is an open source and free of charge multithreaded 64-bit tool for processing and preparing metagenomics, genomics and population genomics nucleotide sequence...
ParAlign: a parallel sequence alignment algorithm for rapid and sensitive database searches
There is a need for faster and more sensitive algorithms for sequence similarity searching in view of the rapidly increasing amounts of genomic sequence data available. Parallel...
Publication Info
- Year
- 2002
- Type
- book-chapter
- Pages
- 245-260
- Citations
- 386
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
386
OpenAlex
Cite This
Inderjit S. Dhillon,
Dharmendra S. Modha
(2002).
A Data-Clustering Algorithm on Distributed Memory Multiprocessors.
Lecture notes in computer science
, 245-260.
https://doi.org/10.1007/3-540-46502-2_13
Identifiers
- DOI
- 10.1007/3-540-46502-2_13