Slashdot Mirror


Has Supercomputing Hit a Brick Wall?

anzha writes "Horst Simon, Deputy Director of Lawrence Berkeley National Laboratory, has stood up at conferences of late and said the unthinkable: supercomputing is hitting a wall and will not build an exaFLOPS HPC system by 2020. This is defined as one that passes linpack with a performance of one exaFLOPS sustained or better. He's even placed money on it. You can read the original presentation here."

185 comments

  1. It is tough by cold+fjord · · Score: 2

    You can't really make factor 10 improvements indefinitely. Eventually the numbers overwhelm you and you hit roadblocks. The only real solution will ultimately be new computing technology, such as quantum computers.

    --
    much of left-wing thought is a kind of playing with fire by people who don't even know that fire is hot - George Orwell
    1. Re:It is tough by Anonymous Coward · · Score: 1

      Why not just make a Beowulf cluster?

    2. Re:It is tough by Anonymous Coward · · Score: 1

      It depends greatly on what you define as "a computer." In the single-core, single-cpu days (which never really existed, due to the complicated supporting hardware that gets overlooked), the fear was that Moore's Observation (not a law, learn the difference) would run into a hard cap when circuitry sizes were small enough that quantum unpredictability would become a significant factor.

      The reality that happened (long before that expected challenge) is that computing emphasis changed from 'doing one thing really fast' to 'doing 2 things fast', then 4 things, then 8 things, etc. So the transistor count has been outperforming the observation, but nothing dramatic yet.

      And the teal deer/conclusion:
      It's a lot easier to get a headline and some ad views by saying that something is impossible than admitting it will probably happen, but might be behind schedule.

    3. Re:It is tough by jones_supa · · Score: 1

      Or an openMosix cluster. :P

    4. Re:It is tough by unixisc · · Score: 2

      The problem is extracting parallelism. What is there to stop one from building, say Itanium based MPP systems and tossing more CPUs into the mix, using either an unified memory architecture, or distributed memory architecture? Point is that it won't speed up computing beyond a point simply because there ain't that much of parallelism in most processes.

    5. Re:It is tough by Anonymous Coward · · Score: 0

      Moore's Observation (not a law, learn the difference)

      What's the difference? All laws in science are observations. Changing the name here is short sighted and trying to suggest Moore's law is special, when really people should learn there is a chance that any law in science is potentially fallible. Just the yesterday there was another thread where someone was trying to suggest Ohm's law was fundamental and inviolable based on its name, instead of realizing it is a observation that has a limited domain.

    6. Re:It is tough by Anonymous Coward · · Score: 0

      It's hard to find a super-computer that doesn't use a lot of parallelism. What super-computer applications are you thinking of that don't benefit from parallelism?

    7. Re:It is tough by OakDragon · · Score: 2, Interesting

      Why not just make a Beowulf cluster?

      Can you imagine?

    8. Re:It is tough by fisted · · Score: 3, Funny

      > Just the yesterday there was another thread where someone was trying to suggest [...] instead of realizing [...].

      What?! Someone was wrong on the Internet?

    9. Re: It is tough by Anonymous Coward · · Score: 0

      The point he is making is even with embarrassingly parallelizable tasks, there is a maximal limit to the performance gained by throwing more cores at a problem. That is true of any process. Amdahl's law if you are interested in the theory.

    10. Re:It is tough by Anonymous Coward · · Score: 0

      Good job on catching that grammar error. Thanks to fisted, for his efforts in pointing out people that are wrong on the internet.

    11. Re:It is tough by gman003 · · Score: 2

      Memory latency. Beowulf clusters are good for things that are highly parallel *and* have a high degree of memory locality, ie. you rarely need to make memory calls between boxes.

      True supercomputers use high-speed interconnects between systems for this reason, usually using something like Infiniband or a weird proprietary system, and usually with some network topology with numerous inter-system links. This gives them much lower latency when one system uses data in memory in another system.

    12. Re:It is tough by maxwell+demon · · Score: 1
      --
      The Tao of math: The numbers you can count are not the real numbers.
    13. Re:It is tough by ChrisMaple · · Score: 1

      Moore's Approximation is already known to be defective for several reasons.
      Saying that "All laws in science are observations" is untrue. Eventually, laws in science are based on observations, but to say they're they same thing attempts to shortcut and denigrate the steps needed to get from observation to law.

      --
      Contribute to civilization: ari.aynrand.org/donate
    14. Re:It is tough by kmoser · · Score: 1

      Moore's Law Horst's Wall

  2. No? by oGMo · · Score: 4, Informative

    "Japan to develop new exaflop computer by 2020" ... why not? And if it's even a few microseconds into 2021 I suppose that supercomputing has failed, will pack up, and go home.

    --

    Don't think of it as a flame---it's more like an argument that does 3d6 fire damage

    1. Re:No? by Anonymous Coward · · Score: 0

      Japan has a record of aborted computing projects, notably in software. Their hardware successes have been evolutionary, not revolutionary. It's not clear why they haven't not produced a Noyce or Kirby (or Bernerr-Lee, Hopper, KNuth, ...) I'm not holding my breath.

    2. Re:No? by oGMo · · Score: 2

      Sure but they're one of many. Even if one of the many don't accomplish this, surely another will. If not by (or before!) 2020, sometime later. People aren't just going to give up if it doesn't happen by some arbitrary date. This is my real point.

      These days, how much is really revolutionary anyway? So many new supercomputing announcements are "we threw N parts at this, so it's Yflops".

      --

      Don't think of it as a flame---it's more like an argument that does 3d6 fire damage

    3. Re:No? by Anonymous Coward · · Score: 0

      The argument presented is that it will not happen by 2020. Not that it will never happen. We're talking 7 years here. And this is not a new comment from this guy, or even other people in the field.

      http://iee.ucsb.edu/files/12Horst%20Simon.pdf

      And Japan is not one of many. For things on this scale, they are one of very few.

    4. Re:No? by gentryx · · Score: 5, Informative

      Power consumption and MTBF: power consumption (high operating costs) be solved perhaps be solved by a larger budget, but the mean time between failures (MTBF) means, that the machine will fail before it can compute anything meaningful. Right know the machines we build, and even more importantly, the software we build rely on all parts of the machine to function. If even a single node fails, then the data it holds becomes inaccessible and the rest of the compute job crashes like a house of cards.

      This can be remedied by taking frequent snapshots and then restarting from the last snapshot, but the time for checkpoint/restart has been continuously growing for the last systems. No one really expects exascale systems to do full system checkpoint/restart in a reasonable time frame. They'd spend more time taking snapshots than actually computing.

      Source: I'm doing my PhD in supercomputing.

      --
      Computer simulation made easy -- LibGeoDecomp
    5. Re:No? by oGMo · · Score: 1

      Yes, and that there is a "brick wall". First, the article may be wrong; exascale might hit by (or before) 2020. They've got 7 years. That's a long time in terms of technology; the first teraflops supercomputer was 1996, merely 17 years ago. Speed increase can't happen indefinitely, but we're not talking about indefinitely, just exaflops. Even if this is not achieved by 2020, they have not hit a "brick wall", because development will continue until it is achieved. There is nothing even slightly theoretical making exaflops unachievable.

      In short, even if the article is right, it's wrong.

      --

      Don't think of it as a flame---it's more like an argument that does 3d6 fire damage

    6. Re:No? by Anonymous Coward · · Score: 0

      Ha Ha http://en.wikipedia.org/wiki/Fifth_Generation_Computer_Systems_project
      If you want to believe anything that comes from Japan.

    7. Re:No? by Anonymous Coward · · Score: 0

      In short, even if the article is right, it's wrong.

      Well, that's hard to argue with.

    8. Re:No? by Anonymous Coward · · Score: 0

      maybe they can finally get their Fifth Gen project to run on it.

    9. Re:No? by unixisc · · Score: 1

      One of the factors that would allow the MTBF to go up exponentially is the operating frequency, and if a system tosses more CPUs into it, the system designer can underclock it so that the MTBF is significantly increased. In the meantime, work can be done in extracting more parallelism out of the software and running it on more CPUs, so that overall performance doesn't take a hit. Underclocking also helps a bit with the power consumption, although not enough to compensate for the extra CPUs being tossed into the mix.

    10. Re:No? by Nutria · · Score: 1

      Control units don't heartbeat individual nodes? They aren't designed to monitor and restart the unreported work of a failed node?

      Frankly, I'm shocked.

      --
      "I don't know, therefore Aliens" Wafflebox1
    11. Re:No? by gentryx · · Score: 1

      Citation needed? I don't see why nodes would suffer ("exponentially") fewer hardware failures if clocked lower.

      --
      Computer simulation made easy -- LibGeoDecomp
    12. Re:No? by rasmusbr · · Score: 1

      What about the idea that was popular a few years ago about making stuff fail gracefully, both at the hardware level and the software level, so that the system could swallow the error and go on calculating without completely ruining the result? Could failures be reduced to essentially just another source of error?

    13. Re:No? by unixisc · · Score: 1

      I was wrong about exponentially, but I do recall reading that in college in our computer system design course. Googling for it, I found this equation, which shows how as the clock frequency of the flip-flops decrease, the MTBF would increase. Inversely proportional, though, not exponential.

    14. Re:No? by Forever+Wondering · · Score: 2

      You might need to broaden your research beyond what is available in the academic literature. Google handles redundancy. When they do a map/reduce, the clusters are self forming. If a cluster leader/master goes down, the cluster reelects a new master. They trust the integrity of nothing. Not even DRAM. They checksum everything. The actual architecture of Google's data centers is a closely guarded trade secret, but from what [little] I've been able to glean, they're light years ahead of "big iron" vendors such as Cray. Likewise for Amazon and [even] Facebook.

      Also, there are some systems in development where the individual compute cells are modeled on neural networks. This is in relation to the power consumed. The cells use a bare fraction of the most low power cores (even Intel's Haswell/trigate), something like 100x or higher.

      You might be astonished by this, but you're not alone. Students that do PhD's in information search get to Google. They find out that the best knowledge they have is 10 years out-of-date compared to what Google does internally.

      --
      Like a good neighbor, fsck is there ...
    15. Re:No? by Digi-John · · Score: 1

      The thing about scientific computing is that scientists like to write MPI and Fortran. They just love that shit. And they are traditionally really resistant to any new programming model. So when you tell them they need to start using XYZ instead of MPI so their programs can actually complete at exascale *before* hardware failure, they get unhappy and instead implement things like checkpoint/restore that takes 70% of the runtime. Source: I work in HPC.

      --
      Klingon programs don't timeshare, they battle for supremacy.
    16. Re:No? by Anonymous Coward · · Score: 0

      I think the Japanese project is too optimistic and hence it might fail. On the other hand, exaflops is not out of range either. Typically, the semiconductor performance increases by a factor of 10 when line width is halved. K's processors were built using 45 nm. It is likely that 14nm will be in production by 2020, in that case, we can see improvement by a factor of 40 or 400 petaflops at around the same price as K. Japan wants to build exaflops machine at a price below K and that may not work, but at the same time, it is quite conceivable that someone will spend USD 2.5 billion (K's cost was about USD 1 billion) to make exaflops machine. Also, using GPU, certain operations can be accelerated (not sure if linpack falls in that category), so that can help lower cost as well.

    17. Re:No? by vidnet · · Score: 1

      When they do a mapreduce, each node might take minutes or hours to do work.

      I'm sure they have processes that require fine grained, millisecond parallelization, but mapreduce is not one of them.

    18. Re:No? by TheInternetGuy · · Score: 1

      The thing about scientific computing is that scientists like to write MPI and Fortran. They just love that shit. And they are traditionally really resistant to any new programming model. So when you tell them they need to start using XYZ instead of MPI so their programs can actually complete at exascale *before* hardware failure, they get unhappy and instead implement things like checkpoint/restore that takes 70% of the runtime. Source: I work in HPC.

      Changing from FORTRAN would require us to actually try to comprehend decades worth of scientific data stored in FORTRAN data files. Ain't no one got time fo' that.

      --
      If my comment didn't sound as good in your head as it did in mine, then I guess we all know who's to blame
    19. Re:No? by tibit · · Score: 1

      Presumably no matter what the memory size is on any node, it could be doubled, and presumably the bandwidth on that memory is such that duplicating the contents of one half of the memory to the other half would take a reasonable amount of time (say 0.1-1s). You can then dump the second copy over a dedicated bus without slowing down the computations. Even if the bus wasn't dedicated, the bandwidth will be curtailed by the hard drive array you use for long-term snapshot storage - so it may, say, eat 10% of your overall memory bandwidth. I wouldn't scoff at snapshots that only take 10% of the time of a supercomputer, if you still save time compared to restarting failed computations from scratch. If.

      --
      A successful API design takes a mixture of software design and pedagogy.
    20. Re:No? by tibit · · Score: 1

      For good checkpoint/restore, you probably need a custom node design that would accommodate it efficiently, but I can't see why it'd have a 70% overhead. Doing a copy of your memory contents to another memory that has same bandwidth and capacity, and then lazily moving that off-node without the main CPU being involved is no biggie. You probably could implement the memory bridge and the recover CPU on a simple FPGA. The main, fast CPU is crunching numbers, then stops, the FPGA takes a memory copy, the main CPU resumes, then the FPGA and the service CPU can keep the data locally on the node until the node fails and the snapshot contents are to be transferred to a replacement node. If one is doing linear algebra on a node only using linpack/lapack style stuff, then probably a GPU or an FPGA/ASIC would be more efficient than any off-the-shelf CPU anyway.

      --
      A successful API design takes a mixture of software design and pedagogy.
    21. Re:No? by ChrisMaple · · Score: 1

      You are misinterpreting and misapplying the data on metastability to computer systems. Once data is inside a synchronous system that isn't being clocked so fast that data isn't fully settled at flipflop inputs, slowing the system isn't going to enhance reliability. (Similarly, if you're running a synchronous system much too fast, not even a single instruction will execute properly.)

      Metastability is a concern for asynchronous inputs. There are techniques for dealing with it, although it becomes tricky as data rate approach clock rate.

      --
      Contribute to civilization: ari.aynrand.org/donate
    22. Re: No? by Anonymous Coward · · Score: 0

      node failure is not a big issue for shared nothing algorithms, and can be dealt with fairly inexpensively for explicit communication algorithms, especially if there is reasonably frequent barrier synchronization. only large shared memory computation need be checkpointed en-bloc... and this is pretty rare these days....

    23. Re:No? by PingPongBoy · · Score: 1

      > MTBF ... the machine will fail before it can compute anything meaningful

      MTBF is statistical though. This can be overcome. Look at it this way. Surely the totality of servers on the Internet would exceed exascale computing power but how many servers fail at any instant in time? Perhaps a few. Ok, but somehow when I surf to my favorite sites, they are almost always up. That means they are doing something to keep them reliable. Such measures may increase the cost of each node but if you want to achieve the necessary uptime in order to finish the job, that would be required.

      Node reliability might receive less investment for the sake of keeping nodes compact though. So it comes down to the manufacturers to increase MTBF for all consumers. And assemblers have to be careful not to slam the hardware around

      Also, each node or cluster has to be periodically tested or probed to determine whether it is reliable. If a node or cluster can perform a calculation reliably at random times, then the results from the node may be deemed correct. If not, then the circumstances that cause the node to misbehave may have to be worked around or the node has to be replaced. A highly reliable system may emerge.

      The exascale system will be built but there may be a limit on the number of nodes that any organization is willing to pony up for because if there is a huge leap of size from the previous #1 system, there is the obvious expense to consider as well as the obsolescence factor as new technology makes the same speed achievable for less only a few years later.

      --
      Know your pads. One time pad: good for cryptography. Two timing pad: where to take your mistress.
    24. Re:No? by gentryx · · Score: 1

      Supercomputing is different from the web. If one node in a supercomputer fails, the whole system fails.

      --
      Computer simulation made easy -- LibGeoDecomp
  3. uhmmm.. by iLogic · · Score: 1

    Does that mean we get to play super breakout with them?

    1. Re:uhmmm.. by Anonymous Coward · · Score: 0

      Dunno... maybe that's in the presentation.

      Nice link... Google Docs? A pdf it can't preview, and too big to scan for viruses? Really?

  4. Challenge Accepted by Anonymous Coward · · Score: 0

    Just saying sounds like a dare....

    1. Re:Challenge Accepted by Anonymous Coward · · Score: 0

      The $10,000 challenge by Alexander Peter Kowalski.

  5. Ha, not the first by Anonymous Coward · · Score: 0

    He wouldn't be the first to declare the death of Moore's law. And I'd be willing to bet he wont be the first to be wrong.

    1. Re:Ha, not the first by ssam · · Score: 5, Insightful

      moore's law only talks about transistor counts. building a supercomputer means getting thousands of CPUs to cooperate which is a much harder challenge.

      Anyone (with a large wallet) can stick an exoflop worth of CPUs in a large room. by 2020 you'll be able to do that with a not so large wallet. but that does not result in a useful exoflop computer

    2. Re:Ha, not the first by wagnerrp · · Score: 2

      Right. When it comes to supercomputing, the network is just as important, if not more so, than the nodes it connects. Grid computers like the various @Home projects are far and away more powerful than anything on the TOP500 list, but that doesn't make them supercomputers.

    3. Re:Ha, not the first by fuzzyfuzzyfungus · · Score: 5, Insightful

      It's a particular nuisance because the speed of light is pretty strictly enforced...

      Even if you went full-on-nuts and replaced fiber interconnects with little tubes full of hard vacuum, to squeak out that slight improvement over the speed of light in glass or air, you'll still see latency that meaningfully hinders the cooperation of multi-GHz CPUs and RAM across systems of any nontrivial size.

      For loosely coupled problems, that barely matters; but not all problems are loosely coupled.

    4. Re:Ha, not the first by Anonymous Coward · · Score: 1

      moore's law only talks about transistor counts. building a supercomputer means getting thousands of CPUs to cooperate which is a much harder challenge

      There's also the amount of electricity required. Continued increases in supercomputering FLOPs is very much tied to power-efficient computing.

    5. Re:Ha, not the first by Bengie · · Score: 1

      I wonder if network bandwidth and latency is creating issues with Amdahl's law and the type of useful algorithms.

    6. Re: Ha, not the first by Gilmoure · · Score: 1

      Not to mention data storage and transmission. That's the thing that's currently causing headaches: petabyte /scratch systems that don't go down when you look at them sideways and then similar systems to hold all that crap you just dumped on /scratch!

      --
      I drank what? -- Socrates
    7. Re:Ha, not the first by fuzzyfuzzyfungus · · Score: 4, Insightful

      I'm no expert on the refined world of supercomputers; but my money would be on latency. If you are made of money, bandwidth is a problem that you can substantially brute force. Not 100% efficiently; and layout gets to be a real headache; but if the state of the art in serial interconnects isn't good enough, you can bolt a bunch of them together and have a parallel interconnect(it'll be harder to do board layout for, the wiring will suck more, and it'll cost more; but the major sticking point is money).

      If you want to cut latency, even the most exotic photonics-on-die-with-hollow-fiber arrangement imaginable still gives you surprisingly short distances before you start losing CPU cycles to waiting for the return photon.

    8. Re:Ha, not the first by swillden · · Score: 3, Interesting

      building a supercomputer means getting thousands of CPUs to cooperate which is a much harder challenge.

      Looking at his presentation, that seems to be his point. He concludes that power efficiency is going to become the limiting factor driving design decisions, and that since the power cost of increasing FLOPS has been so much lower than the power cost of moving larger quantities of data we're heading into an era where connectivity costs will so dominate the cost of cycles that cycles will be essentially free.

      Hes's then basically arguing that it won't be cost-effective to build data transmission architectures that can effectively utilize exaflops, so no one will bother to build an exaflop machine.

      He didn't state it, but if the rest of his arguments are correct, perhaps we're going to see the definition of a new metric for HPC, one that somehow captures the ability of a machine to distribute data to its computation nodes.

      --
      Note to ACs: I usually delete AC replies without reading them. If you want to talk to me, log in.
    9. Re:Ha, not the first by Anonymous Coward · · Score: 0

      For loosely coupled problems, that barely matters; but not all problems are loosely coupled.

      Well, fortunately linpack is loosely coupled where RAM speed and amount of RAM and processor speed trump interconnect speed. And that is the metric at this time.

    10. Re:Ha, not the first by Anonymous Coward · · Score: 0

      You should read Horst's presentation first. All things can be solved by brute force if you have unlimited money and unlimited power. However, given the finite resources in power and $'s, solving these problems in a practical manner is substantial.

      Regarding latency, large-scale parallel codes use many techniques such as asynchronous communication and ghost cells to hide latency. It is definitely a problem, but there are well understood techniques to deal with it.

      For previous post, look at Little's Law.

    11. Re:Ha, not the first by Anonymous Coward · · Score: 0

      Regarding latency, large-scale parallel codes use many techniques such as asynchronous communication and ghost cells to hide latency. It is definitely a problem, but there are well understood techniques to deal with it. Look up Little's Law, which describes the basic principles of how concurrency can be used to hide latency.

      Latency is always a challenge, but power efficiency and cost are more urgent issues.

    12. Re:Ha, not the first by ebno-10db · · Score: 1

      It's a particular nuisance because the speed of light is pretty strictly enforced...

      Obviously most physicists have a police state mentality, but the anarchist physicists say we should use wormholes!

    13. Re:Ha, not the first by maxwell+demon · · Score: 1

      If you go to that level, why not go the full way and implement closed timelike curve computing?

      --
      The Tao of math: The numbers you can count are not the real numbers.
    14. Re:Ha, not the first by Anonymous Coward · · Score: 0

      More than that, people used to fill rooms with computers to get 1000th of the performance of the basic workstation I'm typing this on. If we can't have exaflop supercomputers in 2020, we'll just wait until 2030 when they are on our desktops.

    15. Re:Ha, not the first by Anonymous Coward · · Score: 0

      For something like an i5, the ALUs consume about 10% of the CPU power. The rest is prediction/data movement/caching/etc.

    16. Re:Ha, not the first by swillden · · Score: 1

      For something like an i5, the ALUs consume about 10% of the CPU power. The rest is prediction/data movement/caching/etc.

      That's fascinating. Thanks.

      --
      Note to ACs: I usually delete AC replies without reading them. If you want to talk to me, log in.
  6. "Swim Lanes" by Anonymous Coward · · Score: 0

    The first time I've heard that metaphor for competing technologies. Nice.

  7. Silly Walls by thechemic · · Score: 1

    If it did, it would rapidly calculate a way over, under, around or through it.

    --
    Let's make like a bird... and get the flock outta here.
  8. Re:Happy Tuesday from The Golden Girls! by Anonymous Coward · · Score: 0, Offtopic

    It's confident, dipshit.

  9. Were blaming the wrong things. by Anonymous Coward · · Score: 0, Insightful

    Supercomputing has hit a brick wall, and yet for some reason we keep blaming the construction company that built the wall, not the reckless driver who hit it.

    1. Re:Were blaming the wrong things. by Rhinobird · · Score: 0

      I'm not sure if you're in the wrong thread or not...

      Mayan Pyramid In Belize Leveled By Construction Crew

      --
      If Mr. Edison had thought smarter he wouldn't sweat as much. --Nikola Tesla
  10. I didn't RTFA, nor am I technical... by Gordo_1 · · Score: 1

    ...but I can pretty much guess where this is going. If you look at the massive parallelization improvements we've witnessed among supercomputers over the past couple decades, you can predict that at some point, most of the low hanging fruit would eventually be picked at which point the underlying latency between interconnects would start to become a limiting factor. Couple that with the fact that there's been a complete lack of significant performance improvement in desktop/server CPU space in say the past 5 years and you can predict that it wouldn't be long before we'd see a leveling off of the supercomputer performance curve.

  11. RTFP by Megahard · · Score: 1

    He doesn't say it's not possible, rather we can't get there by just extending current technology. So by extension, 2020 is too soon to expect exaflops. He also presents arguments why exaflops is important and work to get there should continue.

    --
    I eat only the real part of complex carbohydrates.
  12. If you ignore the best news in supercomputing ... by quax · · Score: 1

    ... I guess you may be excused to think it hit a brick wall. Alternative technology has fortunately already matured, and is commercially available.

  13. Clarke's Three Laws by Tokolosh · · Score: 5, Interesting

    Clarke's Three Laws are three "laws" of prediction formulated by the British writer Arthur C. Clarke. They are:

    1. When a distinguished but elderly scientist states that something is possible, he is almost certainly right. When he states that something is impossible, he is very probably wrong.
    2. The only way of discovering the limits of the possible is to venture a little way past them into the impossible.
    3. Any sufficiently advanced technology is indistinguishable from magic.

    --
    Prove anything by multiplying Huge Number times Tiny Number
    1. Re:Clarke's Three Laws by Anonymous Coward · · Score: 2, Insightful

      So, since Freeman Dyson said "Faster-than-light travel is rubbish" that means he's probably wrong, and we'll be warping around the galaxy soon enough?

    2. Re:Clarke's Three Laws by Anonymous Coward · · Score: 2, Funny

      he should stick to building vacuum cleaners.

    3. Re:Clarke's Three Laws by kevkingofthesea · · Score: 1

      To be fair, the first law doesn't say anything about how long it will take to prove him wrong, nor does it even say he will be proven wrong - only that he probably will be.

    4. Re:Clarke's Three Laws by X0563511 · · Score: 1

      You don't seem to understand the "concept" behind "warp."

      You are not exceeding the speed of light, you are just not traveling the linear distance between the two points.

      --
      For large sets, this will be our guide even unto death, for the LORD will work for each type of data it is applied to...
    5. Re:Clarke's Three Laws by Anonymous Coward · · Score: 0

      You don't seem to understand the effect of "FTL". It doesn't matter if you warped, teleported or used some wormhole - for external observer you have exceeded speed of light and it isn't any different from violating causality or time travel.

    6. Re:Clarke's Three Laws by geekoid · · Score: 1

      3 - I have always hated that one, becasue it's wrong. It's been wrong since the scientific method was put into place.

      I can see a floating disk and know it's science and engineering that created it. In fact, we could use that to figure out how it works.

      Not understanding something doesn't mean it's magic.

      --
      The Kruger Dunning explains most post on /. http://en.wikipedia.org/wiki/Dunning%E2%80%93Kruger_effect
    7. Re:Clarke's Three Laws by VortexCortex · · Score: 1

      3 - I have always hated that one, becasue it's wrong. It's been wrong since the scientific method was put into place.

      I can see a floating disk and know it's science and engineering that created it. In fact, we could use that to figure out how it works.

      Not understanding something doesn't mean it's magic.

      With sufficiently advanced technology I could emulate your brain and this planet within a much larger supercomputer. What if I counfound your scientific method and make the observable universe as crazy as the rules of magic. A being within said simulation could be given access to the voice-activated debugger mode, and when he spoke the 'magic' words, you could suddenly find yourself crawling about as a newt.

      So, no, you're wrong. Clark's third law is correct, and always shall be.

    8. Re:Clarke's Three Laws by tgd · · Score: 3, Funny

      You don't seem to understand the "concept" behind "warp."

      You are not exceeding the speed of light, you are just not traveling the linear distance between the two points.

      That's like saying that he doesn't understand the concept behind a Stargate. Made up is made up is made up.

      You can't have an honest discourse on the speed if light when you're trying to involve fiction. You might as well go full star trek and say that thetalon radiation transmorphs subspace and changes the value of C, but only in the presence of an extradimensional rift, and if-and-only-if you have a humpback whale.

    9. Re:Clarke's Three Laws by Anonymous Coward · · Score: 1

      Not understanding something doesn't mean it's magic.

      Isn't that the whole point of the law, to push that idea? If you try to qualify what would count as magical to you, there may be technology down the line that will appear the same, and would be indistinguishable without playing catch up. I thought the whole point of the law was not that lack of understanding makes something magic, but that because something looks like magic, it means you probably don't understand it enough yet.

    10. Re:Clarke's Three Laws by gl4ss · · Score: 1

      You don't seem to understand the "concept" behind "warp."

      You are not exceeding the speed of light, you are just not traveling the linear distance between the two points.

      ah the good old futurama theory! you know it's a joke, right?

      --
      world was created 5 seconds before this post as it is.
    11. Re:Clarke's Three Laws by Anonymous Coward · · Score: 0

      if you cannot provide an explanation for how something works, and no expert can either, then rule 3 kicks in.

      you can continue to attempt to understand the phenomenon, but again, until someone solves "how it works", then rule 3 applies.

      it has nothing to do with if you believe in magic.

      all magic is really: "means unknown"

      it's a particularly apt word, when all experts and qualified individuals remain stymied.

      after all, language is merely an description and abstraction system.

    12. Re:Clarke's Three Laws by angel'o'sphere · · Score: 1

      I disagree.

      Because you believe there is no magic, you say that.

      On the other hand if we wanted to be scientific, we would asume: there is magic, and we would try to distinguish this new technology from magic. Either finding it is technology or finding it is magic.

      As long as you have no single hint what kind of technology it is, your scientific method wont help you to formulate any theory and executes any tests on that theory. Therefore it is not distinguishable from magic. Plain simple.

      However when you have advanced your sciense far enough you might be abke to formulte a theory, THEN it is distinguishable. On the first glance it was not ...

      --
      Cost free eBook I read (by iBook/Kobo/Amazon/ObookO/Gutenberg etc.): "The Green Odyssey" by Philip Jose Farmer.
    13. Re:Clarke's Three Laws by Anonymous Coward · · Score: 0

      I thought that was the Wrinkle in Time theory?

    14. Re:Clarke's Three Laws by Anonymous Coward · · Score: 0

      Unlike Dyson, Simon gives a deadline for this to not occur by.

    15. Re:Clarke's Three Laws by X0563511 · · Score: 1

      If you exist on one side of the galaxy at one moment, and on the other the next, this does not mean you traveled a path between the two points in three-dimensional space as we understand it. Should there be a means to complete that positional change without passing through the space between, then acceleration and velocity do not come into play at all, and so neither does special relativity.

      --
      For large sets, this will be our guide even unto death, for the LORD will work for each type of data it is applied to...
    16. Re:Clarke's Three Laws by david_thornley · · Score: 1

      The ability to transfer information faster than light, by any means (such as yelling "Look! A diversion!" whenever a physicist wanders by), either violates special relativity or enables time travel (or both). Personally, if it should be possible, I'm betting on enabling time travel.

      --
      "When you have eliminated the unacceptable, whatever is left, however improbable, must be the truthiness" - Holmes
    17. Re:Clarke's Three Laws by maxwell+demon · · Score: 1

      If you exist on one side of the galaxy at one moment, and on the other the next, this does not mean you traveled a path between the two points in three-dimensional space as we understand it. Should there be a means to complete that positional change without passing through the space between, then acceleration and velocity do not come into play at all, and so neither does special relativity.

      Wrong. Relativity is a theory about spacetime, and thus everywhere spacetime is involved, relativity is involved.

      Specifically, the causality violations do not occur due to accelerations or due to continuous movement at FTL speed, they appear whenever there's a causal relation between spacelike separated points in spacetime. A controlled FTL journey, no matter if continuous or as jump, implies such a causal relation. Indeed, even FTL communication does.

      The only way to get FTL travel or FTL communication of any kind without violating causality would be if the mechanism violates relativity.

      --
      The Tao of math: The numbers you can count are not the real numbers.
    18. Re:Clarke's Three Laws by Anonymous Coward · · Score: 0

      How do you even define magic? If it follows rules and if predictable results come from controllable actions, then it is some unknown kind of technology. Therefore #3 is a tautology - unexplained, non-obvious technology is magic. A sense of "magic" is a projection of one's ignorance onto natural world. So in a way, magic is inverse of information - it is data you don't know while someone else (a "mag") does.

    19. Re:Clarke's Three Laws by MiSaunaSnob · · Score: 1

      If its a sperm whale the value of C goes to Ooo Ooo Ooo

    20. Re:Clarke's Three Laws by ArsonSmith · · Score: 1

      Wasn't that also in the movie Event Horizon? The shortest distance between two points is not a stright line, it is zero. Fold the space between two points until they are right next to each other, be the second point, unfold space. Warping of space is a valid theory accepted pretty universally, do so in this fashion may not be possible.

      --
      Paying taxes to buy civilization is like paying a hooker to buy love.
    21. Re:Clarke's Three Laws by delt0r · · Score: 1

      Well to form any causal paradoxes, or get information into your own past, you need that FTL transfer in 2 or more different frames of reference. So if we can have instantaneous travel/information transfer in just one frame of reference. We lose relativity but keep causality.

      --
      If information wants to be free, why does my internet connection cost so much?
    22. Re:Clarke's Three Laws by delt0r · · Score: 1

      In fact it doesn't matter *how* you get from A to B. If you can do such that distance/time is larger than c then you can time travel. So even with fictional warp drives (that need more energy than the entire visible universe), relativity still seems to throw a spanner into the works.

      --
      If information wants to be free, why does my internet connection cost so much?
    23. Re:Clarke's Three Laws by david_thornley · · Score: 1

      Yeah, but special relativity is conceptually simple and has been exhaustively tested. We already know that causality doesn't apply to everything. Besides, I think time travel would be more fun.

      --
      "When you have eliminated the unacceptable, whatever is left, however improbable, must be the truthiness" - Holmes
    24. Re:Clarke's Three Laws by delt0r · · Score: 1

      I agree about relativity. But there is nothing to suggest the universe is not causal. Really when doesn't it apply?

      --
      If information wants to be free, why does my internet connection cost so much?
  14. Original presentation here. by Jeremy+Erwin · · Score: 1

    A 30 MB google docs document. Oh joy. It even appears to break my ipad. Yes, it's worth reading, but would it kill you to write an interesting summary? Even a pithy one, such as "by 2020, the energy costs associated with moving bits around will exceed the costs of actually processing them.

    1. Re:Original presentation here. by geekoid · · Score: 1

      It's not their fault you use an inferior device.

      --
      The Kruger Dunning explains most post on /. http://en.wikipedia.org/wiki/Dunning%E2%80%93Kruger_effect
    2. Re:Original presentation here. by Anonymous Coward · · Score: 0

      It seems that the cost of processing the bits with an iPad is still higher than moving them around.

    3. Re:Original presentation here. by daveime · · Score: 1

      Maybe in 30 years an iPad will be useful for something more than Candy Crush Saga ... but I doubt it.

    4. Re:Original presentation here. by Intrepid+imaginaut · · Score: 1

      This.

    5. Re:Original presentation here. by Jeremy+Erwin · · Score: 1

      Inferior device? Nonsense. I happen to prefer Apple's "walled garden" to Google's "walled garden", but the world beyond those walls is often more interesting than what's contained within.

      It's just his slides, anyway You can watch Simon give his lecture here.

    6. Re:Original presentation here. by Animats · · Score: 1

      A 30 MB google docs document.

      61 pages of rather blah presentation slides.

      And we used to think PowerPoint was a bloated format.

    7. Re:Original presentation here. by Jeremy+Erwin · · Score: 1

      The audio quality leaves something to be desired,

    8. Re:Original presentation here. by Jeremy+Erwin · · Score: 1

      Your computer does not support this comment

      To view the comment, please download the slashdotcomment app from the app store

    9. Re:Original presentation here. by celle · · Score: 1

      " I happen to prefer Apple's "walled garden" to Google's "walled garden" "

      And both suck versus FreeBSD's walled garden.

    10. Re:Original presentation here. by Jeremy+Erwin · · Score: 1

      Free BSD has a walled garden? Where?

      The problem here is that pdf is an open, standardized format. Google docs is not. Yes, I have a google docs account. A slashdot story should not require me to

      1. Log into my third party account, or create one.
      2. Discover that there is "No Preview" available.
      3. Download a 30 megabyte file

      All to comment intelligently on a slashdot story consisting of two sentences.

    11. Re:Original presentation here. by gagol · · Score: 1

      My bet is on levelling tables on uneven floor.

      --
      Tomorrow is another day...
  15. interconnect by soldack · · Score: 1

    I wish there was more discussion on the interconnect and routing challenge of these systems. I used to work on an InfiniBand SubnetManager. Exascale will require more complex topologies and more complex routing. Does anyone think today's systems are up to the task?

    --
    -- soldack
    1. Re:interconnect by Jamu · · Score: 1

      That's the first thing I thought about at the mention of a "brick wall". What else is going to stop you building a super-computer that has N-times the processing power of an existing one?

      --
      Who ordered that?
  16. No by Anonymous Coward · · Score: 0

    Hybrid Memory Cube, memristors, and other technologies will make it work. I think Horst will "loose" his bet.

  17. I just woke up... by Kaenneth · · Score: 3, Funny

    And still a little fuzzy headed, but the first thing I though of was arranging the racks for shortest maximim path, instead of one big football field sized room, stacking the datacenter into a cube shape... Then I thoght, "That's probably why Borg ships are Cubes."

    1. Re:I just woke up... by Anonymous Coward · · Score: 0

      You need to have a chat with an electrical engineer about bandwidth, clock rate, and clock skew on the network between nodes, and how it affects memory/cache consistency for why they AREN'T made into cubes.

      After that, talk to the EEs and MEs about heat transfer.

    2. Re:I just woke up... by VortexCortex · · Score: 1

      And the individual borg minds are essentially ASIC...

    3. Re:I just woke up... by gl4ss · · Score: 1

      sphere.

      anyhow, there were reasons for some crays to be shaped like they were.

      --
      world was created 5 seconds before this post as it is.
    4. Re:I just woke up... by Anonymous Coward · · Score: 0

      What? EEs do stuff with heat transfer? I'm an EE, and the only stuff I ever did with heat was in a basic Chemistry class. Mech. E's go hardcore with that stuff ;)

    5. Re:I just woke up... by PlusFiveTroll · · Score: 1

      A sphere of cubical modules. Individually spheres are probably not the most optimal shape of CPUs and each blade of the super-computer. Across a large super-computer a spherical shape sets the best distance from center to edge for maximum latency.

  18. Re:Happy Tuesday from The Golden Girls! by Meyaht · · Score: 2

    Cronglebaun

    --
    I believe in karma, which is why, when I do something bad to people, I assume they deserve it.
  19. Re:If you ignore the best news in supercomputing . by geekoid · · Score: 1

    Lie you ignored the article? And nothing i that link shows they are using it to build a supercomputer.

    --
    The Kruger Dunning explains most post on /. http://en.wikipedia.org/wiki/Dunning%E2%80%93Kruger_effect
  20. Re:Happy Tuesday from The Golden Girls! by Anonymous Coward · · Score: 0

    confidante

  21. Latency not as important as expected by gentryx · · Score: 3

    Although latency isn't so much of an issue: the #1 systems of the last ~3 years did all have torus networks (all Blue Genes, all Crays, K computer, too). These networks only perform well for next neighbor communication -- which is fine since most codes running on these machines are simulation codes and they only need this type of communication. If you scale up the system, you'll typically also scale the size of the simulation instance (this is known as "weak scaling").

    This means that your program can still spend the same time waiting for the network as it could on a smaller machine. The cables do not need to become shorter.

    --
    Computer simulation made easy -- LibGeoDecomp
    1. Re: Latency not as important as expected by epiphyte(3) · · Score: 2

      I was on the architecture team for Cray & SGI mpp &Cc-NUMA machines in the 90s. afaik the first cray mpp (T3D) had the lowest barrier sync latency of any machine ever built, before or since. we could sync 512 nodes in less than a microsecond. turned out to be extremely expensive overkill from the pov of app algorithms. may not be so these days since the compute phases are so much quicker w.r.t the comms than they were back then.

    2. Re: Latency not as important as expected by gentryx · · Score: 1

      Interesting! Actually, barriers are today considered non-scalable and thus people just try to avoid them. It's feasible if your code needs only next-neighbor communication. Not all codes satisfy this condition, but then again we build these machines today for a very specific set of applications.

      --
      Computer simulation made easy -- LibGeoDecomp
  22. What do we need this for? by Anonymous Coward · · Score: 0

    WHAT are we computing that we need to keep pushing this envelope along?

    1. Re:What do we need this for? by Anonymous Coward · · Score: 0

      your mom

      ( she's NP-hard)

    2. Re:What do we need this for? by Jamu · · Score: 1

      The weather?

      --
      Who ordered that?
    3. Re:What do we need this for? by gagol · · Score: 1

      Virtual atomic testing, cosmological constants, protein folding, the latest FPS, etc.

      --
      Tomorrow is another day...
  23. Re:Happy Tuesday from The Golden Girls! by Anonymous Coward · · Score: 0

    That's part of the troll, dipshit. And it's confidant anyway.

  24. Re:If you ignore the best news in supercomputing . by quax · · Score: 1

    Have problems parsing your question "Lie you ignored the article?"

    Was that supposed to be "Like"?

    My point is that conventional super-computing is indeed facing a crisis, but that non CMOS based technologies may save the day.

  25. This is a grant proposal by simplerThanPossible · · Score: 1

    He sells the exaFLOP dream; but it's x1,000 faster than today. At Moore's faux Law, that takes 15 years - so, due in 2028, not 2020.

    1. Re:This is a grant proposal by buddyglass · · Score: 1

      If you look at his presentation, he mentions that the current top performer is 17.6 PFLOPs. The list is from November 2012. 1000 / 17.6 is a factor of 56.8. Moore's law predicts a 2x performance improvement every 1.5 years. 56.8 log 2 = 5.83. 5.83 = 1.5 years = 8.7 years. November 2012 + 8.7 years = mid-2021.

    2. Re:This is a grant proposal by simplerThanPossible · · Score: 1

      Oh, OK. I got the x1,000 approximation from the top of page 59.

      BTW: Moore's Law approximates to x10 in 5 years, as 2**(5/1.5)=10.0793683992 A nice rule of thumb, so x100 in 10 years, x1,000 in 15 years etc.

    3. Re:This is a grant proposal by angel'o'sphere · · Score: 1

      Moore predicted an increase in transistors by a factor of 2 every 1.5 years (originally every 2 years, I believe).

      This only scales on a processor or on a memory ship, not in a cluster of nodes.

      Just because every node in your cluster is 2x faster (or 100 times in this case) does not make the whole cluster similar faster.

      --
      Cost free eBook I read (by iBook/Kobo/Amazon/ObookO/Gutenberg etc.): "The Green Odyssey" by Philip Jose Farmer.
    4. Re:This is a grant proposal by buddyglass · · Score: 1

      I wasn't the one who brought up Moore's law; that was the poster to whom I was responding, who claimed an application of Moore's law to current supercomputer performance would lead us to expect ExaFLOP performance in 2028 as opposed to 2020.

    5. Re:This is a grant proposal by ebno-10db · · Score: 1

      At Moore's faux Law,

      RTFA. His point is that flops keep getting cheaper, but data links will be the bottleneck.

  26. The Nanosecond by wcrowe · · Score: 4, Interesting

    Back in the early 80's I got the opportunity to hear Grace Hopper speak. One of the stories she used to like to tell at her talks was about the time that she was having trouble visualizing a nanosecond. Eventually she sent a memo to her engineers which said, "Please send up one nanosecond." She waited, curious as to how they would respond. After a couple of days a response came back in the form of a metal rod 11-3/4 inches in length with the note attached, "One Nanosecond", and no other explanation. After puzzling over the metal rod she called down to the engineering department and asked, "I give up, what is it"? "That's the distance light travels in a nanosecond", was the response. Later, she sent another memo to the engineers with the request, "Please send up one picosecond." The engineers immediately responded with a memo instructing her to, "put the nanosecond in a pepper grinder and you can make picoseconds all over your desk."

    Grace Hopper's humorous anecdote underlines the serious problems faced by researchers when they push the boundaries. In her case, it was a real concern over how far a bit can travel at the speed of light. I have no idea if that has any bearing on the exascale problem, but it might illustrate the kinds of problems they might be running into.

    --
    Proverbs 21:19
    1. Re:The Nanosecond by DNS-and-BIND · · Score: 1, Insightful

      To you, an amusing anecdote. To the rest of us, a terrifying tale of a ruling-class asswipe ordering her subordinates to dance and entertain her. This person graduated Phi Beta Kappa from Vassar and got a Master's from Yale. How would one even get in to Vassar, much less Phi Beta Kappa, much less be admitted to Yale to pursue a Master's? Seriously.

      Sure, we enjoyed this tale. How many other tales will we never hear where she ordered her underlings to dance, when they failed to meet her expectations and were fired? We'll never know, will we? Those sorts of stories don't add to legends. They don't name Navy ships after people who don't meet with the approval of the ruling class, no matter if they invent COBOL or not. The freaking Navy broke its own rules to keep her on active duty far, far beyond mandatory retirement age - they didn't even do that for MacArthur. Hurrah for the privileged!

      --
      Shutting down free speech with violence isn't fighting fascism. It IS fascism!
    2. Re:The Nanosecond by Anonymous Coward · · Score: 0

      Yeah and why did the Navy let her out of the Galley? Sheesh.

  27. so what? by markhahn · · Score: 4, Insightful

    I'm an HPC professional, and do not see much value in these "hero" machines. Yes, you can go on all you want about the march of progress and tier-1 and grand challenges, but you're just reiterating an unquestioned manifest destiny-based view of history. Why do we need an Exaflop machine? is it because some particular set of applications need it? where is the threshold for those applications where the compute facility will be fast enough to achieve some breakthrough?

    it's hard to find areas that are primarily limited by compute facilities. for instance, genetics/proteomics/metabilomics/whatever are *not* compute-limited, especially at the high end. they're laboratory-limited, the same way weather simulations are good and getting better, but not past the quality of their input data.

    we need more compute in general, but not necessarily in one machine. a single exaflop machine will cost much more than a thousand petaflop machines. letting a thousand flowers bloom is much prettier than one excruciatingly beautiful flower...

    and no, hero machines do not provide an efficient way to improve the tech of lesser or later machines. they have to be justified by their own need.

    1. Re:so what? by iggymanz · · Score: 2

      you are silly. systems biology modeling of cells will require exascale computing, so will simulations in chemistry of miilions or more atoms for hundredth of a second or more. Lattice simulations for physics are demanding them too.

    2. Re:so what? by Nite_Hawk · · Score: 3, Insightful

      I'm an HPC professional too.

      I don't totally disagree with your premise, but what the heck are you doing talking about genetics and proteomics in reference to giant supercomputers? If you know anything about proteomics codes, you know that the commonly used search engines like sequest and mascot were never designed to run on systems like that. Hell, they barely run on small clusters and yet people are getting enough science done that they just don't care. That doesn't mean that it's hard to find problems that need supercomputers though.

      If you want to talk about the really big systems, you are talking about things like nuclear weapons simulations, astrophysics, molecular dynamics, and quantum mechanics. There are only a handful of guys that will actually make really good use of those systems and scores of folks that would otherwise be perfectly fine running on significantly smaller ones. Having smaller jobs backfill on the big machines when the really hardcore guys are off doing something else isn't such a bad situation though. It lets you get the big science done and still keep the machines being used efficiently in the interim.

      Beyond that, just because some researchers aren't scaling their codes to those levels yet doesn't mean we should give up on big systems. There will always be people pushing the envelop and others playing catch up. Our job is to help the slow guys scale their codes when possible so they can do even better and more intensive science. Yes, not all problems require the big systems, but there are many that do, many that can be made to scale even when they don't appear to at first, and others that can serve as backfill to keep the systems busy. They have their place just as smaller clusters, cloud resources, and big data resources do.

    3. Re:so what? by Anonymous Coward · · Score: 0

      genetics/proteomics/metabilomics/whatever are *not* compute-limited

      Are you crazy?! At best right now they can compute a couple of ms of interaction for 'medium sizes'. Sometimes these reactions take minutes for something to happen.

      'hero' machines will be around for a long time. We call them mainframes.

    4. Re:so what? by Intrepid+imaginaut · · Score: 1

      Some problems literally can't be parallelised.

    5. Re:so what? by angel'o'sphere · · Score: 2

      Te problem itself can't. However sou can solve many problems of the same kind at the same time in parallel. (That actually is what most super computers in our days do)

      --
      Cost free eBook I read (by iBook/Kobo/Amazon/ObookO/Gutenberg etc.): "The Green Odyssey" by Philip Jose Farmer.
    6. Re:so what? by Taibhsear · · Score: 1

      Why do we need an Exaflop machine?

      If you build it, they will come.
      "640K ought to be enough for anyone." etc.

    7. Re:so what? by ebno-10db · · Score: 1

      If you want to talk about the really big systems ... There are only a handful of guys that will actually make really good use of those systems and scores of folks that would otherwise be perfectly fine running on significantly smaller ones.

      That's what they all say. Don't worry, that's plenty for me! (until next year). Five computers are enough for the world. 640k ought to be enough for anybody. Of course I suppose a logical progression would be to get an Exaflop machine running before figuring out how to make one for the high school science lab.

    8. Re:so what? by dkf · · Score: 1

      Systems biology modeling of cells will require exascale computing

      No, it won't because we won't be modeling objects as large as cells at the atomic level. Instead, we will use lots of coupled coarser models, saving the finer ones for parts where "interesting" things are happening (e.g., at membrane interfaces). People are already doing this sort of thing, but at a very coarse scale and with only very limited numbers of fine simulations.

      Of course, I happen to think that the really interesting things happen when you scale up to modeling a whole tissue, or a whole organ, or even a whole system. That's where you stand a chance of going from academic pussyfooting around to something useful to ordinary people.

      --
      "Little does he know, but there is no 'I' in 'Idiot'!"
    9. Re:so what? by Anonymous Coward · · Score: 0

      The biggest challenge of "exascale" is primarily what is happening within the node. The technology required to develop an exascale machine will enable more computational power to fit into your laboratory (petascale in a rack with a finite power & cost budget). If they don't fund exascale, then you won't see any progress on your lab scale machines because they are too small to pay for the NRE (non-recurring expenses) of developing the technology.

    10. Re:so what? by david_thornley · · Score: 1

      Considering how much more powerful my phone is than supercomputers of 30 years ago, I can only imagine that in 2043 the iPhone 17QX will require multi-petaflop performance to create holographic picture and sound and touch. (And you'll have to hope it is available through Mobile Safari, 'cause Apple still won't allow porn apps.)

      --
      "When you have eliminated the unacceptable, whatever is left, however improbable, must be the truthiness" - Holmes
    11. Re:so what? by ebno-10db · · Score: 1

      I can only imagine that in 2043 the iPhone 17QX will require multi-petaflop performance to create holographic picture and sound and touch.

      Considering how faster hardware always seems to lead to less efficient software, it'll probably need 1 petaflop just to flash an LED.

    12. Re:so what? by Anonymous Coward · · Score: 0

      Human brain emulation.

    13. Re:so what? by iggymanz · · Score: 1

      in the near term, there is need and demand to model those "interesting" system at the atomic level, and exascale systems (and beyond) can satiate that need.

      I myself used to work in high energy physics, there too is demand for such systems to model latest theories by numerical methods; the equations are intractable by analytical means

  28. Not a disaster by Anonymous Coward · · Score: 0

    Consumer computing kept changing in interesting ways after clock rates stopped shooting upwards. If this guy is right about not hitting exaFLOPS, there might be an analogous situation for high-end computing.

    Admittedly, there may be particular fields -- weather forecasting? fluid dynamics? -- that are going to have to pull a rabbit out of a hat to make progress without scaled-up supercomputers. But, in computing in general, we've found plenty of interesting things to do besides faster conventional supercomputing, like using huge clusters on relatively slow interconnects to do new, cool things with data. There may also still be big improvements to make on dimensions like cost (imagine we don't get exaflops by 2020, but every largish university can have a petaflops deployment) and ease of programming. Point is, interestingness is a much more textured, varied thing than just a FLOPS score.

  29. Re:If you ignore the best news in supercomputing . by Anonymous Coward · · Score: 3, Insightful

    Even if you ignore all the controversy over D-Wave's system and its nature, and take it all at face value, it is still only applicable to a narrow class of problems. CMOS or not, it amounts to something similar in principle to an ASIC. It is no surprised that a custom built chip can solve a specific class of problems orders of magnitudes faster than a general purpose processor. This used to be slightly more popular for a while in the 80s, where a few custom computers were built that were specifically designed for doing things like orbital calculations. And it pops up every so often, like custom chips for playing chess, and now bit coin mining chips. That is great for a small computer, but when your price gets into the millions or billions of dollars, the people bankrolling it will probably want to build a system that can be used for a wider class of problems even if it means running slower.

  30. Really? by Murdoch5 · · Score: 2

    I'm pretty sure at one point, someone stood up in a meeting and said "No one will ever make a 1MB memory chip" or "No one will ever achieve a 64 bit processor", so how about sit down and just wait.

    1. Re:Really? by ebno-10db · · Score: 2

      I'm pretty sure at one point, someone stood up in a meeting and said "No one will ever make a 1MB memory chip" or "No one will ever achieve a 64 bit processor", so how about sit down and just wait.

      The author of the presentation didn't say we'd never get to Exaflops, just that it might take longer than anticipated. Second, the fact that some technologies have scaled incredibly well doesn't mean that all technologies do or that there are no limits. Chips are perhaps history's greatest example of a technology that scales well. However, we were also supposed to have flying cars and visit Jupiter by 2001. Sometimes the limits are practical rather than strictly technical. SST's were built designed in the 60's (Concorde) and more were being designed in the 70's, but they turned out not to be worth the cost. I'm anything but a technology pessimist, but I'm old enough to have seen lots of predictions not materialize, or just take much longer than expected (in the 60's they said we'd have flat screen TV's by the 70's).

    2. Re:Really? by Xyrus · · Score: 2

      You seem to be forgetting about the laws of physics. In fact, we are already hitting them. You can't shrink transistors much more or you get slapped with Schrodinger's cat. The interconnects are already using fiber optics. You can only put machines so close to one another. So on and so forth.

      When people have made claims before, it was due to either their idea of market forces or the limits of the current technology. Now, the actual physical limits are beginning to present roadblocks. Even if quantum computing becomes an everyday thing by 2020, you still have to get data to the QPU which still requires a speed-of-light limited data transfer to every node running the computation.

      The problem isn't processing power or memory or even disk space. It's latency, and that is limited by the speed of light.

      --
      ~X~
    3. Re:Really? by tsotha · · Score: 1

      I remember sitting in a physics lecture where the professor assured us no computer would ever have more than about ten megabytes of RAM, since stray gamma radiation would cause bits to flip at an unacceptably high rate for larger memory "pools".

  31. No. by Anonymous Coward · · Score: 0

    Do I?

  32. Software is the problem/solution by gentryx · · Score: 1

    Yes, in a way. We'll probably never be able to improve the hardware far enough that we can simply rely on it to fail gracefully (i.e. announce it's impending death a few seconds in advance). The reason is that ATM our systems contain approx. 20k nodes. Exascale systems will likely push this to 200k.Even if you assume a node will live 10 years in average, then you can estimate that every ~53 minutes one node of the system will fail.

    My money is on the software: we'll need some kind of redundancy (e.g. a simulation code would need to store its mesh so that each part is held by multiple nodes, a bit like the redundancy we see in Bittorrent and other P2P networks). But that will require applications to be reengineered, and that will be really really expensive. Considering how the industry is struggling with the (comparatively easy) adoption of GPUs, I don't see this happening anytime soon. Interesting times ahead!

    --
    Computer simulation made easy -- LibGeoDecomp
  33. Moores Law... by Anonymous Coward · · Score: 0

    Computers have been increasing in speed/power/capability for the past 70 years. In the mid 1940's, mechanical devices (gears/leavers/streaming paper tape) gave way to thermionic devices (vacuum tubes: diodes, triodes, pentodes, etc.). With the creation of the transfer-resister (transistor) in 1957, the somewhat reliable thermionic devices that relied on physics, were replaced with solid state devices that relied on chemistry. The Apollo Space program and the US Air Force (and the MinuteMan Missile) pressed the need for complete interchangable circuits on an easily replaceable chip. Integrated circuits were born. In 1968 the Intel Corporation created the 4004 chipset for the The Busicom 141-PF calculator. Based on different inputs, the 4004 chip could produce different outputs, making it 'programmable'. Gordon Moores law about semiconductors doubling in capability every 18 months has remained true since 1970. If Intel can cut the power to its 'big iron' cpu's (the 4/6/8 core chips), then just increasing the number of processors in supercomputers from 10,000 to 100,000 will give you an 10x increase in speed while using the same or less power. Continuing from 4/6/8 core chips up to 64 core chips is the next step, giving a further 8x increase, and that's all immediately available without doing anything revolutionary. An 80x increase at the same size/power as what we have now puts us into exaflops range. In 10 years, more improvements will likely come along, and hey "1 Exaflop ought to be enough for anyone(tm)".

    1. Re:Moores Law... by ebno-10db · · Score: 2

      If Intel can cut the power to its 'big iron' cpu's (the 4/6/8 core chips), then just increasing the number of processors in supercomputers from 10,000 to 100,000 will give you an 10x increase in speed while using the same or less power. ... An 80x increase at the same size/power as what we have now puts us into exaflops range.

      RTFA. Flops are easy. The scaling problem is data links between nodes.

  34. Re:If you ignore the best news in supercomputing . by quax · · Score: 1

    Think you miss the bigger picture here, in that they are pioneering non silicon based LSI circuits that operate adiabatically (no heat production). This technology could very well be extended to include conventional logic in paralel with their quantum circuitry.

  35. Re:No. by gagol · · Score: 1

    Sure, you just won a million dollars! I will just need your full name, SSN, address, date of birth, copy of your birth certificate and driver licence, bank acoount number and your pin for processing before I send your check!

    --
    Tomorrow is another day...
  36. Re:Happy Tuesday from The Golden Girls! by Anonymous Coward · · Score: 0

    Woosh, dipshit. The duoble twist.

  37. Re:No. by neo8750 · · Score: 1

    Sweet! its 123-45-6....wait a second!! You did not ask for my mother maiden name this has to be a scam.

  38. Distributed computing by Trogre · · Score: 1

    I don't see anything about this in the PDF, so I'll ask the Hive Mind here:

    How does this affect distributed computing efforts such as Folding@Home and the BOINC project?

    These have very little node-to-server and zero node-to-node communication. With F@H already on the petaFLOP scale I wouldn't think it all that unlikely that it would reach exaFLOP level in less than a decade if interest keeps up.

    --
    "Nine times out of ten, starting a fire is not the best way to solve the problem." - my wife
    1. Re:Distributed computing by Anonymous Coward · · Score: 0

      That's not an exaflop. It's millions of teraflops. There's a huge difference.

      Ob car analogy: An exaflop is a car that can carry 4 people 1000 miles. Distributed computing is a million cars that can carry 0.4% of a person 1 mile each.

  39. The wall got smacked in the 1980's. by tlambert · · Score: 1

    Memory latency. Beowulf clusters are good for things that are highly parallel *and* have a high degree of memory locality, ie. you rarely need to make memory calls between boxes.

    True supercomputers use high-speed interconnects between systems for this reason, usually using something like Infiniband or a weird proprietary system, and usually with some network topology with numerous inter-system links. This gives them much lower latency when one system uses data in memory in another system.

    True Supercomputers can solve non-highy-parallel problems.

    The wall got smacked in the 1980's.

  40. Re:If you ignore the best news in supercomputing . by ChrisMaple · · Score: 1

    Where does CMOS even enter the question? All modern fast processors use dynamic NMOS devices in the signal path; PMOS is only used to recharge nodes to start a new cycle. For a particular set of process dimensions, CMOS is about 1/4 the speed of dynamic NMOS.

    --
    Contribute to civilization: ari.aynrand.org/donate
  41. snapshots are not the solution by Anonymous Coward · · Score: 0

    What you really need is more like error correcting codes. A snapshot is a diminishing returns strategy (see discussion on Beowulf mailing list a few months ago).. as you point out at some point you spend more time snapshotting than computing.

    But with error correcting codes, you can tolerate some fraction of the computations failing. ECC memory is at the finest grain, but the concept does scale somewhat. Triple Modular Redundancy (TMR) is a crude code (also known as a rate 1/3 code)that works at higher levels but can have issues with the voter, because there's only one.

    And it has some granuarity issues of its own: you can't just buy 3 supercomputers with a failure rate of 1 per day, run your 5 day computation, vote on the outputs and hope for success.

  42. Re:If you ignore the best news in supercomputing . by quax · · Score: 1

    Fair enough, I used CMOS as sloppy shorthand for all current silicon based field effect transistor integrated circuit technology. (See how much longer that is?)

  43. Google is not a Supercomputer by gentryx · · Score: 1

    Whenever someone on on /. likens Google's network to a supercomputer God kills a Pokemon. But honestly: the reason why Google can cope with these massive outages is that they're doing totally different computations from supercomputers. Google's compute jobs are losely coupled. They do data mining. That is fundamentally different from supercomputing where all compute jobs are tightly coupled. To give you a car analogy:

    • In the Google case millions of mechanics fix millions of cars in parallel. This is more or less trivial. If one of the mechanics is ill, another one can take over his task, or they simply wait until a replacement arrives.
    • In supercomputing your try to assign millions of mechanics to fix a single car in just a millionths of the usual time. This gets really tricky because they need to coordinate their actions tightly and if one of the mechanics is ill, others might trip over him and the whole job becomes a mess.

    Not a good analogy, but I hope to correct the picture of Google being lightyears ahead of the supercomputing industry: they're simply working on very different problems. I wonder what makes you think that Google/Amazon/Facebook were 10 years ahead of Cray and academia? If they were, they'd simply take over Cray's market. And since Cray competes with IBM and Fujitsu, they'd probably try and claim parts of their market shares, too. This is not happening.

    --
    Computer simulation made easy -- LibGeoDecomp
    1. Re:Google is not a Supercomputer by Anonymous Coward · · Score: 0

      "Whenever someone on on /. likens Google's network to a supercomputer God kills a Pokemon."

      Woooohooo!

      Google's network is like a supercomputer!
      Google's network is like a supercomputer!
      Google's network is like a supercomputer!
      Google's network is like a supercomputer!
      Google's network is like a supercomputer!
      Google's network is like a supercomputer!
      Google's network is like a supercomputer!
      Google's network is like a supercomputer!

      MASSACRE!

    2. Re:Google is not a Supercomputer by Forever+Wondering · · Score: 1

      Whenever someone on on /. likens Google's network to a supercomputer God kills a Pokemon.

      Who kills a what?

      But honestly: the reason why Google can cope with these massive outages is that they're doing totally different computations from supercomputers. Google's compute jobs are losely coupled. They do data mining. That is fundamentally different from supercomputing where all compute jobs are tightly coupled.

      The architecture of a Google data center is virtually identical to a supercomputer. In Google parlance, "The data center is the computer." Racks and racks with interconnect. All are using Xeon-like chips [IBM does too, but some are based on their Power series chips]. The only difference in usage might be problem space. But, Google runs plenty of jobs internally that aren't data mining. Video processing for one. But, while search can be split up more effectively than some job mixes, it benefits just as much with advances that are supercomputer-like. So, you can bet Google is working just as hard on that angle as Cray. And Google has much more money to invest in research than Cray [see below].

      Cray's "secret sauce" is its Gemini interconnect, but it's still laid over the top of Xeon-like chips. Architecturally, it's difficult to get true fine grained on top of an x86 arch. The tricks used to make the single core fast: out-of-order execution, multiple execution units, etc. make multicore coordination beyond the occasional SMP lock primitive difficult.

      Intel was trying to address this with Larabee's ring bus architecture. Similar, to Kendall Square Research's "all cache" architecture. But Larabee got shelved [it's dandy for compute intensive mixes but fell short as a GPU]. Some of the concepts got folded into Haswell.

      One might have better luck with some of the "mesh" RISC chips that have have exact/precise instruction times and crossbar interconnect on die. The latter have a much better chance of running cycle-by-cycle lock step. An early forerunner of this approach was the Inmos Transputer.

      But, still, eventually you have to go off die, off chip, off board, off rack, off room, off building. This boils down to interconnect. While you might be able to have a special backplane parallel interconnect for the near nodes, eventually, as a matter of practicality [expense], you're going to end up with a serial [fiber] interconnect (e.g. 100G Ethernet, Thunderbolt, etc). This is the data movement problem that the article mentioned.

      Thus, everybody has access to the same building blocks to build a supercomputer or data center. When Cray comes up with their own graphene based CPU chip (e.g. 100x the electron mobility), running at 100 GHz, they might do better. IBM is more likely to come up with this than Cray.

      But, this won't help without faster memory than DRAM. Hewlett Packard is working on putting magneto-resistive memory on die. MR, in addition to being persistent, is as fast as level 2 cache and [I believe] the cell size is smaller than DRAM.

      Perhaps, it's time for the supercomputer community to look beyond tightly coupled as a requirement, if it's to scale.

      Also, as the slide show presentation in the article pointed out, the future of reliability is to not rely on the hardware to provide it. The software will have to provide it. The software knows when it's reached a checkpoint. IBM is deploying a system [based on Power] that has transactional memory support built in. They have 16 cores/die [one is a spare]. Intel's Haswell has transactional memory support with commits and lock elision.

      To give you a car analogy:

      In the Google case millions of mechanics fix millions of cars in parallel. This is more or less trivial. If one of the mechanics is ill, another one can take over his task, or they simply wait until a replacement arrives.

      In supercomputing your try to assign millions of mechanics to fix a

      --
      Like a good neighbor, fsck is there ...
  44. The harddisks are much slower by gentryx · · Score: 1

    ...and this is the problem: the time we need to get all the data to disk is closing in on the MTBF. With the current technology an exascale system would suffer node failures even while taking a snapshot.

    --
    Computer simulation made easy -- LibGeoDecomp
    1. Re:The harddisks are much slower by tibit · · Score: 1

      Keep it in memory. It's not that expensive. If you decouple the snapshot memory (DDR3 or somesuch) from the main number-crunching CPU, and just keep that memory refreshed and error-corrected, you should be fine. You don't need disks.

      --
      A successful API design takes a mixture of software design and pedagogy.
    2. Re:The harddisks are much slower by tibit · · Score: 1

      Recently on eBay I saw a bunch (like 500 or so) of HP Xeon servers with 72GB of DDR3 RAM each, each for under $500 shipped buy-it-now, with some sort of a volume discount, too. Since that's likely registered server RAM that IIRC costs more than non-registered consumer stuff, it seems like a steal. I'm not sure what sort of memory bandwidth requirements do modern compute nodes have, perhaps DDR3 isn't enough, but still - RAM is cheap, it may be cheaper than pushing data via a custom interface to a fast hard drive array.

      --
      A successful API design takes a mixture of software design and pedagogy.
  45. viscosity of time flow by Anonymous Coward · · Score: 0

    You don't seem to understand the effect of "FTL". It doesn't matter if you warped, teleported or used some wormhole - for external observer you have exceeded speed of light and it isn't any different from violating causality or time travel.

    It wouldn't affect causality if you traveled completely out of your initial light cone. Ditto for time travel - if it is possible to travel into past, then it is impossible to cause change in present, i.e. what happens in "new past" stays there, unable to propagate back to "old present" faster then it itself propagates into future.

  46. It's really about the applications by gentryx · · Score: 1

    I guess your major misunderstanding is that the applications running on supercomputers could somehow be done in the (loosely coupled) way that Google does its data mining. Since you're a professional, too, please refer to this Wiki article on stencil codes, one of the major classes of codes that run on supercomputers. If you find a way (or at least a pseudo-code formulation) to transform these applications into loosely coupled codes, then I would not be the only one to be curious to hear about it. You'd transform the whole industry. In fact this is not possible, though.

    But I agree that software will need to help with reliability and will have to actively manage node eviction/addition.

    BTW: comparing Google and Cray is really like comparing apples and oranges: they're in different markets. The market for supercomputers is extremely small, the market for (online) advertising is gigantic.

    --
    Computer simulation made easy -- LibGeoDecomp
  47. always with the bitcoins by KingBenny · · Score: 1

    how long would it take the bestest supercomputer to mine all bitcoins by itself ?
    i always say things i shouldn't that's why none of both sides available in any layer of existence ever likes me. So that's how the government will eventually take control of the bitcoin ? I'm raving mad arent i ... is it possible i am the first person in the world to think this? I hope not since that would not only mean i'm seriously underpaid, but it would mostly mean a lot of overpaid people are seriously overpaid, let's just pretend i didnt post this before someone fed-side takes it seriously

    --
    Free speech was meant to be free for all... how can anyone grow up in a nanny state ?