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

Punyashloka Debashis

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

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

Applied, interdisciplinary, general and emerging computing · 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
Emerging computing paradigms · 88% Memory systems · 12%

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

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › approximate and stochastic computing
probabilistic computing
0.412020
From Charge to Spin and Spin to Charge: Stochastic Magnets for Probabilistic Switching · Proc. IEEE 2020
Emerging computing paradigms › approximate and stochastic computing
stochastic computing
0.412020
From Charge to Spin and Spin to Charge: Stochastic Magnets for Probabilistic Switching · Proc. IEEE 2020
Emerging computing paradigms › beyond-CMOS computing
beyond-CMOS devices
0.112020
From Charge to Spin and Spin to Charge: Stochastic Magnets for Probabilistic Switching · Proc. IEEE 2020
Memory systems › non-volatile memory
magnetic tunnel junction
0.112020
From Charge to Spin and Spin to Charge: Stochastic Magnets for Probabilistic Switching · Proc. IEEE 2020

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

nanomagnet stochasticity · 0.4
YearPublicationVenuePosition
2020 From Charge to Spin and Spin to Charge: Stochastic Magnets for Probabilistic Switching
abstract
As the rapid pace of Moore's Law has been slowing down, there has been intense activity to “reinvent the transistor.” An emerging paradigm is to complement the existing complementary metal-oxide-semiconductor (CMOS) technology with new functionalities, rather than finding a drop-in replacement for it. In this article, we discuss such a complementary approach that we call probabilistic spin logic (PSL) based on the concept of a probabilistic or p-bit. p-bits fluctuate between 0 and 1 and can be imagined in between deterministic bits that are either 0 or 1 and quantum bits that are a superposition of 0 and 1. Interconnected circuits built out of p-bits (p-circuits) can be broadly useful for machine learning and quantum computing in the solution of problems that conventional CMOS may not be particularly suited for. Although such p-bits can be implemented using standard CMOS technology, we will show that the inherent physics of nanomagnets can naturally provide an energy efficient and scalable p-bit implementation through the use of low-barrier magnetic tunnel junctions (MTJs). In this article, we provide a general description of p-bits and p-circuits and discuss their applications. We review experimental progress toward constructing p-bits and p-circuits exploiting the inherent stochasticity of nanomagnets, from a physics/device/circuits perspective. In particular, we identify building blocks for “write” and “read” operations that can be used in different combinations to construct functional p-bits and p-circuits. Finally, we discuss the prospects and challenges of PSL as an emerging, unconventional computing paradigm for a beyond CMOS era.
Kerem Yunus Çamsari, Punyashloka Debashis, Vaibhav Ostwal, Ahmed Zeeshan Pervaiz, Tingting Shen, Supriyo Datta, Jörg Appenzeller
Proc. IEEE2