Slashdot Mirror


Software to Make Blue Gene Top 200 Teraflops

An anonymous reader writes "New Scientist has a story about the most intensive computer program ever created. It runs on IBM's big beast, Blue Gene/L, at Lawrence Livermore National Laboratory in California and carries out 207.3 teraflops (trillion cacluations per second). The program, called Qbox, performs very complex quantum calculations to simulate the behaviour of thousands of atoms in three dimensions. Wow."

171 comments

  1. Slight clarification by LiquidCoooled · · Score: 4, Funny

    It does not perform very complex quantum calculations, instead
    It simulates interactions between 1000 molybdenum atoms under high pressure using equations that take the quantum behaviour of electrons into account.

    Also, when its not being used to dynamically model atomic structures, the IRS uses it to calculate Bill gates's taxes.

    --
    liqbase :: faster than paper
    1. Re:Slight clarification by rolfwind · · Score: 4, Funny

      And it almost makes the requirements for Vista!

    2. Re:Slight clarification by Anonymous Coward · · Score: 0

      The rich don't pay taxes, that's the job of the middle-class!

    3. Re:Slight clarification by Memnos · · Score: 3, Interesting

      At the unfortunate risk of repeating myself on Slashdot (Oh, the Humanity!) you are correct. It is intrinsically impossible for a discrete-state system to model quantum mechanical events, unless you somehow sneaked under the Planck limit (There is no spoon..) So, they're faking it.. However, if it is a good model of "reality", then it is good science. If it can predict, it is useful.

      --
      I don't trust atoms -- they make up stuff.
    4. Re:Slight clarification by OnlineAlias · · Score: 1

      I bet the video card doesn't.

    5. Re:Slight clarification by Bill+Barth · · Score: 2, Informative

      It's not "fake" so much as it's an approximation. I guarantee you the know by exactly how much they are in error (but not in what direction!). The Schroedinger Equation that is at the heart of this represents the probability (well its modulus does, at least) of something as a continuous function of space and time. These scientists make errors in that the equations that they use are discrete (in terms of mathematical degrees of freedom, strictly speaking, by discretizing space and time directly) models of the Schroedinger equation and in that the initial and boundary are not perfectly well known. That doesn't constitute "faking it" in my book. If they were faking it, they'd be making pretty pictures with no predictive value, and presuably their work makes good predictions, which, as you note, puts it in the category of "good science."

      --
      Yes...I am a rocket scientist.
    6. Re:Slight clarification by mfago · · Score: 2, Insightful

      impossible for a discrete-state system to model quantum mechanical events
      Huh? QM was a while ago, but I'm afraid you'll have to give a reference or two. You're saying that Density Functional Theory is impossible? The authors (of DFT) did win the Nobel proze a while ago, so I'm sure I'm missing something. Mind you, any implementation is only an approximation, but that's true of almost any computational method.

    7. Re:Slight clarification by Fordiman · · Score: 1


      But can it run Linux?
      </obligatory>

      --
      110100 1101000 1101000 1100110 0 1101111 1101000 1100011 1
    8. Re:Slight clarification by Memnos · · Score: 2, Insightful

      Yes. I am am saying that a discrete-state-system, such as a Markov chain, cannot follow quantum mechanical events. QM state reduction is not beforehand deterministic because it it follows a wave function that be known beforehand in its full vector state (e.g. position and velocity.) If you wish references I would need to look them up, except for my remembrances of Richard Feynman and Stephen Hawking lecturing to me on this subject, and my own experiments. But I can find them. That neither obviates your point or mine. My background is in physics but I work in computer science, and good-enough computational approximations have a way of being "good enough". Perhaps our argument is about "truth", which we model only imperfectly. Or then, perhaps we have no actual argument at all. Oh, DFT is a good and very useful theorem and practical model, but it does does sidestep the issue of QSR in some cases, as does almost any model of QM. Thx.

      --
      I don't trust atoms -- they make up stuff.
    9. Re:Slight clarification by aminorex · · Score: 1

      > However, if it is a good model of "reality", then it is good science. If it can predict, it is useful.

      Only if it is open source. Otherwise, it belongs in the Journal of Irreproducible Results. Unless I can reproduce the numerical experiment, the predictions are as meaningful as a call to the psychic friends network.

      --
      -I like my women like I like my tea: green-
  2. Yeah, but... by wiz31337 · · Score: 3, Funny

    Yeah, but can it beat Kasparov at chess?

    --
    /whisper/ Thanks for the candy!
    1. Re:Yeah, but... by fuzzyfozzie · · Score: 0

      Considering that Kasparov has retired from the Chess Circuit I would say that it probably could.

    2. Re:Yeah, but... by elrous0 · · Score: 5, Funny
      It's so powerful, it can beat Kasparov in chess and monitor millions of phone calls for the NSA *at the same time*!

      -Eric

      --
      SJW: Someone who has run out of real oppression, and has to fake it.
    3. Re:Yeah, but... by Sabaki · · Score: 2, Funny

      No, but it's already mapped his genome and is working on a clone that will be completely under its control.

    4. Re:Yeah, but... by elrous0 · · Score: 4, Funny
      Geez, I am sick of getting modded down for this. Can /. please stop giving the White House unlimited mod points?

      -Eric

      --
      SJW: Someone who has run out of real oppression, and has to fake it.
    5. Re:Yeah, but... by Doc+Ruby · · Score: 1, Flamebait

      The sad truth is that about 50M Americans actually did vote for Bush twice, in 2000 and 2004. Most don't read Slashdot (can't even spell it), but those who do (or wish they did) are the same zombie army that does Bush dirty work for free, without even being asked. The kinds of suckers inspired by powerful bad guys who want to "be on the side that's winning", like copycat terrorists. Yeah, some of them probably do astroturf for VRWC "network associates", but there are lots of independent operators. It's a lot worse than just a few creeps.

      --

      --
      make install -not war

    6. Re:Yeah, but... by Gorshkov · · Score: 1, Insightful

      The *real* sad truth is that inspite of the arrogance of some people, not voting the way you do does not mean that people are stupid, evil, or mindless. It just means they disagree with you.

    7. Re:Yeah, but... by ScriptPhreaker · · Score: 0, Offtopic

      I'm going to let you in on a little secret. The quiet majority of Americans out there actually like the President. You don't know that because we aren't loud and obnoxious like you. That's why you are always stunned when you get beat in elections. As for our intelligence, I'm a software engineer at Lockheed Martin. I promise you, I am a lot smarter than you will ever be. I'm also not a right wing religious nut just because I like the President. I don't go to church, and I'm not even sure if I even believe in God. I live in NY, not in middle America. On top of that, EVERYONE I know likes the President. I also liked Bill Clinton. Mostly for his bravery to send American forces to take out that butcher Milosevic. (without the UN approval!) Sound familiar? You see, most of us in America have common sense and a real sense of right and wrong. I love /. and read it every day. I just ignore the idiot comments like yours.

    8. Re:Yeah, but... by Anonymous Coward · · Score: 0

      "...I am a lot smarter than you will ever be..."

      And humble, too!

    9. Re:Yeah, but... by elrous0 · · Score: 2, Insightful
      we aren't loud and obnoxious like you.

      when you already control everything, you don't HAVE to be loud.

      As for obnoxious, well, that's in the eye of the beholder. For example, I consider monitoring my phone calls and locking people up without due process to be pretty damn obnoxious. But that's just me.

      -Eric

      --
      SJW: Someone who has run out of real oppression, and has to fake it.
    10. Re:Yeah, but... by alexeiz · · Score: 1

      Well, let's say this machine is 1000 times faster than Deep Blue. This will give it the power to see 3-4 half moves deeper. Is it enough to make any difference? Probably not so much in the middle game, but it can be noticeable in the endgame. Yet again Deep Blue has already beaten Kasparov. But we all know Kasparov didn't show his real power in that match.

    11. Re:Yeah, but... by Fordiman · · Score: 1

      Oh, my, GOD, thank you.

      It's good to see a sensible human around for once.

      --
      110100 1101000 1101000 1100110 0 1101111 1101000 1100011 1
    12. Re:Yeah, but... by mcpkaaos · · Score: 1
      I just ignore the idiot comments like yours.


      Boy, did you ever fail that one.
      --
      It goes from God, to Jerry, to me.
    13. Re:Yeah, but... by Doc+Ruby · · Score: 2

      The real sad truth is that the arrogance of Bush voters lets you think that putting that criminal in charge of the world, then lying us into the Iraq War, letting New Orleans drown, spending our surplus into $9-45 TRILLION debt, shredding American global credibility and an endless list of other stupid, evil and/or mindless acts is just a "disagreement".

      That's your excuse, but turning your responsibility for electing that criminal into a "disagreement" with people who voted for a competent president, especially after 4 years of unmistakeable evidence, is just sad truth.

      --

      --
      make install -not war

  3. Linux by Anonymous Coward · · Score: 0

    Does it run Linux(R)?

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

      It would crash at 4x the speed of sound!

    2. Re:Linux by spun · · Score: 3, Funny

      Only after it calculates Bill Gates' taxes and beats Kasparov at chess, apparently.

      --
      - None can love freedom heartily, but good men; the rest love not freedom, but license. -- John Milton
    3. Re:Linux by MrSquirrel · · Score: 1

      The researchers wanted to use the computer to try and understand women, but realized that in order to have a computer answer something, it has to be based on logic.

      --
      A computer once beat me at chess, but it was no match for me at kick boxing.
    4. Re:Linux by LWATCDR · · Score: 1

      "Does it run Linux(R)?"
      Umm.. Yes as do most supercomputers these days.
      http://www.top500.org/stats/26/osfam/
      When it comes to supercomputers Linux is the OS of choice these days. Even Mac OS/X has five times the market share of Windows when you talk about the top 500 supercomputers. You see when it comes to doing real work Windows is just a hobbyist play thing. The big boys run Linux.

      --
      See my blog http://ilovecookes.blogspot.com/ for light hearted technical information.
    5. Re:Linux by Anonymous Coward · · Score: 0

      I don't believe parent mentioned anything about Windows. Sounds like someone has some insecurities about operating systems.

    6. Re:Linux by Tackhead · · Score: 1
      > The researchers wanted to use the computer to try and understand women, but realized that in order to have a computer answer something, it has to be based on logic.
      > --
      > *insert guitar solo here*

      "She don't read Slashdot, but software makes her Blue Gene talk!"
      - Dr. Hook and the Medicine Show

    7. Re:Linux by casio · · Score: 1

      The i/o nodes and service nodes run Linux. Compute nodes run a custom kernel called CNK.
      (See http://www-unix.mcs.anl.gov/~beckman/bluegene/SSW- Utah-2005/BGL-SSW03-CNK-CIOD.pdf)

      One of the problems with running Linux on the compute nodes is that the normal mechanism of loading applications using demand paging doesn't fit well. I worked in the MPP supercomputing business 15 years ago and we tried running a full Unix kernel (Linux was just coming into being.) and the users ended having to run they apps twice. The first time to get all the memory warmed up with the pages loaded.

      We were working to fix it, but then end of the cold war killed the business.

    8. Re:Linux by heinousjay · · Score: 1

      It's sour grapes - the Linux crowd really wants the desktop, and they're just not getting it. The psychology of compensation is so amusing.

      --
      Slashdot - where whining about luck is the new way to make the world you want.
    9. Re:Linux by Thunderbear · · Score: 1

      You should try out the latest Ubuntu - it is plainly a joy to use.

      After trying both KDE and Gnome, i must say that I like their Gnome desktop the most, and I am known to be very picky :)

      --

      --
      Thorbjørn Ravn Andersen "...and...Tubular Bells!"
  4. Too bad for Q-box... by vishbar · · Score: 3, Funny
    New Scientist has a story about the most intensive computer program ever created.

    Too bad for Q-Box that their title will be stripped of them so soon. Vista's almost here.

    Wait a minute, Vista? Nevermind...Q-box should have it for a long while.

    --
    Ride the skies
    1. Re:Too bad for Q-box... by bl00d6789 · · Score: 2, Funny

      Since QBox's title is for requiring the most computing power to carry out its intended application, Vista may well unseat it. It's just that QBox's intended application is extremely complex quantum physics calculations, and Vista's intended application is letting people check their email. So... not quite a victory for Vista.

  5. More importantly... by batmn42 · · Score: 2, Funny

    "Wow."

    More importantly, at what FPS does it play WoW?

    Though I wouldn't be surprised if it needs a new graphics card for Crysis...

  6. Specs by neonprimetime · · Score: 5, Informative

    Specs here and yes, Suse

    1. Re:Specs by Anonymous Coward · · Score: 1, Informative

      Not quite. The front end run and service node run Suse, but the compute nodes run a CNK (compute node kernel) that supports a subset of the system calls that Linux does and can only run one process per core (i.e. two per compute node). That means your code can't fork().

      Lots of good reading material here: http://www.research.ibm.com/journal/rd49-23.html

    2. Re:Specs by multimediavt · · Score: 1

      Umm...no, the BlueGene system does not run Suse, the head nodes (which are IBM eServer or xServer nodes) run Suse. The BlueGene racks themselves run a stripped down Linux that is more like an embedded Linux with HPC support.

  7. Only the most intensive USEFUL program by stratjakt · · Score: 5, Funny

    I mean, I'm sure I could use up more than 200 teraflops with my "while (1);" program.

    --
    I don't need no instructions to know how to rock!!!!
    1. Re:Only the most intensive USEFUL program by Anonymous Coward · · Score: 0

      I think you should at least put in a float operation in there someplace.

    2. Re:Only the most intensive USEFUL program by frank_adrian314159 · · Score: 2, Informative
      while(1); uses no FLOPS. OTOH, if you used while (1.0);...

      (And for those of you who are humor-impaired, I do realize that neither would use any FLOPS because they would both be optimized into L1: jmp L1).

      --
      That is all.
    3. Re:Only the most intensive USEFUL program by stratjakt · · Score: 1

      while( (int) 1.0 );

      (its interpreted not compiled)

      --
      I don't need no instructions to know how to rock!!!!
    4. Re:Only the most intensive USEFUL program by Ant+P. · · Score: 1, Funny

      Don't be silly.

      Everyone knows Linux can finish that loop in 5 seconds.

    5. Re:Only the most intensive USEFUL program by necro2607 · · Score: 1

      It's pretty funny to see that mentioned because just the other night I was thinking about the "while" function as I've never really thought of this before but I realized you could just put a "1" in the parentheses and it would return true indefinitely and you could get some pretty fun results, perfect for prank-related endeavours and so on. Then I thought, "oh, like all those texts from the 90s [that I didn't understand]"... ;)

    6. Re:Only the most intensive USEFUL program by TheSkyIsPurple · · Score: 2, Insightful

      Sorry, but I imagine you'd keep one of the many processors very busy, with the rest left idling away.
      Now, spawn a thread for each processor running this, and you might have something =-)

    7. Re:Only the most intensive USEFUL program by Al+Dimond · · Score: 1

      In C, and in most other languages, "while" is not a function, it's a looping construct. It doesn't return anything. Hate to be a pedant, but this is very important to understanding its operation.

    8. Re:Only the most intensive USEFUL program by mantar · · Score: 1

      float fX = 0.0f;
      float fY = 0.0f;

      while(1) { fY=sinf(fX = (fX<360.0f) ? fX+1.0f : 0.0f); }

      Break-down:
      On most loops:
      2x FP assignments/loop
      1x FP addition/loop
      1x FP compare/loop

      On one loop every 360:
      3x FP assignments/loop
      1x FP compare/loop

      Plus god knows how many FLOPS sinf uses...

      --
      # man tar
    9. Re:Only the most intensive USEFUL program by owlstead · · Score: 2, Funny

      I would not use an optimizing compiler on that one either :)

    10. Re:Only the most intensive USEFUL program by Anonymous Coward · · Score: 0
      optimized into L1: jmp L1


      Er... it should really be optimized into something like HALT, STOP, PAUSE, YIELD or a null system call, depending on CPU architecture and OS:

      L1: YIELD
      JMP L1


      where possible, is much nicer than spinning until an interrupt occurs.

    11. Re:Only the most intensive USEFUL program by dave1g · · Score: 1

      Hopefully that would use exactly ZERO FLOPS given that only the integer unit would be used and no floating point calculations would be made :-p

    12. Re:Only the most intensive USEFUL program by CarpetShark · · Score: 1

      with a good compiler designed for the machine, something like:

      #define NUMPROCS x
      int array[NUMPROCS];

      function getval(int indx) {
              return array[indx];
      }

      while(1) {
              for(i=0; iNUMPROCS; i++) {
                      array[i] ^= getval(i);
              }
      }

      should probably be optimised for multiple processors. I'm not sure how fine-grained the optimisation is, but I doubt you have to manually launch threads to get some benefits from a parallel machine like blue gene.

  8. ...wow... by sarlos · · Score: 5, Interesting

    So in essence, it takes about .2 teraflops per atom... And that was only after spending a lot of time condensing the algorithms. This makes me wonder two things. First, what do these equations look like such that it takes 200 gigaflops just to model one atom. Second, over what timeframe does this simulation take place? Are we talking real-time, calculating for 50 years, what?

    Regardless, as a computer scientist, I say way to go to these guys, this is damn impressive.

    --
    Government's view of the economy: If it moves, tax it. If it keeps moving,regulate it. If it stops moving, subsidize it.
    1. Re:...wow... by ScottLindner · · Score: 1

      I can't imagine it's real time. From what I understand, most chaotic simulations are far far slower than real time.

      --
      Slashdot.. where people join together in deliberate ignorance.
    2. Re:...wow... by Anonymous Coward · · Score: 0

      Regardless, as an engineer, I ask "Why not just get 1000 Molybdenum atoms and watch what the fuck they do?

    3. Re:...wow... by MustardMan · · Score: 2, Insightful

      So you're a computer scientist, but you apparantly don't understand Big-O notation or the concept that algorithms don't neccesarily scale linearly with the number of elements.

    4. Re:...wow... by mhore · · Score: 5, Informative
      So in essence, it takes about .2 teraflops per atom... And that was only after spending a lot of time condensing the algorithms. This makes me wonder two things. First, what do these equations look like such that it takes 200 gigaflops just to model one atom. Second, over what timeframe does this simulation take place? Are we talking real-time, calculating for 50 years, what?

      0.2 TFlops per atom, yes. But there are 1000 atoms, and it's molybdenum which has 42 eletrons... so that's 42,000 particles that all interact with each other. Still... that's not too many. But maybe they're considering interactions between nuclei, too. Who knows...

      As for your question about what the equations look like? They're probably very nasty integrals of sines and cosines and what not to various odd (read: strange) powers and stuff. I do fairly computationally intensive simulations on some big IBM machines and just simple equations can amount to quite a bit of calculations. Nothing like what these guys are doing, though.

      Finally... what time frame is the simulation over? I'd wager VERY SHORT times, maybe nanoseconds or something like that. Even casual "molecular dynamics" simulations can only probe very short timeframes. Their coarse-grained cousins can maybe do microseconds or milliseconds.

      Mike.

      --

      Mmmm......sacrelicious.

    5. Re:...wow... by MustardMan · · Score: 1

      And that's why you're an engineer and not a scientist. You can't TEST a theory unless you can see whether that theory actually WORKS to predict what really happens. It's kind of hard to carry out the calculations by hand to test a model that includes a thousand atoms.

    6. Re:...wow... by Anonymous Coward · · Score: 0

      god must have a kick ass computer to keep track of those gazillion atoms.

    7. Re:...wow... by Anonymous Coward · · Score: 0

      How can you tell the height of a building using a barometer?

    8. Re:...wow... by SilentGhost · · Score: 1

      42 thousands particle? you have any idea what is size of electrons vs atoms? interaction between nuclei? do you understand what you talking about? sines and cosines.... adn this is 5 score comment! rated informative!

    9. Re:...wow... by exp(pi*sqrt(163)) · · Score: 2, Informative
      In a classical physical system the time to compute what happens to N particles typically grows as a polynomial in N. The masses and positions of the particles form a 6N dimensional space (3 for velocity, 3 for position) and you're typically trying to trace a path through that 6n-dimensional space.

      In quantum mechanics the state of the system is defined by a wavefunction on a 3N dimensional space. The state of a system is no longer a point, it's a *function* on a 3N dimensional space. That means that at any position in this space the function can take any value. So you need to compute the value of this function at every point in this 3N-dimensional space. Suppose we model this really crudely. Instead of considering a wavefunction that varies continuously through this 3N-dimensional space 'discretize' this space. consider just 10 points along each of the 3N axes rather than the infinite number required by quantum mechanics. We can then model the system by computing values of the wavefunction at 10^3N points. Suppose we're dealing with 1000 atoms. Let's model the atoms really crudely as one nucleus and one electron. That means 2000 particles and a 6000-dimensional space. So we need to compute the wavefunction at 100000000...000 points, where we have '1' followed by 6000 zeroes.

      I know that physicists have a few tricks up their sleeves but it seems pretty obvious to me that these guys are actually cutting a lot of corners, and to accurately model this many atoms on a computer anything like what they have sounds pretty implausible to me.

      There's a quick and easy way to look at this. When you combine two classical systems the work required to simulate the combination is typically the sum of the work required to simulate them separately (modulo a polynomial). When you combine two quantum systems you need to multiply the amount of work. Combining 1000 quantum systems borders on the insane...

      --
      Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
    10. Re:...wow... by gardyloo · · Score: 2, Insightful

      Because those atoms do their things on VERY short timescales. There's no way you can probe what they're doing on short enough time (and length) scales, even with pump-probe laser experiments, and track movements. Possibly, in some very special circumstances, you can look at beginning and ending states, and then figure out intermediate states. However, in general, this isn't possible, and so we need such simulations to track in-between processes, especially in ergodic systems.

    11. Re:...wow... by Andrew+Kismet · · Score: 1

      Drop the barometer and time how long it takes to fall.

    12. Re:...wow... by poszi · · Score: 2, Insightful
      Why not just get 1000 Molybdenum atoms and watch what the fuck they do

      Because they are apparently simulating them under extreme conditions that are present during nuclear explosions. And nuclear tests are banned.

      --

      Save the bandwidth. Don't use sigs!

    13. Re:...wow... by Anonymous Coward · · Score: 0

      Ok, I don't know anything about this.

      I'd divide your number roughly a thousand, because it models the interactions between each of the particles -- assuming a full mesh using n*(n-1)/2, that's 999000 interactions. So that's down to about 200 Mflops right there.

      If that other guy that mentioned there being 42 electrons in each of the atoms is correct, that's 42000 * 41999 /2 = 881979000 interactions, or a paltry 226 Kflops per interaction.

    14. Re:...wow... by danelav · · Score: 1

      It's not really .2 teraflops per atom. Any relational system will grow in complexity quickly (I want to say exponentially, though I'm not sure if that's technically correct) in regards to the number of nodes. In this case, each node is linked to each other node, so it's not 200 teraflops/1000 atoms, but 200 teraflops/(some big number, 1000^1000 or 1000!) relationships between atoms.

    15. Re:...wow... by Metasquares · · Score: 1

      As another computer scientist (specializing in algorithms), I think this is inefficient and needs further research :)

    16. Re:...wow... by Anonymous Coward · · Score: 0

      Do you think size matters that much in quantum interactions? Really, what are you trying to say, your comment seems utter gibberish.

    17. Re:...wow... by mhore · · Score: 1
      42 thousands particle? you have any idea what is size of electrons vs atoms? interaction between nuclei? do you understand what you talking about? sines and cosines.... adn this is 5 score comment! rated informative!

      I'll bite this time. Just once. I have a very good idea what I'm talking about. I said sines and cosines because to a first approximation the wavefunctions of the atoms probably resemble that, so I'd assume the interactions be built off of them in some fashion. I'm sure you took elementary quantum mechanics. Undergraduates learn that stuff. Notice I didn't say what specifically what the equations would like like because I have no idea. I have a master's degree in computational physics -- what're your qualifications?

      Mike.

      --

      Mmmm......sacrelicious.

    18. Re:...wow... by owlstead · · Score: 1

      "Because they are apparently simulating them under extreme conditions that are present during nuclear explosions. And nuclear tests are banned."

      Never understood that stuff. You throw one, we throw 100, you throw 10000 and the earh is destroyed. It goes bang in a big way, and contaminates everything in the direct surrounding. What do you need a super-computer for? Why would you need to test such a thing in the first place?

      Now if they would put UD on it you could topple the top ranking in cancer research. /rant off

    19. Re:...wow... by mfago · · Score: 1

      Actually, in classical molecuar dynamics, the algorithm is usually N^2. However, in this case "N" is the number of _electrons_, not atoms, i.e. 42000 electrons.

      Oh, and this is not classical physics, but QM. Thus each electrons wave function has to be represented by a (possibly substantial) set of basis functions. Not sure if anyone's been able to get Density Functional Theory (DFT) to scale that high, but if so, DFT scales as (IIRC) either N^7 or N^9. Ouch! Sure there are tricks, such as pseudopotentials that "lump" the inner electron-shells with the nucleus, but still it'd be quite a big deal, and require quite some big iron.

      FWIW, I ran some very simple DFT calculations with only ONE atom that took roughly 1-second on a single Power5 processor. Unfortunately for me, I needed to do several million of them -- hence why I ran on a 500 processor machine a block away from BlueGene/L.

    20. Re:...wow... by exp(pi*sqrt(163)) · · Score: 1
      the algorithm is usually N^2
      As I say, modulo a polynomial. The complexity of quantum systems typically grows exponentially because we're looking at the tensor product of the subsystems.

      I'd love to find out a bit more about the algorithms used here. And I'd be interested to know what kind of validation there is for the methods. I guess I can start here. (My background is more particle physics than many-body systems.)

      --
      Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
    21. Re:...wow... by Fordiman · · Score: 1

      It would be 999 relationships per atom, 999000 relationships in total. Each relationship would require vector calculations, positional calculations, calculations of EM field flux, electron position probability, etc, which would bring the calculations up into the thousands per relationship (I wouldn't be surprised if it's greater than 200,000 discrete operations). That brings us well into the teraflop range for realtime (one second virtual = one second real) processing.

      --
      110100 1101000 1101000 1100110 0 1101111 1101000 1100011 1
    22. Re:...wow... by rjmars97 · · Score: 1

      In my nanoscience class I took last semister, we had to use Brownian Dynamics to model the diffusion movement of 2 particles (1nm in diameter, with some mass m) in 3 dimentions across a 25 nanometer gap. To do this, you need 6 differential equations for each particle (one for the velocity in x, one for the position in x, one for the velocity in y, one for the position in y, etc.). Each equation is in the form of a stochastic differential equation, usually developed from the Langevin equation. One of the main issues with modeling such systems is white noise, which adds a random factor into all differential equations and MUST be taken into account to produce accurate models. Developing the correct value for the white noise in the system can be very tricky, probabally one of the most difficult aspects.

      We used MathCAD to model the 2-particle system, with a total of 12 differential equations (6 for each particle), and it would take several minutes to develop the resulting graphs (doing it by hand would literally take days). Of coarse MathCAD uses a numerical differential equation solver (ODE-45), so the result is by nature, a close approximation. I assume the program running on IBM's machine is using a more accurate method to solve the equations, thus requiring much more power than our FX-57 workstations. Combining this with the fact that they are modeling thousands of particles makes it a lot easier to see why they need insane computers to do such calculations.

      --
      Heuristically programmed ALgorithmic computer
  9. Molest me not by Weaselmancer · · Score: 4, Funny

    The program, called Qbox, performs very complex quantum calculations to simulate the behaviour of thousands of atoms in three dimensions.

    "Molest me not with this pocket calcualtor stuff."

    --
    Weaselmancer
    rediculous.
  10. How to test a nuke.. without testing one by ScottLindner · · Score: 3, Insightful

    How do they know they got it right?

    --
    Slashdot.. where people join together in deliberate ignorance.
    1. Re:How to test a nuke.. without testing one by stratjakt · · Score: 2, Funny

      They simply check the result by hand.

      Call your broker, because it's a good time to invest in pencil and paper futures.

      --
      I don't need no instructions to know how to rock!!!!
    2. Re:How to test a nuke.. without testing one by ScottLindner · · Score: 1

      ROFL.. that's awesome.

      For the record.. I'm not throwing stones at them. It just struck me as a somewhat amusing way to think about it. How *do* they know they got it right?

      --
      Slashdot.. where people join together in deliberate ignorance.
    3. Re:How to test a nuke.. without testing one by LiquidCoooled · · Score: 2, Interesting

      Thats actually quite simple.

      If they are modelling everything without calibration from known experimental results then anything this machine can produce is as trustworthy as internet gossip.

      For instance, if you were creating a weather prediction machine (easier to explain), you would feed it with all your historical data and allow the calculations to run from a set date in the past. If the results matched up with actual observed results for the following day/week/periods then you begin to build confidence in your algorythm.
      You continue this and allow it to calculate longer and longer runs, most likely tweaking your code as you go along.

      To put it into real perspective, heres the real version of the simulated experiment.

      --
      liqbase :: faster than paper
    4. Re:How to test a nuke.. without testing one by ScottLindner · · Score: 1

      Yah.. I know. I was trying to be funny. Didn't work so well I guess.

      --
      Slashdot.. where people join together in deliberate ignorance.
    5. Re:How to test a nuke.. without testing one by owlstead · · Score: 1

      Why, they compare it with the 100ths of useless tests that pre-dated it of course. If it did not go "boom" it went wrong.

    6. Re:How to test a nuke.. without testing one by Anonymous Coward · · Score: 0

      They know they got it right the same way scientists know evolution is right. They fit the evidence as best as they can to the problem (square peg in round hole situation), interpret the evidence the wrong way to make up any gap in the "proof" and believe they can do no wrong because they are scientists and we are merely non-scientists.

    7. Re:How to test a nuke.. without testing one by Fordiman · · Score: 1

      Spoken like a true creationist.

      Tell me, do you do barmitzvahs?

      --
      110100 1101000 1101000 1100110 0 1101111 1101000 1100011 1
    8. Re:How to test a nuke.. without testing one by ScottLindner · · Score: 1

      They weren't useless tests. They were measuring yield and I'm sure a wide variety of other things.

      However, the tests are useless in concept. I mean.. I personally would prefer they all were a dud.

      --
      Slashdot.. where people join together in deliberate ignorance.
  11. My ship does better than that! by tbcpp · · Score: 1, Funny

    So what? My destroyer in EVE does 215tf!

    Wait....I need to stop playing that game so much.....

    --
    Man is the lowest-cost, 150-pound, nonlinear, all-purpose computer system which can be mass-produced by unskilled labor.
  12. Smart, sure. But is it happy? by fred_sanford · · Score: 5, Funny

    Oblig. H2G2. "Here I am, brain the size of a planet and they ask me to take you down to the bridge. Call that job satisfaction? 'Cos I don't." - Marvin

  13. Just wait... by Raul654 · · Score: 3, Informative

    BlueGene/L has a sister project, Cyclops64 (formerly known as BlueGene/C) due out sometime late in 2006 or early 2007. My research group is (a) helping IBM do hardware verification on it. and (b) developing the systems software for it [esp. the compiler]. Cyclops64 could very well blow BlueGene/L out of the water.

    --


    To make laws that man cannot, and will not obey, serves to bring all law into contempt.
    --E.C. Stanton
    1. Re:Just wait... by Joebert · · Score: 1

      I don't mean to sound like a troll, but isn't that kind of a waste ?

      207.3 / 360 = 0.57583 (roughly 57.5%)

      Does the project you mention use more brute power, or increase efficiency ?

      --
      Wanna fight ? Bend over, stick your head up your ass, and fight for air.
    2. Re:Just wait... by LWATCDR · · Score: 1

      The compiler sounds like about as much fun as the one for Cell.
      Sounds like a very interesting project. I guess you have no problem writing and debugging multithreaded code?

      --
      See my blog http://ilovecookes.blogspot.com/ for light hearted technical information.
    3. Re:Just wait... by Kesch · · Score: 1

      How does it compare to ?

      --
      If this signature is witty enough, maybe somebody will like me.
    4. Re:Just wait... by Raul654 · · Score: 4, Insightful

      C64 takes a totally different approach to high performance computing. Most supercomputer architectures are built around a moderate to large number of very, very fast (and power-hungry) processors. For example, Big Mac at Virgina Tech had something like 10,000 pentium 4 class processors. Cyclops64 is have an *enormous* number of processors (on the order of a million), but running only at 500 mhz, making them much easier to cool). The idea is to give the programmer more thread units than he knows what to do with, running very close together at a low level.

      --


      To make laws that man cannot, and will not obey, serves to bring all law into contempt.
      --E.C. Stanton
    5. Re:Just wait... by Kesch · · Score: 1

      AHH! I forgot to close the HTML tag properly(Note to self: USE PREVIEW!)

      The question mark should have the word "Roadrunner" before it.

      Also for those who don't want to follow the link. Roadrunner is a supercomputer being developed at Los Alamos National Laboratory with aims to run at a sustained petaflop.

      --
      If this signature is witty enough, maybe somebody will like me.
    6. Re:Just wait... by ChrisGilliard · · Score: 1

      RTFA, most programs use only 5% of the processing power according to TFA so 57% is pretty good.

      --
      No Sigs!
    7. Re:Just wait... by Raul654 · · Score: 1

      The most important sentence in that article: "If a 'go' decision is made to pursue the goal of a sustained petaflop, a final phase would be executed, with plans for completion at the end of 2007" The whole world is racing to build the world's first computer to sustain one petaflop. It's only a matter of time. I'm told the Japanese project (which is already underway) is expected to finish sometime around 2008/2009. Our project, C64, has been going since 1999, and I think it's got a really good shot of being the first. On the other hand, I find their claim that they can go from scratch to a petaflop computer by the end of next year (18 months from now) to be impossibly optimistic.

      --


      To make laws that man cannot, and will not obey, serves to bring all law into contempt.
      --E.C. Stanton
    8. Re:Just wait... by Joebert · · Score: 1

      I did RTFAAH.

      Untill you consider that 57% is the MOST ever used at a sustained rate by the machine.

      Then it seems like a waste to build somthing that can do more.

      --
      Wanna fight ? Bend over, stick your head up your ass, and fight for air.
    9. Re:Just wait... by Raul654 · · Score: 4, Interesting

      Cell was designed around one single objective - to get a clock rate as sickeningly high as possible, because clock speed cells. Trust me when I say that programmability was not (at all) a consideration (I should mention - my research group got one of the very first Cell processor's sent to the US. We are currently in the process of implimenting OpenMP on it to make it a little nicer to program).

      As far as writing multi-threaded code, I've spent the last 5 months rewriting the NAS CG benchmark to work effeciently on Cyclops64, which will probably play some part of my PhD thesis. (A sidenote: All of NASA's NAS implimentations are written in Fortran (except Integer Sort), which would have necessitated me rewriting NAS-CG in C. Fortunately, I didn't have to start from scratch, because the Japanese had already done the hard part).

      --


      To make laws that man cannot, and will not obey, serves to bring all law into contempt.
      --E.C. Stanton
    10. Re:Just wait... by Raul654 · · Score: 1

      You have to ask yourself - 57% of what? Of the peak theoretical performance. Peak theoretical performance is the performance you get under ludicrious circumstances - a continious stream of (only) multiply-and-accumulate instructions. (Each MDAC counts as two floating point operations, even though many architectures impliment it as a single instruction). Not only is it impossible to reach 100% effeciency with any program, but it's nearly impossible to even approach 100% if the program is supposed to do something useful (as opposed to being a toy program designed to get to 100% utilization).

      --


      To make laws that man cannot, and will not obey, serves to bring all law into contempt.
      --E.C. Stanton
    11. Re:Just wait... by LWATCDR · · Score: 1

      I did notice when I read the description of the Cyclops64 that the CPU seemed a bit more balanced than the Cell. It almost seemed like the inverse of the Cell with multiple threaded units tied to an FPU. I would guess that the FPU is optimized for double precision operations vs the Cell being optimized for single.
      Does the Cyclops64 support out of order execution?
      Just kind of wondering. My programing is limited to Xscale, Intel, and AMD cpus. The big cool toys fascinates me.

      --
      See my blog http://ilovecookes.blogspot.com/ for light hearted technical information.
    12. Re:Just wait... by Joebert · · Score: 1

      So, since there's no telling what a system may be programmed to do, measuring theoretical performance with elementry units is the only way to get a measurement. At least that's what I'm getting.

      I'm not saying it's anyones fault, but now that there's systems comming together that once again perform beyond peoples wildest dreams, maybe some people could get together & define a higher level unit to measure theoretical performance with.

      --
      Wanna fight ? Bend over, stick your head up your ass, and fight for air.
    13. Re:Just wait... by Raul654 · · Score: 2, Insightful

      The compiler [the current version, at any rate] is based on gcc. So it sports the same out-of-order execution you would expect to get from compile-time optimization. I am not sure if it has hardware-based re-ordering. My guess would be that no, it does not, but without the Principles of Operation in front of me, I couldn't say (the advisor borrowed my paper copy for IPDPS 2006 and hasn't given it back yet).

      --


      To make laws that man cannot, and will not obey, serves to bring all law into contempt.
      --E.C. Stanton
    14. Re:Just wait... by Raul654 · · Score: 3, Informative

      What you are describing has already been done, and was done quite a while ago. Around 1990, NASA realized that the way we do parallel benchmarks sucks. The way most benchmarks (including hte parallel ones) work is that some organization posts the code, and people have to compile and run the code as-is. There's not much room there for optimization (other than tweaking the compiler flags, some trivial hardware settings, 'etc), which is essential to getting good parallel performance (because parallel machines vary so widely). So performance was tied very closely to the implimention over which nobody had any control.

      NASA approached the problem differently. Their numerical analysis group put out a set of "paper and pencil" benchmarks (based on real world problems that one would encounter, for example, fluid dynamics). The actual implimentation was left up to the individual companies. This is what we know today as the NAS benchmark suite.

      --


      To make laws that man cannot, and will not obey, serves to bring all law into contempt.
      --E.C. Stanton
    15. Re:Just wait... by Joebert · · Score: 1
      The actual implimentation was left up to the individual companies.

      I remember the Intel VS Advanced Micro Devices benchmark disputes I've read & heard about, and now, measuring in elementry units sounds like a pretty good idea.

      Raul, if I had a snack-pack, I'd give it to you, you rock !
      --
      Wanna fight ? Bend over, stick your head up your ass, and fight for air.
    16. Re:Just wait... by Cicero382 · · Score: 1

      Interesting. But if you use this approach to handle cooling problems, don't you lose processing power due to the effect of inter processor communications?

      We use a large(ish) cluster - admittedly not even remotely in your league, but our main limitation has always been node connection bandwidth/lag.

    17. Re:Just wait... by demo · · Score: 1

      I first parsed C64 as Commodore 64, which indeed does take a different approach to high performance computing, with it's 1.02Mhz...

      --
      ---
    18. Re:Just wait... by Anonymous Coward · · Score: 0

      That's actually kind of funny, as several years ago in our OCR project we had a Japanese professor working remotely(in Japan) with us, and he only knew FORTRAN. The rest of us wrote everything in C. (i.e. PITA converting that spaghetti code into C. Linking the object code together with GNU tools at that time didn't work out so well... Another option that we tried was running the various chunks of code as separate processes on separate machines glued together with shell scripts, sort of a simplistic multiprocessor setup.)

      Hardwarewise we went from Sun Sparcstation 2s(SunOS/Solaris) to SGI O2(IRIX). Along the way we evaluated various Pentium desktops running linux, and a proto-type transputer based system(32 processor) both of which never went anywhere. Although the transputer company had done a decent job at automating some parallelization techniques, there was still a great deal of work that had to be done manually(i.e. re-write algorithms) to make effective use of the procs. Good thing that we used the GNU tool chain early on, rather than the proprietary compilers and libraries, although we lost a fair amount of performance by going that route, but gained relatively simple portability.

    19. Re:Just wait... by LWATCDR · · Score: 1

      If the hardware doesn't support reordering wouldn't you get a big performance hit if the you use a gcc's standard optimization? I am just a compiler user not a writer so I could be totaly wrong, But if I don't ask I will never know. Over all it looks very cool but very programer dependant. For a super computer that isn't a terrible thing.
      I also assume that the interger units are basied on the Power ISA.

      --
      See my blog http://ilovecookes.blogspot.com/ for light hearted technical information.
    20. Re:Just wait... by Raul654 · · Score: 1

      I don't think the integer units are based on anything. The whole chip is being custom designed from scratch. (Interestingly enough, the VHDL code for the chip is being written by only one guy - the project leader himself).

      As far as instruction re-ordering -- for parallel computation, the big peformance hits occur with waits, synchronizations/barriers, and locks/mutexes. Making these cheap and reducing the number of them is the biggest way to increase performance.

      --


      To make laws that man cannot, and will not obey, serves to bring all law into contempt.
      --E.C. Stanton
    21. Re:Just wait... by Raul654 · · Score: 1

      I honestly have no idea about inter-chip communication issues. All of our work has focused on intra-chip issues.

      --


      To make laws that man cannot, and will not obey, serves to bring all law into contempt.
      --E.C. Stanton
    22. Re:Just wait... by Deth+Rot · · Score: 1

      Now I know where to send all my old computers.... 8P

    23. Re:Just wait... by LWATCDR · · Score: 1

      "for parallel computation, the big performance hits occur with waits, synchronizations/barriers, and locks/mutexes"
      Is Cyclops64 using a shared memory system? Most clusters I have seen used message passing. On those systems your bottle necks tend to be in message passing.
      Yes mutexes are a lot of fun. I tend to use mutexes in my code just long enough to make a copy of the data structure for the thread to use. Yes it is cheating and relatively inefficient but it is also pretty safe and keep blocking to a minimum. Most of my threads tend to be very asymmetrical in nature so it isn't much of an issue for me.

      --
      See my blog http://ilovecookes.blogspot.com/ for light hearted technical information.
  14. I suspect the answer ends up by jhw539 · · Score: 4, Funny

    42.

    1. Re:I suspect the answer ends up by Kesch · · Score: 1

      Since this machine is built with FLOPS in mind the answer is more likely

      42.0

      --
      If this signature is witty enough, maybe somebody will like me.
  15. it doesn't work like that by tpjunkie · · Score: 4, Informative

    It doesn't take .2 teraflops to model one atom, or even two atoms, even account for effects on the quantum level.. However, when you take into acount that each atom will more or less interact with every other atom, you have a massive amount of interactions to model. Thats what takes so much processing power.

  16. Perspective by Anonymous Coward · · Score: 1, Funny
    2006:
    performs very complex quantum calculations to simulate the behaviour of thousands of atoms in three dimensions. Wow.

    2016:
    performs very complex quantum calculations to simulate the behaviour of thousands of atoms in three dimensions. That's all? Man, your game console is totally lame.
    1. Re:Perspective by Anonymous Coward · · Score: 0

      2026: Performs real-time quantum simulation of the old 200TFlop IBM machine running quantum simulations and simultaneously finds Sarah Connor.

  17. Fill in Blank Please by Frightening · · Score: 2, Funny

    Imagine a _________ cluster of those.

    Well done, you may now enter. Gaming room to the right, pron cubicles left, and crazy linux hardware center up ahead.
    We hope you enjoy your stay at Geek Heaven.

    1. Re:Fill in Blank Please by Anonymous Coward · · Score: 0

      mmmmm Goo Goo Cluster....

    2. Re:Fill in Blank Please by bohemian72 · · Score: 1

      Or more apropos:

      Imagine a cluster _________ of those.

      --
      The greatest thing you'll ever learn is just to love and be loved in return.
  18. HPCWire Interview by multimediavt · · Score: 4, Informative

    http://www.hpcwire.com/hpc/699401.html

    There's some additional info about BlueGene and what Livermore thinks of it here. What this interview neglects to mention is the millions of dollars being spent on IBM and internal developers to get this code (and any others) working on BlueGene. I was briefed by the hardware and software teams that built BlueGene and I can tell you, it's no easy task to bring apps to that platform. Kuznezov seems to trivialize it in the interview and I'm gonna have to go back and review the process again. Maybe it has changed since my briefing in early 2004, but somehow I doubt it.

    1. Re:HPCWire Interview by multimediavt · · Score: 1

      Ok, having reviewed the following document, IBM Redbook BlueGene/L: Application Development I'll lighten my "it's no easy task to bring apps to [this] platform" statement. It does appear that IBM has done some considerable work on the APIs and MPI support. Like any big beasty, there's always something you have to do to code before it will run well. I'd say from having another look, that it's probably no harder to bring apps to BlueGene than it is to bring them to System X running Mac OS X. It ain't a picnic, but it's certainly doable for a lot of community and homegrown code bases.

    2. Re:HPCWire Interview by Kupek · · Score: 1

      You may be interested in a paper from PLDI of this year, Shared Memory Programming for Large Scale Machines. They implemented UPC on BlueGene/L, and the paper explains the infrastructure they developed to do that. However, it's not about how to program on BlueGene/L.

  19. Yes, but... by Vulture101 · · Score: 0, Redundant

    can it run windows vista?

    1. Re:Yes, but... by alfrin · · Score: 1

      No. It lacks a 256mb graphics card. Well, it can run it, just not with the Aero UI.

  20. wait, only 3 dimensions??? by Fry-kun · · Score: 1

    i thought there were more dimensions in the subatomic world o_O

    --
    Did you know that "FTW" ("for the win") is a direct translation of "Sieg Heil"?
  21. 3D atom rendering? by KoenWaterBalloon · · Score: 1

    "... The program, called Qbox, performs very complex quantum calculations to simulate the behaviour of thousands of atoms in three dimensions. ... " Rumours say that it may actually be able to render Aero's 3D-interface as well.

  22. Screenshot here by ultramk · · Score: 2, Funny

    I wonder what the cubes represent?

    Oh, wait. Qbox. Nevermind.

    m-

    --
    You catch enchiladas by picking them up behind the head and holding them underwater until they don't kick anymore -VeGas
  23. Quantum Monte Carlo by poszi · · Score: 2, Informative
    First, what do these equations look like such that it takes 200 gigaflops just to model one atom.

    The article is light on details but I suppose the only quantum algorithm that can handle 1000 atoms is Quantum Monte Carlo. The problem is that the algorithm is cubic with the number of particles (and has a huge prefactor). So in essence 1000 atoms is 1000^3=10^9 more time consuming than one. And I'm sure they still use dramatic simplifications, even though they have the most powerful computer. They probably do not consider all electrons, instead they use pseudopotentials. And the Quantum Monte Carlo is likely in a fixed-node variant which is approximate. How long does it take? It's hard to tell but probably a few hours or days each and they are performing several those with different conditions.

    --

    Save the bandwidth. Don't use sigs!

  24. only by tacokill · · Score: 1

    Only if it's in base-13.

  25. I had one of those... by philipmather · · Score: 1

    ...but all the nodes fell off.

    --
    Regards, Phil
  26. Why not put that power to good use by Skraut · · Score: 1

    Like finding The Answer to The Ultimate Question Of Life, the Universe and Everything

    --
    Introducing Microsoft Vacuum 1.0 The first Microsoft product that doesn't suck.
    1. Re:Why not put that power to good use by Zero__Kelvin · · Score: 1

      Ah, hell ... I could do that on an old TRaSh/80:

      10 print "42"

      Those who don't know what the hell the parent poster and I are talking about obviously has not read their Douglas Adams!

      --
      Guns don't kill people; Physics kills people! - John Lithgow as Dick Solomon on Third Rock From The Sun
  27. What are these simulations calculating? by Vellmont · · Score: 1

    Does anyone know what these calculations are trying to determine? In essence, what's the central problem to determining the reliability of old nuclear weapons? I would have thought they're doing simulations of detonation of these aged weapons, but the article talks about using molybdenum, which isn't a fissile material.

    --
    AccountKiller
    1. Re:What are these simulations calculating? by lposeidon · · Score: 0

      probably 2+2=5

      --
      Lizard "Never let them set limits on your mind!"
    2. Re:What are these simulations calculating? by Bill+Barth · · Score: 1

      They often calculate the effects of radiation from the fissile material on its surrounding container, the nearby electronics, etc.

      --
      Yes...I am a rocket scientist.
    3. Re:What are these simulations calculating? by Vellmont · · Score: 1

      Huh. I had assumed the unreliability came from increased impurities in the plutonium do to natural decay and spontaneus fision, not radiation affecting the surrounding electronics, explosives, tamper, etc.

      --
      AccountKiller
    4. Re:What are these simulations calculating? by Fordiman · · Score: 1

      Actually, 2+2==5 for very large values of 2.

      --
      110100 1101000 1101000 1100110 0 1101111 1101000 1100011 1
    5. Re:What are these simulations calculating? by Angstroman · · Score: 1

      Two answers: 1) these results are unclassified. Classified calculations may be done for other materials and conditions which will be more directly applicable to weapons questions. And more importantly, 2) the goal of the calculations is developing an a priori understanding of the behavior of high-Z (many electrons) materials at extreme conditions. Calculating the response of a material like Mo allows comparison of the numerical result with actual experiments to see if the calculation is correctly reproducing the real physics. This may not represent exact conditions in a weapon, but it is getting the science right which is the first goal. When you establish that the science is right, you are in a position to do more things with confidence. Note also that Blue Gene/L is used for a wide array of scientific calculations, not just things of interest for weapons physics.

  28. Thousands of atoms by the+Atomic+Rabbit · · Score: 1
    performs very complex quantum calculations to simulate the behaviour of thousands of atoms in three dimensions.

    Sounds impressive, but that's only about a 10 atoms on a side.

    1. Re:Thousands of atoms by mangu · · Score: 1
      that's only about a 10 atoms on a side


      Exactly. That only goes to show how much CPUs still have to evolve. Every time someone mentions a new more powerful CPU here in /. there are people who ask "why, what's the use?". For many types of physical simulations, the most powerful CPUs in the world are still pathetically slow.


      And that's also a reason why carefully optimized code in C or Fortran with the inner loops written in assembler is still needed. Java, or Ruby, or Python, or any other interpreted language will not do.

    2. Re:Thousands of atoms by sxeraverx · · Score: 1

      10 on a side?

      I only count 1.304 (26th root of 1000)

      But don't ask me how to get .304 of an atom. That's for the nuclear physicists to figure out.

  29. Yeah, right. by hdante · · Score: 1

    The simulations help scientists at the US government's Department of Energy determine the reliability of the country's ageing stockpile of nuclear weapons without actually detonating the weapons.

    Oh, my. High technology in the purpose of supporting American terrorism. Throw all those stuff away ! Let the biggest computation in the world measure the amount of happiness of the amoeba population in the year 3000.

  30. math by xstaytruex · · Score: 1

    so can it help me with my math homework?

    1. Re:math by chawly · · Score: 1

      Nope ! Some things are just impossible !

      --
      How many beans make five, anyhow ? ... Charles Walmsley
  31. WOW by kbox · · Score: 1

    The program, called Qbox, performs very complex quantum calculations to simulate the behaviour of thousands of atoms in three dimensions. Wow

    If it come to a choice between complex calculations and playing WoW on it i know what i would pick..

  32. A few more iterations by ender_ · · Score: 3, Insightful

    Imagine, if you will, taking this super-computing ability out a few years. Can the U.S. justify the invasion of a country X because X successfully simulated an attack on the U.S? Or maybe they just had the computing power to simulate it.

    To the UN: We'd like you to look at these satellite images that clearly show a super computer simulating the destruction of the U.S. We have to take out these terrorists and we're willing to go it alone.

    Afterward: Well it turns out that they didn't have the computing power at all, the images we had were of a mobile home park.

    --
    Bzzt Whir Click
    1. Re:A few more iterations by Anonymous Coward · · Score: 0

      That's an insightful 5 comment about quantum calculations? God, we need better moderators.

  33. "Infinite" loops by mangu · · Score: 1
    Linux can finish that loop in 5 seconds


    Not *that* infinite loop. The "infinite" loop that Linux and any other OS can finish in 5 seconds (if the CPU speed is right) is:

    int n;
    for (n = 1; n > 0; n++) ;

    This loop will actually finish because n will overflow and become negative after it reaches the largest value that can be represented as an integer in the machine it's running.



    1. Re:"Infinite" loops by yarbo · · Score: 1

      yarbo@oxygen /crap/src/temp/inf $ cat inf.c
      int main(){
                      int n;
                      for (n = 1; n > 0; n++) ;
                      return 0;
      }

      yarbo@oxygen /crap/src/temp/inf $ time ./inf

      real 0m6.761s
      user 0m6.748s
      sys 0m0.003s

      #and just for fun
      yarbo@oxygen /crap/src/temp/inf $ gcc -O2 -fomit-frame-pointer inf.c -o infO2
      yarbo@oxygen /crap/src/temp/inf $ time ./infO2

      real 0m2.736s
      user 0m2.720s
      sys 0m0.003s

      #all tests ran on a dual AMD K7 1.6Ghz with 2 gigs of RAM

  34. You are absolutely right! by mangu · · Score: 1
    FTFA: "It simulates interactions between 1000 molybdenum atoms under high pressure"


    And the atomic number of molybdenum is... 42

  35. Yeah but by obsidianpoet · · Score: 1

    Yeah 200 teraflops is nice, but how many Frames Per Second can it get in Half Life 2? :)

    --
    "Gentlemen, You cannot fight in here, this is the War Room...." - Dr Strangelove
  36. Re: Molybdenum not fissile? by WhatDoIKnow · · Score: 1

    That's what they want you to think...

  37. And the answer is... by Anonymous Coward · · Score: 0

    42

    1. Re:And the answer is... by chawly · · Score: 1

      The correct answer is three and a half. So there !

      --
      How many beans make five, anyhow ? ... Charles Walmsley
  38. Hot Babe? by softcoder · · Score: 1

    So I presume that "HotBabe" winds up in the all-together when this is run?

  39. Optimize it for AI by mrcaseyj · · Score: 1

    If you're sort of on the inside, let IBM know you'd like to see Cyclops 64 or it's successors optimized for AI. By some estimates Blue Gene was the first computer to exceed the computational power of the human brain. But of course it's not intelligent because it's not optimized for that. A wee bit of software still needs to be developed also. That's kind of big news when you think about it. A computer's power may now be more than the human brain. The singularity is near indeed.

  40. Other news:1001 atoms quantum PC beats Blue Gene/L by viking2000 · · Score: 1

    Other news: 1001 (molybdenum) atom quantum computer beats Blue/Gene.

    It actually:
    - calculated in nanoseconds what blue Gene took days to do
    - Fits here: "."

  41. Windows Vista Performance Rating by squidy19 · · Score: 1

    Yeah but I heard they just put Vista beta 2 on it and it gave it a performance rating of 1 :)

  42. a better way ? by kyc · · Score: 1

    I think an algorithm that results in a very complicated operation like this should definitely not be the best way to solve the problem. I mean ; you can calculate the exact node voltages in a 6th order system by numerically solving the integro-differential equations using an IBM average computer. But an average school kid can also solve that system ( if the numbers are not too cumbersome ) by transforming everything into s-domain rather impressively ! Mathematical models are what we invent for theoretical solutions; but I do not think those electrons need to evaluate terabits of information to move. OF course; observing a physical system consumes entropy, i.e we have to pay to observe or simulate an electron, but the mathematical models should , among infinitely many solutions, and/or can be made simpler. If physicists tell these computer virtuosos to solve 1000th order integro-differential equations containing transcendental functions; they should be replied : Go find a simpler model for your freaky system ! =)

    --
    There's plenty of room at the bottom! Richard P. Feynmann
  43. Complexity adds up by noopm · · Score: 1

    Parent is right, it is complex interaction of particles in a complex/coupled condensed matter system that adds complexity to the system (Usuallly solved with the time varying schrodinger equation, some pseudopotentials etc). Interactions with the nuclei are often ignored (Born approximation). Simple calculations for small clusters with good symmetry can now be relatively easily done on your PC or simple Beowulf clusters nowadays using popular programs such as Gaussian. Scaling it up to 100 atoms requores some serious horsepower like this. A good open source/GPL program for condensed matter physics related calculations can be found at www.abinit.org (ABINIT short for ab-inito caluclations)

  44. Wow indeed by mnmn · · Score: 2, Interesting

    Thousands of atoms. Shrodingers/Bohrs equations for all of them.

    This has interesting consequences for the study of plastics, DNA, virii and other complex molecules.

    Perhaps the program can run in a loop trying every possible atomic combination to produce the best of certain attributes, as in give me the hardest material or give me an easy to manufacture room temp superconductor. It bypasses the whole invention/discovery step.

    --
    "Give orange me give eat orange me eat orange give me eat orange give me you." -Nim Chimpsky
  45. Blue Genie! by Anonymous Coward · · Score: 0

    I thought this was about the Towbin Dodge "Sexy Blue Genie" character.

    Mighty disappointing to find it's about some computer or somethin.

    Chop Chop it.

  46. And from QBasic came by Anonymous Coward · · Score: 0

    Qbox. It all makes sense, world fastest basic box!

    -m10

  47. I heard... by Anonymous Coward · · Score: 0

    It can calculate an infinate loop in under 5 seconds!

  48. What is most interesting is.... by SubliminalVortex · · Score: 1

    The "Big Blue Marble" we call earth has been running at magnitudes of 'flops' for ages. Perhaps if they didn't install that evolution software, the aliens would not have stopped avoiding that planet that kept blue screening.

  49. Speed kills by Sqreater · · Score: 1

    I suggest that even 1+1=2 is wrong at 207.3 teraflops for more than a few seconds.

    --
    E Proelio Veritas.
  50. Couldn't run vista.... by woolio · · Score: 1

    I think BG/L only has something like 256MB ram per node... And with no hard disk and no video card!

    But could it run Linux? Yep, it does!

  51. !Physics + !CS = CRAP by woolio · · Score: 1

    The problem I see with projects like BG/L is one of two things a happen:

    1) Software is implemented by CS majors who have little understanding of the math and physics involved. They probably implement highly computationally intensive (inefficent) algorithms well (i.e. no bubblesort).

    2) Software is implemented by Physics majors who although knowing the syntax of C/fortran, don't understand how to write good programs. Their implementations are numerically correct, but highly inefficient [e.g. they use non-scalable algorithms on huge systems]. They seem to have no clue of Amdahl's law....

    So even if they proudly exclaim that they wrote a program that uses 100 Terraflops, I suppose the same result could have been found using several orders magnitude fewer operations (with better written software).

    But hey, what is their competition?