Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Saikishan Pampana

dblp:278/6137 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 70% Hardware accelerators and domain-specific architectures · 30%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures › machine learning accelerator
clustering accelerator
0.412020
DUAL: Acceleration of Clustering Algorithms using Digital-based Processing In-Memory · MICRO 2020
Memory systems › processing-in-memory › computing-in-memory
digital compute-in-memory
0.412020
DUAL: Acceleration of Clustering Algorithms using Digital-based Processing In-Memory · MICRO 2020
Memory systems
processing-in-memory
0.412020
DUAL: Acceleration of Clustering Algorithms using Digital-based Processing In-Memory · MICRO 2020
Memory systems › random-access memory
crossbar memory
0.112020
DUAL: Acceleration of Clustering Algorithms using Digital-based Processing In-Memory · MICRO 2020

Methods — techniques the papers use, named apart from their topics

unsupervised learning · 0.4clustering · 0.4binary representation · 0.4
YearPublicationVenuePosition
2020 DUAL: Acceleration of Clustering Algorithms using Digital-based Processing In-Memory
abstract
Today's applications generate a large amount of data that need to be processed by learning algorithms. In practice, the majority of the data are not associated with any labels. Unsupervised learning, i.e., clustering methods, are the most commonly used algorithms for data analysis. However, running clustering algorithms on traditional cores results in high energy consumption and slow processing speed due to a large amount of data movement between memory and processing units. In this paper, we propose DUAL, a Digital-based Unsupervised learning AcceLeration, which supports a wide range of popular algorithms on conventional crossbar memory. Instead of working with the original data, DUAL maps all data points into high-dimensional space, replacing complex clustering operations with memory-friendly operations. We accordingly design a PIM-based architecture that supports all essential operations in a highly parallel and scalable way. DUAL supports a wide range of essential operations and enables in-place computations, allowing data points to remain in memory. We have evaluated DUAL on several popular clustering algorithms for a wide range of large-scale datasets. Our evaluation shows that DUAL provides a comparable quality to existing clustering algorithms while using a binary representation and a simplified distance metric. DUAL also provides 58.8× speedup and 251.2× energy efficiency improvement as compared to the state-of-the-art solution running on GPU.
Mohsen Imani, Saikishan Pampana, Saransh Gupta, Minxuan Zhou, Yeseong Kim, Tajana Rosing
MICRO2