|

The State of Computers and Data-Storage at the End of Moore’s Law #2

This video is a deep dive into the so called “End of Moore’s Law” or when electronic circuits/chips can no longer improve because we reach the atomic size constant of making transistors and other components in a chip. For more detail see Timestamps below

The video is based on a power point presentation and an excel spreadsheet. Both files can be downloaded by following the link below

Click link below to download power point presentation used in video

https://www.hmexperience.dk/wp-content/uploads/2022/11/2_MooresLawPresentation_HMexperienceDK_nov2022R2.pdf

Click link below to download the excel spreadsheet that contains all calculations used in video

https://www.hmexperience.dk/wp-content/uploads/2022/11/CalculationsMooresLaw.xlsx

Timestamps

00:00 Intro

01:10 Definition of Moore’s law

02:13 Moore’s Law and its importance for The Future of Humanity

03:45 The Evidence for Moore’s Law

05:52 Different State-of-the-art ICs/chips

13:39 Context – Ignots and Wafers

17:44 Context – Mono-die chips and Multi-die chips

22:14 Recalculating Moore’s law now including data storing chips

26:25 When will Moore’s Law end?

34:18 1nm tech computational chips will have 1 billion transistors per mm^2 in 2031

36:25 1nm tech data storing chips will have 16,000 billion transistor per mm^3 in 2043

45:30 Comparisons: Data storing chips will be at least 3000X better than human brain per cm^3 in 2043

49:34 Comparisons: Human brain processing is 10,000X more energy efficient than electronic computational chips in 2031 as measured by TFLOPS/Watt

1:01:30 Using optical computational chips to improve energy efficiency

1:02:53 10X improvement of Moore’s law might be possible with better component designs

1:06:15 Conclusions

Constructive criticism will be much appreciated in the comments, like, errors made, ideas for improvement, etc. I read all comments and try to answer all of them.

Thank you very much

Leave a Reply

Your email address will not be published. Required fields are marked *