JOURNAL ARTICLE
An efficient clustering algorithm for partitioning parallel programs
Year: 1998 Journal: Parallel Computing Vol: 24 (5-6)Pages: 893-909 Publisher: Elsevier BV
Keywords:
MIMD Computer science Parallel computing Parallelism (grammar) Cluster analysis Computation Multiprocessing Set (abstract data type) Parallel algorithm Directed acyclic graph Tree (set theory) Transitive closure Node (physics) Algorithm Path (computing) Mathematics Combinatorics
Metrics
5
Cited By
0.89
FWCI (Field Weighted Citation Impact)
10
Refs
0.75
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
VLSI and FPGA Design Techniques
Physical Sciences → Engineering → Electrical and Electronic Engineering
Interconnection Networks and Systems
Physical Sciences → Computer Science → Computer Networks and Communications
Parallel Computing and Optimization Techniques
Physical Sciences → Computer Science → Hardware and Architecture
Related Documents
JOURNAL ARTICLE
An Efficient Data Partitioning Method Based Cell Partitioning Parallel Hierarchical Agglomerative Clustering
Journal: The Journal of Korean Institute of Communications and Information Sciences Year: 2019 Vol: 44 (11)Pages: 2167-2173
JOURNAL ARTICLE
An Efficient Clustering-Based Task Scheduling Algorithm for Parallel Programs with Task Duplication *
Year: 2007 Vol: 23 (2)Pages: 589-604
BOOK-CHAPTER
Parallel Unsupervised k-Windows: An Efficient Parallel Clustering Algorithm
Dimitris K. TasoulisPanagiotis D. AlevizosBasilis BoutsinasMichael N. Vrahatis
Lecture notes in computer science Year: 2003 Pages: 336-344
JOURNAL ARTICLE
An efficient parallel direction-based clustering algorithm
Kai ZhongXu ZhouLiqian ZhouZhibang YangChubo LiuNa Xiao
Journal: Journal of Parallel and Distributed Computing Year: 2020 Vol: 145 Pages: 24-33
JOURNAL ARTICLE
An efficient k-means clustering algorithm using simple partitioning
Ming-Chuan HungJungpin WuJin-Hua ChangDon‐Lin Yang
Journal: Journal of information science and engineering Year: 2005 Vol: 21 (6)Pages: 1157-1177