Skip to main navigation Skip to search Skip to main content

MEMOCODE 2016 design contest: K-means clustering

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

Abstract

K-means is a clustering algorithm that aims to group data into k similar clusters. The objective of the 2016 MEMOCODE Design Contest is to implement a system to efficiently partition a large set of multidimensional data using k-means. Contestants were given one month to develop a system to perform this operation, aiming to maximize performance or cost-adjusted performance. Teams were encouraged to consider a variety of computational targets including CPUs, FPGAs, and GPGPUs. The winning team, which was invited to contribute a paper describing their techniques, combined careful algorithmic and implementation optimizations using CPUs and GPUs.

Original languageEnglish
Title of host publication2016 ACM/IEEE International Conference on Formal Methods and Models for System Design, MEMOCODE 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages125-127
Number of pages3
ISBN (Electronic)9781509027910
DOIs
StatePublished - Dec 27 2016
Event14th ACM/IEEE International Conference on Formal Methods and Models for System Design, MEMOCODE 2016 - Kanpur, India
Duration: Nov 18 2016Nov 20 2016

Publication series

Name2016 ACM/IEEE International Conference on Formal Methods and Models for System Design, MEMOCODE 2016

Conference

Conference14th ACM/IEEE International Conference on Formal Methods and Models for System Design, MEMOCODE 2016
Country/TerritoryIndia
CityKanpur
Period11/18/1611/20/16

Fingerprint

Dive into the research topics of 'MEMOCODE 2016 design contest: K-means clustering'. Together they form a unique fingerprint.

Cite this