Slashdot Mirror


Forget Moore's Law?

Roland Piquepaille writes "On a day where CNET News.com releases a story named "Moore's Law to roll on for another decade," it's refreshing to look at another view. Michael S. Malone says we should forget Moore's law, not because it isn't true, but mainly because it has become dangerous. "An extraordinary announcement was made a couple of months ago, one that may mark a turning point in the high-tech story. It was a statement by Eric Schmidt, CEO of Google. His words were both simple and devastating: when asked how the 64-bit Itanium, the new megaprocessor from Intel and Hewlett-Packard, would affect Google, Mr. Schmidt replied that it wouldn't. Google had no intention of buying the superchip. Rather, he said, the company intends to build its future servers with smaller, cheaper processors." Check this column for other statements by Marc Andreessen or Gordon Moore himself. If you have time, read the long Red Herring article for other interesting thoughts."

78 of 324 comments (clear)

  1. BBC Article by BinaryCodedDecimal · · Score: 4, Informative

    BBC Article on the same story here.

  2. clustering by mirko · · Score: 4, Interesting

    he said, the company intends to build its future servers with smaller, cheaper processors

    I guess this is better to use interconnected devices in an interconnected world.

    where I work, we recently traded our Sun E10k for several E450 between which we load balance request.
    It surprisingly works very well.

    I guess Google's approach is then an efficient one.

    --
    Trolling using another account since 2005.
    1. Re:clustering by beh · · Score: 5, Interesting

      The question is always, what you're doing.

      Google's approach is good for google. If Google would want to make good use of significantly faster CPUs, they would also need significantly more RAM in their machines (a CPU faster by a factor of 10 can't yield a speed-up factor of ten, if the network can't deliver the data fast enough).

      For Google it's fine, if a request can be done in say half-a-second on a slower machine, that is a lot cheaper then a 10* as fast machine doing each request in .05 seconds, but the machine costs 50* more than the slower machine.
      On the other hand, if you have a job that can only be done sequentially (or can't be parallelized all to well), then having 100s of computers won't help you very much... ...on the other hand - there is one question left: Is it really worth while having 100s or 1000s of PC class servers working your requests as opposed to a handful really fast servers?

      The more expensive servers will definitely be more expensive when you buy them - on the other hand the more expensive faster machines might save you a lot of money in turns of less rent for the offices (lower space requirements) or - perhaps even more important - save on energy...

      The company where I'm working switched all their work PCs to TFTs relatively early, when TFTs were still expensive. The company said, that this step was done on the expected cost saving in power bills and also saving on air conditioning in rooms with lots of CRTs...

    2. Re:clustering by e8johan · · Score: 4, Informative

      Google supports thousands of user request sessions, not one huge straight-line serial command sequence. This means that a huge bunch of smaller servers will do the jobb quicker than a big super-server. Not only because of the raw computing power, but due to the parallellalism that is extracted by doing so and the loss of overhead introduced by running too many tasks on one server.

    3. Re:clustering by Zeinfeld · · Score: 2, Informative
      Google's approach is good for google. If Google would want to make good use of significantly faster CPUs, they would also need significantly more RAM in their machines (a CPU faster by a factor of 10 can't yield a speed-up factor of ten, if the network can't deliver the data fast enough).

      I think you have the right idea, slightly mistated. The crux for Google is that their problem is actually creating a huge associative memory, many terabytes of RAM. The speed of the processors is not that important, the speed of the RAM is the bottleneck. Pipelining etc have little or no effect on data lookups since practically every lookup is going to be outside the cache.

      That does not support the idea that Moore's law is dead. It merely means that google is more interested in bigger and faster RAM chips rather than bigger and faster processors.

      Long ago when I built this type of machine the key question was the cost of memory. You wanted to have fast processors because you could reduce the total system cost if you had fewer and faster processors with the same amout of RAM. Today however RAM cost is not a big issue, the faster processors tend to require faster RAM so you can make savings by having 10 CPUS running at half the speed rather than 5 really fast processors at three times the cost.

      --
      Looking for an Information Security student project suggestion?
      Try http://dotcrimeManifesto.com/
    4. Re:clustering by SpikeSpiff · · Score: 3, Insightful
      The question is how important is what you're doing?

      If Google screws up 1 in 1000 requests, I wouldn't even notice. Refresh and on my way.

      Citibank trades roughly $1 Trillion in currency a day. If they had 5 9's accuracy, they would be misplacing $10,000,000 a day. In that environment, commodity machines are unacceptable.

      And it scales down: paychecks? billing records? The video check-out at Blockbuster?

      --
      "All that is required for evil to triumph is for good men to do nothing." - Edmund Burke
  3. 64bit matters, for Google, too by g4dget · · Score: 4, Insightful
    Assume, for a moment, that we had processors with 16bit address spaces. Would it be cost-effective to replace our desktop workstations with tens of thousands of such processors, each with 64k of memory? I don't think so.

    Well, it's not much different with 32bit address spaces. It's easy in tasks like speech recognition or video processing to use more than 4Gbytes of memory in a single process. Trying to squeeze that into a 32bit address space is a major hassle. And it's also soon going to be more expensive than getting a 64bit processor.

    The Itanium and Opteron are way overpriced in my opinion. But 64bit is going to arrive--it has to.

    1. Re:64bit matters, for Google, too by stiggle · · Score: 2, Insightful

      64bit has been here for a while, called Alpha Processors and they work very nicely.

      Why stay stuck in the Intel world? There's more to computers that what you buy from Dell.

    2. Re:64bit matters, for Google, too by drix · · Score: 5, Insightful

      Right, thank you, glad someone else got that. No one is saying that Google has abandoned Itanium and 64-bit-ness for good. Read that question in the context of the article and what Schmidt is really being asked is how will the arrival of Itanium affect Google. And of course the answer is that it won't, since as we all know Google has chosen the route of 10000 (or whatever) cheap Linux-based Pentium boxes in place of, well, an E10000 (or ten). But that sure doesn't mean Google is swearing off 64-bit for good--just that it has no intention of buying the "superchip." But bet your ass that when Itanium becomes more readily available and cheap, a la the P4 today, when Itanium has turned from "superchip" to "standardchip," Google will be buying them just as voraciously as everyone else. So for me these doomsday prognostications that Malone flings about don't seem that foreboding to me--Itanium will sell well, just not as long as it's considered a high-end niche item. But that never lasts long anyways. One-year-ago's high-end niche processor comes standard on every PC at CompUSA today.

      --

      I think there is a world market for maybe five personal web logs.
    3. Re:64bit matters, for Google, too by Arcturax · · Score: 2, Insightful

      64 bit will arrive, but the point of the article is that it may not arrive as fast as Moore said it would.

      Right now, we are at the point where its just a waste to build bigger and bigger hammers when you can get 100 smaller hammers to do more than a few bigger hammers and do it more quickly, cheaply and efficiently.

      Parallel computing is really coming of age now for consumers and small buisinesses. While in the past only a big megacorp or the government could afford a Cray class machine, now you can build equivalent power (maybe not up to today's supercomputers, but certainly equivilent to ones 10 years ago which is still pretty significant) in your basement with a few Powermac's/PC's, some network cable and open source software for clustering.

      So it makes more sense for Google to invest in a load of current technology and use it in the most effecient way possible than to spend money on expensive and untested (in the "real world") hardware.

      After all, just take a look at what Apple's done with the X-Serve. Affordable, small, efficient clustering capability for buisiness. Two CPU's per machine and you can beowulf them easily. Add in the new X-Raid and you have yourself a powerful cluster that probably (even at Apple's prices) will cost a lot less than a bunch of spanking new Itanium machines.

      64 bit will arrive (Probably when Apple introduces it ;), but it will just take a bit longer since we can get a lot out of what we already have.

      --

      --Won't that be grand? Computers and the programs will start thinking and the people will stop. - Dr. Walter Gibbs
    4. Re:64bit matters, for Google, too by g4dget · · Score: 2, Interesting
      I donï½t, at present, see applications which would significantly benefit from register values of these sizes ï½

      You can't even memory map files anymore reliably because many of them are bigger than 4G, which means that pretty much no program that deals with I/O can rely on memory mapping. Shared memory, too, needs to be shoe-horned into 32bit. 32bit addressing has a profoundly negative effect on software and hardware architecturs. We are back to PDP-11 style computing.

      Why limit ourselves to 64 bit addresses ï½ I can foresee valid applications for 128,256 and 512 bit (and larger) address schemes (consider, for example, distributed grid computing.)

      Sorry, I can't. 64bit addressing is driven by the fact that we can have easily more storage on a single machine than can be addressed with 32 bits. With 64bit computing, we can have a global unified address space for every single computer in the world for some time to come. There will probably be one more round of upgrades to 128bit addressing at one point, but that's it.

      The distinction Iï½d like to make is one of diminishing returns for typical applications of increasing the ï½default word lengthï½.

      First of all, for floating point software, it makes sense to go to 64bit anyway: 32bit floating point values are a complicated and dangerous compromise.

      But in general, you are right: 32bit numerical quantities are good enough for a lot of applications. But, as I was saying, we tried making machines that are mostly n-bits and have provisions for addressing >n-bits, and the software becomes a mess. Going to uniform 64bit architectures is driven by the fact that some software needs 64bits, and once some software does, the cost of only partial support is too high.

      AMD has a good compromise: they give you blazing 32bit performance and decent 64bit performance, with very similar instruction sets. That way, you can keep running existing 32bit software in 32bit mode.

  4. Damn it! by FungiSpunk · · Score: 3, Funny

    I want my quad 64GHz processor! I want it in 2 years time and I want quad-128Ghz ready by the following year!!!

    --

    "I kill you! You no good 56'ing!"
  5. well now... by stinky+wizzleteats · · Score: 4, Funny

    This makes me feel a lot less like a cantankerous, cheap old fart for not replacing my Athlon 650.

    1. Re:well now... by isorox · · Score: 2, Funny

      *taps away on P166 Thinkpad*

  6. Google's got the right idea. by Lukano · · Score: 2, Insightful

    Reply I've run into similar situations with clients of mine, when trying to figure out for them which the best solution for their new servers/etc would be.

    Time and time again, it always comes down to;

    Buy them small and cheap, put them all together, and that way if one dies, it's a hell of a lot easier and less expensive to replace/repair/forget.

    So Google's got the right idea, they're just confirming it for the rest of us! :)

  7. Danger by Anonymous Coward · · Score: 2, Funny

    "Michael S. Malone says we should forget Moore's law, not because it isn't true, but mainly because it has become dangerous."

    If only all dangerous things would go away as soon as we choose to forget them...

  8. Transistors? BAH! by The+Night+Watchman · · Score: 4, Funny

    I'm waiting for DNA Computers! Shove a hamburger into where the floppy drive used to be, run gMetabolize for Linux (GNUtrients?), in a few hours my machine isn't obsolete anymore.

    Either that, or it mutates into an evil Steve Wozniak and strangles me in my sleep.

    /* Steve */

    --
    "Every jumbled pile of person has a thinking part that wonders what the part that isn't thinking isn't thinking of"-TMBG
  9. Does anybody take Andreessen seriously? by Anonymous Coward · · Score: 5, Insightful

    I mean the guy was involved in Netscape.

    He hit the lottery. He was a lucky stiff. I wish I was that lucky.

    But that's all it was. And I don't begrudge him for it. But I don't take his advice.

    As for google. Figure it out yourself.

    Google isnt' driving the tech market. What's driving it are new applications like video processing that guess what...needs much faster processors than we've got now.

    So while Google might not need faster processors, new applications do.

    And I say that loving google, but its not cutting edge in terms of hardware. They have some good search algorithms.

    1. Re:Does anybody take Andreessen seriously? by shimmin · · Score: 3, Funny
      I lived in the apartment building he lived in college, albeit after he left. When I was leaving the building, I asked the landlord what their guidelines on how clean "clean" was for purposes of getting a damage deposit back. She told me her two largest damage deposit deduction stories.

      In the largest, a bunch of guys, the day before reporting to duty for boot camp, held a very wild party. It involved using a sofa as a battering ram. There was a stove-sized hole in one wall. There was a refrigerator-sized one in the other.

      Andreessen was the second largest. No major damage, but he just left EVERYTHING. Clothes, furniture, papers, food, everything. They had to clean out a man's entire life. She guessed he left town with a backpack, a change of clothes, and his portable.

      When he started Netscape, he saw the niche, left town, and dumped everything on it NOW. Maybe that's luck, but maybe it's being insightful enough to know what risks are worth leaving everything for. I'd give someone who showed that kind of insight a fair shake, if they had something else to say.

  10. Because by tkrotchko · · Score: 2, Insightful

    The expectation that computing power will (essentially) double every 18 months drives business planning at chip makers, fab makers, software developers, everything in the tech industry. In other words, it becomes a self-fulfilling prophesy.

    I'm not doing it real justice, but Google (ironic, eh?) about the effects of moore's law for a much better explanation.

    --
    You were mistaken. Which is odd, since memory shouldn't be a problem for you
  11. Now, again... by OpenSourced · · Score: 2, Funny
    If you have time, read the long Red Herring article...


    Of course we have time. Ain't we reading slashdot?

    --
    Rome taught me patience and assiduous application to detail. Virtues which temper the boldness of great, general views.
  12. Andreesen quotes... by praetorian_x · · Score: 4, Insightful

    "The rules of this business are changing fast," Mr. Andreessen says, vehemently poking at his tuna salad. "When we come out of this downturn, high tech is going to look entirely different."
    *gag* Off Topic, but has *anyone* become as much of a caricture of themselves as Andreessen?

    This business is changing fast? Look entirely different? Thanks for the tip Marc.

    Cheers,
    prat
  13. Xeon beats Itanium on value by Macka · · Score: 3, Interesting

    I was at a customer site last week, and they were looking at options for a 64 node (128 cpu) cluster. They had a 2cpu Itanium system on loan for evaluation from HP. They liked it, but decided instead to go with Xeon's rather than Itanium. The reason .. Itanium systems are just too expensive at the moment. Bang for Buck, Xeon's are just too attractive by comparison.

    The Itanium chip will eventually succeed, but not until the price drops and the performance steps up another gear.

  14. how is this not moore's law? by rillian · · Score: 4, Insightful

    Google had no intention of buying the superchip. Rather, he said, the company intends to build its future servers with smaller, cheaper processors.

    How is this not Moore's law? Maybe not in the strict sense of number of transistors per cpu, but it's exactly that increase in high-end chips that make mid-range chips "smaller, cheaper" and still able to keep up with requirements.

    That's the essense of Moore's law. Pretending it isn't is just headline-writing manipulation, and it's stupid.

  15. Google's decision is economic by Hays · · Score: 4, Insightful
    They're not saying they don't want faster processors with higher address spaces, who wouldn't. They're simply saying that the price/performance ratio is likely to be poor, and they have engineered a good solution using cheaper hardware.

    Naturally there are many more problems which can not be parallelized and are not so easily engineered away. Google's statement is no great turning point in computing. Faster processors will continue to be in demand as they tend to offer better price/performance ratios, eventually, even for server farm situations.

    1. Re:Google's decision is economic by Waffle+Iron · · Score: 2, Interesting
      But as CPUs get faster, more and more problems can be parallelized at the granularity of a commodity CPU. That leaves fewer problems left that demand a new, faster CPU.

      Eventually, the dwindling number of remaining problems won't have enough funding behind them to support the frantic pace of innovation needed to support Moore's law. I think that CPU development will hit this economic barrier well before it becomes technically impossible to improve performance.

  16. Mushy writing by icantblvitsnotbutter · · Score: 5, Insightful

    I don't know, but am I the only one who found Malone's writing to be mushy? He wanders around, talking about how Moore's Law applies to the burst Web bubble, that Intel isn't surviving because of an inability to follow it's founder's law, and yet that we shouldn't be enslaved by this "law".

    In fact, the whole article is based around Moore's Law still applying, desptie being "unhealthy". Well, duh. I think he had a point to make somewhere, but lost it on the way to the deadline. Personally, I would have appreciated more concrete reasons about why Google's bucking the trend is so interesting (to him).

    He did bring up one very interesting point, but didn't explore it enough to my taste. Where is reliability in the equation? What happens if you keep all three factors the same, and use the cost savings in the technology to address failure points?

    Google ran into bum hard drives, and yet the solution was simply to change brands? The people who are trying to address that very need would seem to be a perfect fit for a story about why Moore's Law isn't the end-all be-all answer.

  17. Moore's Law still valid by TomHoward · · Score: 2, Interesting
    he said, the company intends to build its future servers with smaller, cheaper processors

    Just because Google (and I assume many other companies) are looking to use smaller, cheaper processors, it does not mean that Moore's law will not continue to hold.

    Moores Law is a statement about the number of transitors per square inch, not per CPU. Google's statement is more about the (flawed) concept of "One CPU to rule them all", rather than any indictment of Moore's Law or those that follow it.

    --
    Do you really think I'm go to put something novel here?
  18. The pied piper by vikstar · · Score: 2, Troll

    We should not simply and blindly follow Moore's law as a guide to producing CPU's. We are capable of crushing Moore's law, however, CPU companies are not interrested in creating fast computers, they are interested in making a profit. This translates to small increments in CPU speed which they can charge large increments of price for.

    Other possibilites such a quantum computing are left to a number of small university lectures to study and conduct research in, small compared to the revenue of the chip companies.

    --
    The question of whether a computer can think is no more interesting than the question of whether a submarine can swim.
  19. Re:Moore ain't a law... by Shimbo · · Score: 2, Insightful

    Its a prediction that has held pretty true. Its a good benchmark but is not a true Law.

    The majority of laws are empirical in nature. Even Newton's laws of motion don't come from the theory, rather they are axioms that underly it.

  20. Cheaper doesn't mean better either by Jack+William+Bell · · Score: 4, Insightful

    The problem is that cheaper processors don't make much money -- there isn't the markup on commodity parts that there is on the high end. The big chip companies are used to charging through the nose for their latest and greatest and they use much of that money to pay for the R & D, but the rest is profit.

    However profit on the low end stuff is very slight because you are competing with chip fabs that don't spend time and money on R & D; buying the rights to older technology instead. (We are talking commodity margins now, not what the market will bear.) So if the market for the latest and greatest collapses the entire landscape changes.

    Should that occur my prediction is that R & D will change from designing faster chips to getting better yields from the fabs. Because, at commodity margins, it will be all about lowering production costs.

    However I think it is still more likely that, Google aside, there will remain a market for the high end large enough to continue to support Intel and AMD as they duke it out on technological edge. At least for a while.

    --
    - -
    Are you an SF Fan? Are you a Tru-Fan?
  21. Don't read too much into Googles response ... by binaryDigit · · Score: 3, Insightful

    For their application having clusters of "smaller" machines make sense. Lets compare this to ebay.

    The data google deals with is non real time. They churn on some data and produce indices. A request comes in over a server, that server could potentially have it's own copy of the indices and can access a farm of servers that hold the actual data. The fact that the data and indices live on farms is no big deal as there is no synchronization requirement between them. If server A serves up some info but is 15 minutes behind server Z, that's ok. This is a textbook application for distributed non-stateful server farms

    Now ebay, ALL their servers (well the non listing ones) HAVE to be going after a single or synchronized data source. Everybody MUST have the same view of an auction and all requests coming in have to be matched up. The "easiest" way to do this is by going against a single data repository (well single in the sense that the data for any given auction must reside in one place, different auctions can live on different servers of course). All this information needs to be kept up on a real time basis. So ebay also has the issue of transactionally updating data in realtime. Thus their computing needs are significantly different than that of google.

    1. Re:Don't read too much into Googles response ... by GenetixSW · · Score: 2

      That's not entirely right. EBay isn't really any more synchronised than Google.

      You might have noticed when posting an auction that you can't search for it until quite a bit after posting. That's because the EBay servers don't synchronise and reindex as frequently as one might think. Their pages are kept as static as possible to reduce the load on their servers.

  22. Eh? by Mr_Silver · · Score: 4, Funny
    Michael S. Malone says we should forget Moore's law, not because it isn't true, but mainly because it has become dangerous.

    How can Moore's law become dangerious?

    If you break it, will you explode into billions of particles?

    --
    Avantslash - View Slashdot cleanly on your mobile phone.
    1. Re:Eh? by sql*kitten · · Score: 2, Funny

      If you break it, will you explode into billions of particles?

      The danger is that soon enough an Intel processor will get hot enough to trigger a fusion reaction in atmospheric hydrogen, turning Earth into a small star. We must abandon this dangerous obsession with Moore's law before it's too late!

  23. It's in the gospel by datadictator · · Score: 4, Funny

    And that day the spirits of Turing and Von Neumann spoke unto Moore of Intel granting him insight and wisdomn to understand the future. And Moore was with chip and he brought forth the chip and named it 4004. And Moore did bless the chip saying: "Thou art a breakthrough, with my own corporation have I fabricated thee. Thou art yet as small as a dust mote, yet shall thou grow and replicate unto the size of a mountain and conquer all before thee. This blessing I give unto thee: Every eighteen months shall thou double in capacity, until the end of the age." This is Moores law, which endures to this day.

    Do not mess with our religion :-)

    Untill the end of the epoch, Amen.

    PS. With thanks to a source which I hope is obvious.

  24. Both ways lead to growth of computing power... by iion_tichy · · Score: 2, Insightful

    Wether you use a super chip or several low cost chips, the computing power at your disposal still grows exponentially, I guess. So no refutation of Moore's law.

  25. render farms by AssFace · · Score: 3, Informative

    google doesn't really do much in terms of actually hardcore processing - it just takes in a LOT of requests - but each one isn't intense, and it is short lived.

    On the other hand, say you are running a renderfarm - in that case you want a fast distributed network, the same way google does, but you also want each individual node as fast as freakin possible.
    They have been using Alphas for a long time for that exact reason - so now with the advent of the Intel/AMD 64s, that will drive prices down on all of it - so I would imagine the render farms are quite happy about that. That means that they can either stay at the speed at which they do things now, but for cheaper - or they can spend what they do now and get much more done in the same time... either way leading to faster production and argueably more profit.

    The clusters that I am most familiar with are somewhere in between - they don't need the newest fastest thing, but they certainly wouldn't be hurt by a faster processor.
    For the stuff I do though, it doesn't matter too much - if I have 20 hours or so to process something, and I have the choice of doing it in 4 minutes or 1 minute, I will take whichever is cheaper since the end result might as well be the same otherwise in my eyes.

    --

    There are some odd things afoot now, in the Villa Straylight.
  26. what moore said.. by qoncept · · Score: 4, Insightful

    I think people are missing the point of Moore's law. When he said he thought transistors would double every 2 years, thats what he thought would happen. Thats not a rule set that anyone has to follow (which, as far as I can figure, is the only way it could be "dangerous," because people might be trying to increase the number of transistors to meet it rather than do whatever else might be a better idea..????). It's not something he thought would always be the rule, forever, no matter what. The fact that he's been right for 35 years already means he was more right than he could have imagined.

    --
    Whale
  27. Is this the first signs of a turnaround? by Lumpy · · Score: 4, Insightful

    Software over the past 20 years has gotten bigger not better. We dont do anything different than what I was able to do in 1993. And it doesnt affect just windows and commercial apps. Linux and It's flotilla of apps are all affected. Gnome and KDE are bigger and not better. They do not do the desktop thing any better than what they did 5 years ago. Sure small features have finally been fixed, but at the cost of adding 100 eye-candy opetions for every fix. Mozilla is almost as big as IE, Open Office is still much larger than it needs to be. X windows hasn't been on a diet for years.

    granted it is much MUCH worse on the windows side. Kiplingers TaxCUT is 11 megabytes in size for the executable.. FOR WHAT?? eye candy and other useless features that don't make it better.... only bigger.

    Too many apps and projects add things for the sake of adding them... to look "pretty" or just for silly reasons.

    I personally still believe that programmers should be forced to run and program on systems that are 1/2 to 1/3rd of what is typically used. this will force the programmers to optimize or find better ways to make that app or feature work.

    It sounds like google is tired of getting bigger and badder only to watch it become no faster than what they had only 6 months ago after the software and programmers slow it down.

    remember everyone... X windows and a good windows manager in linux RAN VERY GOOD on a 486 with 16 meg of ram and a decent video card.. Today there is no chance in hell you can get anything but blackbox and a really old release of X to run on that hardware (luckily the Linux kernel is scalable and it heppily runs all the way back to the 386.)

    --
    Do not look at laser with remaining good eye.
  28. Moore's Law by ZeLonewolf · · Score: 2, Interesting


    "Moore's Law" has been bastardized beyond belief. Take an opportunity to read Moore's Paper (1965), which is basically Gordon Moore's prediction on the future direction of the IC industry.

    --
    "If at first you don't succeed, lower your standards."
  29. NoW by Root+Down · · Score: 3, Informative

    The NoW (Network of Workstations) approach has been on ongoing trend over the last few years as the throughput achieved by an N distinct processors connected by a high speed network is nearly as good (and sometimes better) than an N processor mainframe. All this comes at a cost that is much less than that of a mainframe. In Google's case, it is the volume that is the problem, and not necessarily the complexity of the tasks presented. Thus, Google (and many other companies) can string together a whole bunch of individual servers (each with their own memory and disk space so there is no memory contention - another advantage over the mainframe approach) quite (relatively) cheaply and get the job done by load balancing across the available servers. Replacement and upgrades - yes, eventually to the 64 chips - can be done iteratively so as to not impact service, etc. Lots of advantages...

    Here is a link to a seminal paper on the issue if you are interested:

    http://citeseer.nj.nec.com/anderson94case.html

  30. Oh Really? by plasticmillion · · Score: 2, Insightful
    This article is certainly thought-provoking, and it is always worthwhile to challenge conventional wisdom once in a while. Nonetheless, I can't shake the feeling that this is a lot of sound and fury about nothing. As many others have the pointed out, Google's case may not be typical, and in my long career in the computer industry I seem to remember countless similar statements that ended up as more of an embarrassment to the speaker than anything remotely prescient (anyone remember Bill Gates's claim that no one would EVER need more than 640K of RAM?).

    I use a PC of what would have been unimaginable power a few short years ago, and it is still woefully inadequate for many of my purposes. I still spend a lot of my programming time optimizing code that I could leave in its original, elegant but inefficient state if computers were faster. And in the field of artificial intelligence, computers are finally starting to do useful things, but are sorely hampered by insufficient processing power (try a few huge matrix decompositions -- or a backgammon rollout! -- and you'll see what I mean).

    Perhaps the most insightful comment in the article is the observation that no one has ever won betting against Moore's Law. I'm betting it'll be around another 10 years with change. Email me if you're taking...

  31. Amen. by porkchop_d_clown · · Score: 2

    My experience with 64 bit chips is that they don't offer any compelling advantages over a multi-processor 32 bit system.


    The only real advantage they have is a bigger address space and even that doesn't offer much advantage over a cluster of smaller systems.


  32. Sounds like Ganesh's law to me by DrSkwid · · Score: 2, Informative
    --
    There are places where the networks are not touching,and there are places where they are-Boeing's Lori Gunter
  33. I actually read them by jj_johny · · Score: 4, Insightful
    Here is the real deal about Moore's law and what it means. If you don't take Moore's law into account, it will eventually change the dynamics of your industry and cause great problems for most companies.

    Example 1 - Intel - This company continues to pump out faster and faster processors. They can't stop making new processors or AMD or someone else will. The costs of making each processor goes up but the premium for new, faster processors continues to drop as fewer people need the absolute high end. So if you look at Intel's business 5 years ago, they always had a healthy margin for the high end. That is no longer the case and if you exprapolate out a few years, it is tough to imagine that Intel will be the same company it is today.

    Example 2 - Sun - These guys always did a great job of providing tools to companies that needed the absolute fastest machines to make it work. Unfortunately, Moore's law caught up and made their systems a luxury compared to lots of other manufacturers.

    The basic problem that all these companies have is that Moore's Law eventually changes every business into a low end commodity business.

    You can't stop the future. You can only simulate it by stopping progress

  34. no need for speed by MikeFM · · Score: 3, Insightful

    Seriously at this point most people don't need 1Thz CPU's. What most people need is cheaper, smaller, more energy effecient, cooler CPU's. You can buy 1Ghz CPU's now for the cost of going to dinner. If you could get THOSE down to $1 each so they could be used in embedded apps from clothing to toasters you would be giving engineers, designers, and inventors a lot to work with. You'd see a lot more innovation in the business at that price point. Once powerful computing had spread into every device we use THEN new demand for high end processors would grow. The desktop has penetrated modern life - so it's dead - time to adjust to the embedded world.

    --
    At what price learning? At what cost wisdom? The price is a man's peace of mind, and the cost is his life.
  35. King Canute by lugumbashi · · Score: 2, Insightful
    You can no more "Forget Moore's Law" than you can roll back history. It is driven by competition. It would be commercial suicide for AMD or Intel to decide enough was enough and declare, "there you go that ought to be fast enough for you".


    In any case the article shows a fundamental misuderstanding of the industry and its driving forces. The principle driving force is to lower costs and this is the chief effect of Moore's law. The focus is not on building supercomputers but super-cheap computers. Of course this has the effect of lowering the costs of supercomputers as well. The anecdote from Google is a perfect example of the benefits of Moore's law, not a sign of it becoming redundant or dangerous.


    Some of the biggest changes are seen in the embedded world - e.g mobile phones. Intel's vision is of putting radios on every chip.

  36. The entire issue is confused. by Futurepower(R) · · Score: 2, Insightful


    'His words were both simple and devastating: when asked how the 64-bit Itanium, the new megaprocessor from Intel and Hewlett-Packard, would affect Google, Mr. Schmidt replied that it wouldn't. Google had no intention of buying the superchip. Rather, he said, the company intends to build its future servers with smaller, cheaper processors." '

    The parent comment is correct, but the entire issue is confused. In a few years, the Itanium will be the cheapest processor available, and Google will be using it.

  37. Future of Supercomputing by jaaron · · Score: 4, Interesting

    Clustering has definitely won out in the United States mostly due to the appeal of cheap processing power, but that doesn't mean that clustering is always best. Like another poster mentioned, it depends on what you're doing. For Google, clustering is probably a good solution, but for high end supercomputing, it doesn't always work.

    Check out who's on top of the TOP 500 supercomputers. US? Nope. Cluster? Nope. The top computer in the world is the Earth Simulator in Japan. It's not a cluster of lower end processors. It was built from the ground up with one idea -- speed. Unsurprisingly it uses traditional vector processing techniques developed by Cray to achieve this power. And how does it compare with the next in line? It blows them away. Absolutely blows them away.

    I recently read a very interesting article about this (I can't remember where - I tried googling) which basically stated that the US has lost it's edge in supercomputing. The reason was two fold: (1) less government and private funding for supercomputing projects and (2) a reliance on clustering. There is communication overhead in clustering that dwarfs similar problems in traditional supercomputers. Clusters can scale, but the max speed is limited.

    Before you start thinking that it doesn't matter and that the beowulf in your bedroom can compare to any Cray, recognize that there are still problems within science that would take ages to complete. These are very different problems from those facing Google, but they are nonetheless real and important.

    --
    Who said Freedom was Fair?
    1. Re:Future of Supercomputing by oliverthered · · Score: 2, Informative

      it is a cluster....

      640 processor nodes, each consisting of eight vector processors are connected as a high speed interconnection network.

      That makes it a cluster (640 processor nodes) of clusters (8 vector processors)

      --
      thank God the internet isn't a human right.
    2. Re:Future of Supercomputing by Troy+Baer · · Score: 5, Informative
      Check out who's on top of the TOP 500 supercomputers. US? Nope. Cluster? Nope. The top computer in the world is the Earth Simulator in Japan. It's not a cluster of lower end processors. It was built from the ground up with one idea -- speed. Unsurprisingly it uses traditional vector processing techniques developed by Cray to achieve this power. And how does it compare with the next in line? It blows them away. Absolutely blows them away.

      It's worth noting that the Earth Simulator is actually a cluster of vector mainframes (NEC SX-6s) using a custom interconnect. You could do something similar with the Cray X-1 if you had US$400M or so to spend.

      I recently read a very interesting article about this (I can't remember where - I tried googling) which basically stated that the US has lost it's edge in supercomputing. The reason was two fold: (1) less government and private funding for supercomputing projects and (2) a reliance on clustering.

      If you're referring to the article I think you are, it was specifically talking in the context of weather simulation -- an application area where vector systems are known to excel (hence why the Earth Simulator does so well at it). The problem is that vector systems aren't always as cost-effective as clusters for a highly heterogeneous workload. With vector systems, a good deal of the cost is in the memory subsystem (often capable of several 10s of GB/s in memory bandwidth), but not every application needs heavy-duty memory bandwidth. Where I work, we've got benchmarks that show a cluster of Itanium-2 systems wiping the walls with a vector machine for some applications (specifically structural dynamics and some types of quantum chemistry calcuations), and others where a bunch of cheap AMDs beat everything in sight (on some bioinformatics stuff). It all depends on what your workload is.

      --Troy
      --
      "My life's work has been to prompt others... and be forgotten." --Cyrano de Bergerac
  38. Why the Debate? by rhkaloge · · Score: 2, Insightful

    Why do people even give ink to "Will Moores Law Hold Up?" debates? I always thought of it as a neat novelty to open powerpoint presentations with. I somehow doubt that Intel has as a mandate to "keep up with Moores Law" or anything. It's really only a "Law" when applied in retrospect anyway.

  39. What is an example that can't run in parallel? by Anonym0us+Cow+Herd · · Score: 3, Interesting

    I'm not disputing that they exist. But I'm drawing a blank. Can someone please give an example of a computing task that CANNOT be subdivided into smaller tasks and run in parallel on many processing elements? The kind of task that requires an ever faster single processor.

    I tend to be a believer that massively parallel machines are the (eventual) future. e.g. just as we would brag about how many K, and then eventually megabytes our memory was, or how big our hard di_k was, or how many megahertz, I think that in the future shoppers will compare: "Oh, the machine at Worst Buy has 128K processors, while the machine at Circus Shitty has only 64K processors!"

    --
    The price of freedom is eternal litigation.
    1. Re:What is an example that can't run in parallel? by oliverthered · · Score: 3, Informative

      a one of matrix inversion. well parts of it can't be done efficiently in parallel.

      Though the resulting matrix would probably be applied accross a lot of data and that can be done in parallel.

      A matrix inversion can be done very fast if you have a Very MPP system (say effectivly 2^32 processors!) like a quantum computer.

      --
      thank God the internet isn't a human right.
    2. Re:What is an example that can't run in parallel? by minektur · · Score: 3, Informative

      Matrix inversion comes to mind -- it is very difficult to parallelize.

      I found a nice little read about how to decide if any particular problem you are looking at is easily parallelizable.

      It is in pdf (looks like a power point presentation).

      http://cs.oregonstate.edu/~pancake/presentations /s dsc.pdf

    3. Re:What is an example that can't run in parallel? by crawling_chaos · · Score: 3, Insightful
      Any problem that requires a big working set can benefit from running on big iron. If you can't sub-divide the memory usage, you'll spend a lot of time whipping memory requests out over very slow links. Cray has a bunch of data on this. The short of it is that it's all about memory latency. The X1 series is built have extremely low latency.

      That's not to say that every complex problem needs a supercomputer. That's why Cray also sells Intel clusters. Right tool for the right job and all of that.

      --
      You can only drink 30 or 40 glasses of beer a day, no matter how rich you are.
      -- Colonel Adolphus Busch
    4. Re:What is an example that can't run in parallel? by oconnorcjo · · Score: 2, Insightful

      I dream of the day when motherboard manufacturors sell cheap 4 cpu boards and AMD/Intel sell low powered/low heat processors (something akin to transmeta). Yeah the Quad Xeon exists but Intel wants you to pay through the nose for those (and they don't run cool). I would love to have 4 (900 mhz "Barton's") Athlon MP cpus in a box that ran cool and reliably. It may not even run as fast as even one Intel P4 3.06 ghz HT for many applications but from what I have seen of smp machines is that they run much SMOOTHER. When smp machines are dished out a lot of work, it does not effect the responsiveness of the whole system. Instead of having one servant who is on supersteriods and is the best at everything but can really only do one thing at a time, I would rather have four servants (which even get in the way of each other at times) who can't do as much but they all can be doing different things at once.

      --
      I miss the Karma Whores.
    5. Re:What is an example that can't run in parallel? by po8 · · Score: 2, Informative

      Can someone please give an example of a computing task that CANNOT be subdivided into smaller tasks and run in parallel on many processing elements?

      The technical issue here is known as "linear speedup". Take chess, for example: the standard search algorithm for chess play is something called minimax search with alpha-beta pruning. It turns out that the alpha-beta pruning step effectively involves information from the entire search up to this point. With only a subset of this information, exponentially more work will be needed: a bad thing.

      How do parallel chess computers such as Deep Blue work, then? Very fancy algorithms that still get sublinear but interesting speedups at the expense of a ton of clever programming. This is a rough explanation of why today's PC chess programs are probably comparable with the now-disassembled Deep Blue: the PC chess programmers can use much simpler search algorithms, concentrating on other important programming tasks, also a 10x speedup in uniprocessor performance has a 10x search speed increase, whereas using 10x slow processors isn't nearly so effective. Note that Deep Blue was decommissioned largely because of maintenance costs: a lot of rework would have to be done to make Deep Blue take advantage of Moore's Law.

      That said, many tasks are "trivially" parallelizable. Aside from the pragmatic problem of coding for parallel machines (harder than writing serial code even for simple algorithms), there is also the silicon issue: given a transistor budget, are manufacturers better spending it on a bunch of little processors or one big one? This is the real question, and so far the answer is generally "one big one". YMMV. HTH.

      (BTW, why can't I use HTML entities for Greek alpha and beta in my Slashdot article? What are they protecting me from?)

    6. Re:What is an example that can't run in parallel? by pclminion · · Score: 4, Informative
      Can someone please give an example of a computing task that CANNOT be subdivided into smaller tasks and run in parallel on many processing elements? The kind of task that requires an ever faster single processor.

      Computing the MD5 sum of 1TB of data. :-) MD5 depends on (among other things) being non-parallelizable for its security.

    7. Re:What is an example that can't run in parallel? by Anonym0us+Cow+Herd · · Score: 3, Informative

      the standard search algorithm for chess play is something called minimax search with alpha-beta pruning.

      This algorithm is something I'm familiar with. (Not chess, but other toy games in LISP, like Tic Tac Toe, Checkers, and Reversi, all of which I've implemented using a generic minimax-alphabeta subroutine I wrote.) (All just for fun, of course.)

      If you have a bunch of parallel nodes, you throw all of the leaf nodes at it in parallel. As soon as leaf board scores start comming in, you min or max them up the tree. You may be able to alpha-beta prune off entire subtrees. Yes, at higher levels, the process is still sequential. But many boards' scores at the leaf nodes need computed, and could be done in parallel. Yes, you may alpha-beta prune off a subtree that has already had some of your processors thrown at it's leaf nodes -- you abort those computations and re-assign those processors to the leaf nodes that come after the subtree that just got pruned off.

      Am I missing anything important here? It seems like you could still significantly benefit from massive parallel processing. If you have enough processors, the alpha-beta pruning itself might not even be necessary. After all the alpha-beta pruning is just an optmization so that sequential processing doesn't have to examine subtrees that wouldn't end up affecting the outcome. But let's say, each board can have 10 possible moves made by each player. I want to look 4 moves ahead. This is 10,000 leaf boards to score. If I have more than 10,000 processors, why even bother to alpha-beta prune? Now, if I end up needing to examine 1 million boards (more realistic perhaps) and I can do them 10,000 at a time, I still may end up being able to take advantage of some alpha-beta pruning. And 10,000 boards examined at once, sequentially, is still faster than 1 at a time.

      Vector processors wouldn't be any more helpful here (would they?) than massively parallel?

      Of course, whether a mere 10,000 processors constitutes massively parallel or not is a matter of interpretation. Some people say a 4-way SMP is massively parallel. I suppose it depends on your definition of "massively".

      --
      The price of freedom is eternal litigation.
    8. Re:What is an example that can't run in parallel? by Pig+Bodine · · Score: 2, Informative

      Inversion is always a bad idea due to the effect of round-off error. What you really want to do is to solve the linear system Ax=b using a stable method without actually computing the inverse of A. For solving Ax=b it is clearer to speak of parallelizable algorithms instead whether solving a general system is parallelizable; there are too many different types of matrices A. Some algorithms work well on some A and not on others.

      Guassian elimination is the one method that works on any system but it does not exploit any structure in A (presence of zero elements, etc.). Also, assuming that is what you mean by "matrix inversion", you are correct. It is not terribly parallelizable: the amount of communication required increases pretty quickly as you increase the number of processors until you don't really gain anything at all. And since it doesn't exploit the structure of A it is typically not very fast. Nevertheless, it's the slow steady method that will eventually give you a solution to a problem on which other methods fail.

      Iterative methods can easily exploit the structure of matrices A that come from partial differential equations. (This covers fluid flow and many other physics/engineering simulations). In some cases there are methods (e.g. domain decomposition) which can make the methods highly parallel. But whether iterative methods work well in parallel, or even whether they work at all, depends on the problem. These methods can be efficient when they work, but can sometimes require an expert to make them to work at all.

      In practice if you pick the right algorithm and have a bit of luck you might get a good speedup solving a linear system on a parallel computer. More often than not, unless you put a lot of work into matching your algorithm to a very specific matrix A, the gains from parallel solution will not be amazingly impressive. Having a faster computer that doesn't depend on parallelism is better. This was true even in the old days when supercomputers had fewer processors; in my experience the gains from vectorization were easier to get and more dramatic than gains from parallelization. Now that we try to divide up the problems on supercomputers with many more processors, the limits imposed by communication are even more significant.

    9. Re:What is an example that can't run in parallel? by pclminion · · Score: 2, Interesting
      There is only part of the algorithm that can be done in "parallel." For reference see md5.c

      An example round from MD5 (line 198):

      MD5STEP (F1, a, b, c, d, in[0] + 0xd76aa478, 7);

      This expands to:

      ( w += (d ^ (b & (c ^ d))) + in[0] + 0xd76aa478, w = w<<7 | w>>(32-7), w += b )

      Notice that there are two additions in the first subexpression. The addition (in[0] + 0xd76aa478) can be computed simultaneously with (d ^ (b & (c ^ d))).

      This is the only spot where anything could be parallelized. Assuming that all the principle operations can be performed in the same amount of time, then you could potentially go 25% faster by computing the addition in parallel.

      But that's the furthest you can go.

  40. More on what Google's CEO said by imnoteddy · · Score: 3, Informative
    According to this article the issue had to do with both price and power consumption.

    From the article:

    Eric Schmidt, the computer scientist who is chief executive of Google,
    told a gathering of chip designers at Stanford last month that the computer
    world might now be headed in a new direction. In his vision of the future,
    small and inexpensive processors will act as Lego-style building blocks
    for a new class of vast data centers, which will increasingly displace the
    old-style mainframe and server computing of the 1980's and 90's.

    It turns out, Dr. Schmidt told the audience, that what matters most to the
    computer designers at Google is not speed but power -- low power, because data
    centers can consume as much electricity as a city.

    He gave the Monday keynote at the "Hot Chips" conference at Stanford last August.
    There is an abstract of his keynote.

    --
    No electrons were harmed creating this post, though some may have been subjected to electrical and/or magnetic fields.
  41. More Expensive is no longer better by diablobynight · · Score: 2, Interesting

    The problem is that the processors that are out for home use such as the new Barton chip and the newer Pentium 4s are amazing processors. So the speed increase overall is not even close to a power of ten, if it's even close to twice as fast I would be suprised. Especially with NForce motherboards offering dual memory channels and server board like performance. A lot of companies switched from these overated quad Xeon systems and other such expensive servers a couple of years ago, A local company last year, switched from buying overtly expensive servers with raid drives that cost ten times as much than IDE for hard drive space and the quad Xeons that they were only getting 10-15% performance increase from that 4th 560$ processor, and now they run Dual Athlon systems. With standard ata 133 drives inside, two deal with the lack of caching in an IDE system, They installed an impressively low priced IDE SAN sold by IBM and now have 10 times as much hard drive space as they used to for slightly less money. The Dual Athlon Systems, built by me actually (Which I admit I was scared to put in a server environment, because of previous instabilities in ADM chipsets), these systems run superbly, and were inexpensive to build by comparison of 8000$ Dell Servers or $$$$$$$ Sun Servers. I am not going to tell you that a dual athlon is a better server than a Sun, no way, I know Suns are rock solid, but since I could build the Athlons so cheap we built 6 servers to share load, run pearl, run SQL, run their web server, run their domain controller, and I dedicated one system just to Lotus Notes, a program I despise but this company loves. Anyhow the point is, the price was so low, they had me build them 3 extra servers and prepare a server image for them. Currently these servers work to share load of the web server and they supply the company with an added 400GB of file space per server, 4-120GB IBM drives per server and I dedicate 80GB per system to empty space. Just because keeping 20GB free per Hard drive is probably a good idea so that defrag processes can run properly. I don't know if this is an answer for everyone, but for what most server rooms handle, mail, file space for the company, print server, web server, CAD drawing servers, These smaller powerhouses have been doing excellent. I am glad to see companies that no longer believe IBM, Dell, Intel, more expensive is better.

    --
    Anonymous Cowards - Oh God, How I hate you
  42. Missing the point by raduf · · Score: 2, Insightful


    I've read most of the comments so far and they don't seem to get the point of the article.
    The point is that except for a limited class of applications (multimedia, games), most of the things you can do on tommorow's computers you can do on today's. And that it's becoming incresingly expensive to follow Moore's law while it's less and less necessary.

    Much more important will probably become the price and maybe other factors (versatility? miniaturisation? power consumption?). Imagine dirt-cheap wireless chips and p-3 like microprocessors. Think about the applications for a moment.
    With the right protocols in place it could mean unlimited bandwith anytime anywhere, just for starters.

    When the world will be 100% computerized it won't be because of supercomputers. It'll be because of cheap small chips and smart software.

  43. Moore's Extension? by Tikiman · · Score: 2, Funny

    Apparently nobody has noticed the Sony Bono Moore's Law Extension Act, which retroactively extended Moore's Law an additional 10 years after Moore's Law was due to expire

  44. IT isn't everything. by Noren · · Score: 3, Insightful
    This arguement is ignoring a major point. Sure, home PCs, web servers, search engines, databases may all get fast enough that further computational speed is irrelevant.

    But when computers are used for crunching numbers we still want machines to be as fast as possible. Supercomputers still exist today. Countries and companies are still spending millions to build parallel machines thousands of times faster than home PCs. They're doing this because the current crop of processors is not fast enough for what they want to calculate.

    Current computational modeling of the weather, a nuclear explosion, the way a protein folds, a chemical reaction, or any of a large number of other important real-world phenomena is limited by current computational speed. Faster computers will aid these fields tremendously. More power is almost always better in mathematical modeling- I don't expect we'll ever get to the point where we have as much computational power as we want.

  45. Re:One size does not fit all by Queuetue · · Score: 3, Funny

    Nice ad. I certainly hope that posting your company's name brings in the revenue boost you were hoping for.

    If I ever need some "Enterprise Web Site Content Management" or some "Site Search Engine Solutions," or even perhaps a website that uses broken javascript to navigate improperly, I'll give you a call.

  46. Other implications of Moore's law by hey! · · Score: 3, Insightful

    Moore's law not quite what most people think. If I'm not mistaken, it isn't that processor power will double every eighteen months, but that transsistor density will double. Processsor speed doubling is a side effect of this.

    I think there will always be a market for the fastest chips possible. However, there are other ways for this trend to take us rather than powerful CPU chips. These would include lower power, lower size, higher system integration, and lower cost.

    The EPIA series mini-ITX boards are an example of this. Once the VIA processors get powerful enough to decode DVDs well, it is very likely that they won't need to get more powerful for most consumer applications. However, if you look at the board itself (e.g. here),
    you'll see that component count is stil pretty high; power consumption, while small, still requires a substantial power supply in the case or a large brick.

    When something like this can be put together, capable of DVD decoding, having no external parts other than memory (and maybe not even that), and the whole thing runs on two AAA batteries, then you'd really have something. Stir bluetooth (or more likely its sucessors) into the mix and you have ubiquitous computing, capable of adapting to their environement and adapting the environment to suit human needs.

    --
    Post may contain irony: discontinue use if experiencing mood swings, nausea or elevated blood pressure.
    1. Re:Other implications of Moore's law by skeedlelee · · Score: 2, Insightful

      I'm about to rant a little here.

      IIRC, there an article a while back (discussed here) that reviewed Moore's law, as Moore used it over a number of years and found that Moore himself seemed to redefine it every couple years. It's a marketing term which describes the general phenomenon of faster computers getting cheaper in a regular way.

      You're right though, Moore never really talked about doubling of 'processor power,' he discussed things in terms of devices such as transistors. Trouble is sometimes RAM was included in the 'device' total sometimes not... it's easy to fudge a bit during the slow downs and speed ups if you change how the thing is defined.

      Top it off with the fact that the whole thing was eventually cast in terms of the cost optimal solution. Given the degree to which the size of the market for computers has changed I'd say that this is a very difficult thing to define. As everyone is likely to point out, commodity desktop PC's have a very different optimum from massive single-system image computers. Of course, if you consider that a calculator is a computer, be they $1 cheapo's or the latest graphing programable whoopdeedoo they are all computers. There are so many markets for computers now, each with their own optimum that it's pretty artificial to talk about Moore's law at all. I've never seen anyone plot out Moore's law with a bunch of branches. Further, cost optimal becomes pretty subjective in all the markets when there are so many variables. Finally, there are points where Moore's law breaks down... the number of devices in cheapo calculators probably hasn't changed much in the last few years, but the price changes. Moore's law doesn't really allow for this sort of behavior, that there is a maximum necessary power for a certain kind of device, if it doesn't have to do anything else, then the complexity levels off and the price goes down. This may well happen at some point in the commodity sector. It is possible that the number of features in a conventional desktop will level off at some point. Hell with a $200 WalMart cheapo PC, maybe we're there now...

      Intuitively, everyone applies Moore's law to desktops but there's no particular reason to do so. Considering the history of it the massive mainframe style computer is probably the best application of it, but this is seldom done. Mainframes these days can be a complex as you're willing to pay for, which pretty much means that there is a cost optimal solution for an given problem, not just for fabrication, which is what Moore was talking about. Seems like we have turned a corner, it's time to redefine Moore's law yet again.

  47. how does google's comment violate moore's law? by k2enemy · · Score: 2, Interesting
    moore's law says nothing about the speed or power of a chip, only the density of transistors. if you hold the size of the chip constant, the number of transistors can increase, or if you hold the number of transistors constant, the size of the chip can decrease.

    if google uses a large number of low speed chips, they will still benefit from smaller sized chips with lower power consumption and lower price.

  48. He maintained an emacs fork; he was no slouch. by emil · · Score: 2, Informative

    While you may validly question his business acumen, he has worked with RMS, JWZ, and knows everybody. He is a reasonable coder and a team player; we need more of him.

  49. This has happened before! by HiThere · · Score: 3, Insightful

    The mainframes basically stopped at 32 bits. There were models that went to 128 bits, and CDC liked 60 bits, but the workhorse (IBM 360, etc.) never went beyond 32 bits.

    Perhaps the next step instead of being towards larger computers will be towards smaller ones. Moore's law remains just as important, but the application changes. Instead of building faster computers, you build smaller, cheaper ones. The desktops will remain important for decades as the repository of printers, large hard disks, etc. And the palmtops/wristtops/fingernailTops/embedded will communicate with them for archiving, etc.

    This means that networking is becoming more important. This means that clusters need to be more integrated. I conceive of future powerful computers as a net of nets, and at the bottom of each net is a tightly integrated cluser of cpus, each more powerful than the current crop. These are going to need a lot of on-chip ram, and ram attached caches, because their access to large ram will be slow, and mediated through gatekeepers. There will probably be multiported ram whiteboards, where multiple cpus can share their current thoughts, etc.

    For this scenario to work, computers will need to be able to take their programs in a sort of pseudo-code, and re-write it into a parallelized form. There will, of course, be frequent bottle necks, etc. So there will be lots of wasted cycles, but some of them can be used on other processes with lower priority. And at least each cluster will have one cpu that spends most of it's time scheduling. etc.

    Consider the ratio between gray matter and white matter. I've been told that most of the computation is done in the gray matter, and the white matter acts as a communications link. This may not be true (it was an old source), but it is a good model of the problem. So to make this work, the individual processors need to get smaller and cheaper. But that's one of the choices that Moore's law offers!

    So this is, in fact, an encouraging trend. But it does mean that the high end cpus will tend to be short-term solutions to problems, faster at any particular scale of the technology, but too expensive for most problems, and not developing fast enough to stay ahead of their smaller brethern. Because they are too expensive to be used in a wasteful manner.

    Perhaps the "final" generation will implement these longer word length cpus, at least in places. And it would clearly use specialized hardware for the signal switchers, just as the video cards use specialized hardware, though they didn't at first. But the first versions will be built with cheap components, and the specialized hardware will only come along later, after the designs have stabilized.

    --

    I think we've pushed this "anyone can grow up to be president" thing too far.
  50. Article Full of Overblown Rhetoric by lamz · · Score: 2, Insightful

    This article is full of overblown rhetoric. It goofily applies Moore's Law to too many other things, like Dot-coms. Note that at no point in the article is Moore's Law clearly stated -- it would spoil too many of the article's conclusions.

    That said, I remember the first time I noticed that technology was 'good enough,' and didn't need to double ever again: with the introduction of CDs, and later, CD-quality sound cards. Most people are not physically capable of hearing improvements if the sampling rate of CDs is increased, so we don't need to bother. Certainly, people tried, and the home theatre style multi-channel stuff is an improvement over plain stereo CDs, but it is an insignificant improvement when compared to CDs over older mono formats. Similarily, the latest SoundBlaster cards represent an insignificant improvement over the early beeps of computers and video games. (Dogs and dolphins might wish that audio reproduction was improved, but they don't have credit cards.)

    Back in the early 80s, when most bulletin board access was by 300 baud modem, paging of long messages was optional, since most people can read that fast. Of course, we need faster modems for longer files and applications, but as soon as say, HD-quality video and sound can be streamed at real-time speeds, then bandwidth will be 'enough.'

    --

    Mike van Lammeren
    It will challenge your head, your brain, and your mind.

  51. Real-Time Cross Platform Video Processing by RobPiano · · Score: 2, Interesting

    I am currently doing real-time video processing for a digital musical instrument (video tracking of a performer). The video is processed on a PC with mediocre specifications and the audio is processed via OSC on a decent G4 on the other side of the room.

    Could I use a faster computer to do this? Yeah I suppose so, but really speed and bit size don't matter much. Hell, I don't get true 24 bit audio using a 24 bit card. What I need is quieter, STABLE machines that communicate with each other quickly. I need hard disks that do not crash (already lost one on a brand new G4), I need gigabit that is really gigabit, and a slew of other practicle things. None of them involve a faster processor or 32 more bits.

    Computers will get faster yes, but really the MHz battle is over in my mind. I need all the other technology to become more stable and the less glamourous bottle necks to be overcome.

    Soon!

    -Rob

  52. But what if Moores law is too slow? by argoff · · Score: 3, Interesting


    Everyone seems to be acting like Moore's law is too fast, that over the next centruy our technology could never grow as fast as it predicts. However, consider for a moment that perhaps it's too slow, that technology can and will grow faster than it's predictions like it or not. Yes silicon has limits, but physics wise - there is no law I know of inherent in the universe that says mathematical calculations can never be calculated faster than xyz, or the rate of growth in calculation ability can never accellerate faster than abc. These constraints are defined by human limits, not physical ones.

    In fact, it could be argued that Moore's law is slowing down progress because inverstors see any technology that grows faster than it predicts as too good to be true, and therefore too risky to invest in. However, from time to time when companies have been in dire straights to outdo their competitors "magical" things have happened that seem to have surpassed it for at least brief periods. Also, from what I understand, the rate of growth in optical technology *IS* faster than moores law, but people expect it to fizzle off when it reaches the abilities of silicon - I doubt it.

    The last time Intel was declaring the death of Moores law was when they were under heavy attack from predictions that they couldn't match advances in RISC technology. Funny, when they finally redesigned their CPU with RISC underpinnings - these death predictions silently faded away. (at least till now) I wonder what's holding them back this time?

    1. Re:But what if Moores law is too slow? by jbischof · · Score: 2, Interesting
      I read an article a while back about the theoretical limits of computers.

      Contrary to what some people think, quantum physics and thermodynamics define the limits of what a computer can do.

      For example, you can't send data faster than the speed of light, and you can't have two memory blocks closer together than one plank's constant. Likewise you cannot store more information than the total amount of information in the universe etc. etc.

      According to physics as it is today, there are dead ends for computers where they cannot get any faster, bigger, or more powerfull. We may never reach those limits, but they still exist.