Skip to main navigation Skip to search Skip to main content

Parallelization of K-medoid clustering algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

This paper presents an approach for paralleling K-medoid clustering algorithm. The K-medoid algorithm will be divided into tasks, which will be mapped into multiprocessor system. The control structure for the way of expressing the tasks in parallel form and the communication model that satisfied the mechanism for interaction between these tasks is presented. Data parallel model is built by decomposing the tasks among the processors. The implementation and testing of the parallel model have conducted using SESE academic simulator under Fedora 11 version at Linux OS environment.

Original languageEnglish
Title of host publication2013 5th International Conference on Information and Communication Technology for the Muslim World, ICT4M 2013
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 5th International Conference on Information and Communication Technology for the Muslim World, ICT4M 2013 - Rabat, Morocco
Duration: 26 Mar 201327 Mar 2013

Publication series

Name2013 5th International Conference on Information and Communication Technology for the Muslim World, ICT4M 2013

Conference

Conference2013 5th International Conference on Information and Communication Technology for the Muslim World, ICT4M 2013
Country/TerritoryMorocco
CityRabat
Period26/03/1327/03/13

Keywords

  • Data parallel model
  • K-medoid
  • Parallel model
  • SIMD

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Fingerprint

Dive into the research topics of 'Parallelization of K-medoid clustering algorithm'. Together they form a unique fingerprint.

Cite this