Logo
  • Home
  • Classes
  • Conveying Computing
  • Exams
  • Fractal Gallery
  • Guides
  • Problem Sets
  • Syllabus

A Deeper Law than Moore’s?

Posted by David Evans on 10 Oct 2011 in News | 2 comments

This article, A deeper law than Moore’s?, in The Economist, 10 October 2011, reports on an analysis that shows the computing power available for a fixed amount of energy has been approximately doubling every 1.6 years since the mid-1940s.

The full technical paper is here: Implications of Historical Trends in the Electrical Efficiency of Computing.


Print Friendly Print Get a PDF version of this webpage PDF

2 Responses to “A Deeper Law than Moore’s?”

  1. Austin Collier says:
    12 October 2011 at 4:01 pm

    When you first introduced the concept of Moore’s Law in one of our earlier classes, you expressed one of the very real limiting factors to this law. In our current year and computing power abilities, the functioning amount of battery life (energy efficiency) hinders Moore’s Law. In other words, you said that since our battery capabilities undermine our computational technological progression, no longer will our computing power double every two years in the future.

    According to the research in this new article by Jonathan Koomey, this attempts to contradict the fact that we are limited to our battery capabilities. If this article is true, and energy efficiency and computing power are more or less equal to each other (doubling every two-ish years), will we ever see a deceleration of computer evolution? If not, will there be a point where too much is just… too much and anything extra will become just obsolete?

    • David Evans says:
      15 October 2011 at 6:56 pm

      This is a good point. Over the long history of technology, it seems whenever it seems like the physical limits of one mechanism are reached, an new paradigm is discovered and progress resumes. For silicon semi-conductor technology, we seem to be near the physical limits of what can be done. Processor speeds have not increased over the last five years, all the improvements have been in more cores, more energy efficiency, and mostly, better software to use the cores more efficiently.

      There is nothing guaranteed about these trends, but the trend of continuous improvement in technology seems to be very strong and humanity is driven to make it continue. I expect as we run out of opportunities to further improve electrical computing, other mechanisms (molecular ones like computing with DNA seem to be the most likely, but there are lots of other possibilities) will eventually become practical and replace the current technologies.

      I don’t think there is any limit on the demand for computing power. We’re just not very good at imagining what to do with 1 million times the power we have today, just like most people 30 years years ago weren’t able to envision the PC revolution, and most people 15 years ago weren’t able to envision smartphones.


Fall 2011

Register
Login

Help Schedule

(all in Davis Commons, except Dave's office hours in Rice 507)
Sundays, 1-6pm (Valerie/Joseph/Kristina)
Mondays, noon-1:30pm (Kristina)
Mondays, 1:15-2:00pm (Dave, Rice 507)
Tuesdays, 11am-noon (Dave, Rice 507)
Tuesdays, 5-8pm (Valerie/Jonathan)
Wednesdays, 5-6:30pm (Jiamin)
Thursdays, 9:45-11am (Dave, Rice 507)
Thursdays, 1-2:30pm (Joseph)
Thursdays, 4:30-7:30pm (Jonathan/Jiamin)
Fridays, noon-1:30pm (Peter)

Recent Posts

  • Course Wrap-Up
  • Class 41: The Cake of Computing
  • PS8 Submissions
  • Class 40: GuardRails, Big Data, and Secure Computation
  • Exam 2 Solutions

Recent Comments

  • David Evans on Problem Sets
  • jacob777 on Problem Sets
  • Prof. K.R. Chowdhary on Class 41: The Cake of Computing
  • Anon on Exams
  • Anon on Exams

Index

  • Classes
    • Class 1: Computing
    • Class 2: Language
    • Class 3: Rules of Evaluation
    • Class 4: Constructing Procedures
    • Class 5: Procedures Practice
    • Class 6: Programming with Data
    • Class 7: Programming with Lists
    • Class 8: Recursive List Procedures
    • Class 9: Consistent Hashing
  • Conveying Computing
  • Exams
  • Fractal Gallery
  • Guides
    • DrRacket Guide
    • Schemer’s Guide to Python
  • Problem Sets
    • Problem Set 0: Course Registration, Racket
    • Problem Set 1: Making Mosaics
      • PS1 Comments
    • Problem Set 2: Sequence Alignment
      • PS2 Comments
    • Problem Set 3: Limning L-System Fractals
      • PS3 – Comments
    • Problem Set 4: Constructing Colossi
      • PS4 – Comments
    • Problem Set 5: Wahoo! Auctions
      • PS5 Comments
    • Problem Set 6: Adventures in Charlottansville
      • PS6 Comments
    • Problem Set 7: Charming Snakes with Mesmerizing Memoizers
      • PS7 Comments
      • PS7 Responses
    • Problem Set 8 (Part 2): Typed Aazda
    • Problem Set 8: From Aazda to aaZda (Part 1)
      • PS8 Part 1 Comments
  • Syllabus
    • Course Pledge
  • Using These Materials

RSS BA Computer Science

RSS Jefferson’s Wheel

  • SoK: Let the Privacy Games Begin! A Unified Treatment of Data Inference Privacy in Machine Learning
  • CVPR 2023: Manipulating Transfer Learning for Property Inference
  • MICO Challenge in Membership Inference
  • Voice of America interview on ChatGPT

RSS Hacker News

  • The Stack Overflow Creative Commons Data Dump has been turned off
  • Freeman Dyson: Gravitational Machines
  • Functional Python Programming
  • France plans to close tax loophole benefiting Airbnb
  • Apollo Back end just made public

RSS Babbage

  • And it’s goodnight from us
  • Why 10, not 9, is better than 8
  • Future, imperfect and tense
  • The paperless dilemma
  • How to judge a ’bot; why it’s covered
cs1120 | RSS | Comments RSS | Book | Using These Materials | Login | Admin | Powered by Wordpress