![DSpace logo](/jspui/image/logo.gif)
Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/8113
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Goyal, Navneet | - |
dc.contributor.author | Goyal, Poonam | - |
dc.date.accessioned | 2022-12-26T06:13:23Z | - |
dc.date.available | 2022-12-26T06:13:23Z | - |
dc.date.issued | 2019-10 | - |
dc.identifier.uri | https://ieeexplore.ieee.org/document/8964223 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8113 | - |
dc.description.abstract | Big Data has significantly increased the dependence of data analytics community on High Performance Computing (HPC) systems. However, efficiently programming an HPC system is still a tedious task requiring specialized skills in parallelization and the use of platform-specific languages as well as mechanisms. We present a framework for quickly prototyping new/existing density-based clustering algorithms while obtaining low running times and high speedups via automatic parallelization. The user is required only to specify the sequential algorithm in a Domain Specific Language (DSL) for clustering at a very high level of abstraction. The parallelizing compiler for the DSL does the rest to leverage distributed systems - in particular, typical scale-out clusters made of commodity hardware. Our approach is based on recurring, parallelizable programming patterns known as Kernels, which are identified and parallelized by the compiler. We demonstrate the ease of programming and scalable performance for DBSCAN, SNN, and RECOME algorithms. We also establish that the proposed approach can achieve performance comparable to state-of-the-art manually parallelized implementations while requiring minimal programming effort that is several orders of magnitude smaller than those required on other parallel platforms like MPI/Spark. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Big Data | en_US |
dc.subject | Prototyping Approach | en_US |
dc.subject | Density-Based Clustering | en_US |
dc.subject | HPC | en_US |
dc.title | A Rapid Prototyping Approach for High Performance Density-Based Clustering | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.