Parallelising k-means clustering on distributed memory MIMD computers

J. A. Elliott, M. E. Forsyth, F. R. McInnes, N. W. Ramsey

Two strategies are presented for the parallelisation of the k-means clustering algorithm on MIMD distributed-memory computers (multicomputers). The implementations are decribed in detail The advantages of each outlined.

Keywords: Speech recognition, VQ Codebook, k-means clustering, parallel processing

doi: 10.21437/Eurospeech.1993-366

Cite as: Elliott, J.A., Forsyth, M.E., McInnes, F.R., Ramsey, N.W. (1993) Parallelising k-means clustering on distributed memory MIMD computers. Proc. 3rd European Conference on Speech Communication and Technology (Eurospeech 1993), 1627-1630, doi: 10.21437/Eurospeech.1993-366

@inproceedings{elliott93_eurospeech,
  author={J. A. Elliott and M. E. Forsyth and F. R. McInnes and N. W. Ramsey},
  title={{Parallelising k-means clustering on distributed memory MIMD computers}},
  year=1993,
  booktitle={Proc. 3rd European Conference on Speech Communication and Technology (Eurospeech 1993)},
  pages={1627--1630},
  doi={10.21437/Eurospeech.1993-366}
}