Stanford Seminar - Generalized Reversible Computing and the Unconventional Computing Landscape
Stanford Online2 HN recommenders · 2020–2021
16K views · lecture · evergreen · Uploaded 2017-10-19
A Stanford EE380 seminar by Michael P. Frank of Sandia National Laboratories on generalized reversible computing. It surveys unconventional computing approaches as transistor scaling nears its limits and energy efficiency stops improving.
HN commenters cite it as an informative talk from a leading researcher in reversible computing, mainly in threads on reversible computers and energy efficiency.
1:01:20Indistinguishable From Magic: Manufacturing Modern Computer Chips
Andor Gafotas
6:538-bit computer update
Ben Eater
1:21:22Light Years Ahead | The 1969 Apollo Guidance Computer
TNMoC
27:25“Hello, world” from scratch on a 6502 — Part 1
Ben Eater
47:52Finding the Missing Memristor - R. Stanley Williams
The Qualcomm Institute
1:01:07The Ultimate Game Boy Talk (33c3)
media.ccc.de
1:48:55The Thirty Million Line Problem
Molly Rocket
1:06:20USENIX ATC '21/OSDI '21 Joint Keynote Address-It's Time for Operating Systems to Rediscover Hardware
USENIX
3 comments from Hacker News
I think Michael P Frank is one of the more knowledgable people working on the subject, his Stanford talk is extremely informative ... [VIDEO]
For anyone interested in the topic I highly recommend checking out Dr. Michael P. Frank's work. This video is good one to start with [VIDEO]
According to [Michael Frank's video]( [VIDEO] ), there is an architectural overhead of ~500x that people can not get over (IIUC, this overhead only applies for gate based computing models). A reasonable gap between state-of-the-art gate based computing models and Landauer's limit should be 10^2-10^3. On the other side, reversible computing in general has 2-16 times computational overhead at the software level from my using experience. To save energy, reversible computing has to be at least ~10x more energy efficient at the instruction level.