Democratic Underground Latest Greatest Lobby Journals Search Options Help Login
Google

US nuclear laboratory supercomputer packs a punch

Printer-friendly format Printer-friendly format
Printer-friendly format Email this thread to a friend
Printer-friendly format Bookmark this thread
This topic is archived.
Home » Discuss » Archives » General Discussion (01/01/06 through 01/22/2007) Donate to DU
 
NNN0LHI Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 04:29 PM
Original message
US nuclear laboratory supercomputer packs a punch
http://www.infoworld.nl/idgns/bericht.phtml?id=002570DE00740E18882572300021D932

More details about the hardware held at the Los Alamos Nuclear Laboratory has emerged: it uses Panasas clustered file storage for its petascale nuclear weapons testing supercomputer.

A petascale supercomputer computes at the petaflop level - ten to the power 15 or one million billion floating point operations per second. Parallel supercomputers need parallelized I/O so that the many computing elements can be fed data fast enough to keep them operating at maximum speed.

Serial network-attached storage (NAS) products are not fast enough and clustered file system products, such as Isilon's have emerged to speed data delivery

LANL set up the very first (Cray) supercomputer which ran at 80Mflops. It now uses Panasas storage to supply seven terascale - meaning the one thousand billion FLOPS level - supercomputers with data, and is building the Roadrunner hybrid petascale supercomputer from AMD Opteron and IBM Cell processors, both running Linux.
Printer Friendly | Permalink |  | Top
Xipe Totec Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 04:32 PM
Response to Original message
1. It still doesn't beat the Cray VII
Which can complete an infinite loop in three seconds flat.

















:hide:


Printer Friendly | Permalink |  | Top
 
Dudley_DUright Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 04:39 PM
Response to Reply #1
2. wait till quantum computers hit the scene
and run so fast that they solve a problem before they start on it. :-)

http://www.sciencedaily.com/releases/2006/02/060223084147.htm
Printer Friendly | Permalink |  | Top
 
Xipe Totec Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 04:56 PM
Response to Reply #2
6. Very interesting!
This could crack NP-hard problems:

There are also decision problems that are NP-hard but not NP-complete, for example the halting problem. This is the problem "given a program and its input, will it run forever?" That's a yes/no question, so this is a decision problem. It is easy to prove that the halting problem is NP-hard but not NP-complete.

So, with quantum computing you still couldn't run an infinite loop in finite time, but at least you would know you were spinning your wheels forever.

(and stop the process in three seconds or less)

http://en.wikipedia.org/wiki/NP-hard

Printer Friendly | Permalink |  | Top
 
Commie Pinko Dirtbag Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 05:14 PM
Response to Reply #6
7. That one is beyond hard -- it's unsolvable!
It's proven that there can be no mathematical procedure that can look at any algorithm and determine whether it halts or not. Alan Turing proved that using a neat math trick called "exclusion by diagonal." (don't know how it's called in English)
Printer Friendly | Permalink |  | Top
 
Xipe Totec Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 06:47 PM
Response to Reply #7
12. Yes, it is unsolvable in the general sense
It belongs to a class of problems called NP-hard. Problems that are beyond NP-hard belong to the class NP-complete.

The only way to determine whether a generic algorithm halts or not is to run it and see if it does.

With the quantum computer the answer is obtained before the program runs, therefore you don't have to wait infinitely long for the answer; you will have the answer before the program runs.

Which would be a neat trick.

Printer Friendly | Permalink |  | Top
 
Spinzonner Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 05:20 PM
Response to Reply #2
9. Probably ...
Printer Friendly | Permalink |  | Top
 
Xipe Totec Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 06:35 PM
Response to Reply #9
11. LOL!
:rofl:

touche!
Printer Friendly | Permalink |  | Top
 
Dudley_DUright Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 08:13 PM
Response to Reply #9
14. We have a funny moose on the loose
:-)
Printer Friendly | Permalink |  | Top
 
dubykc Donating Member (321 posts) Send PM | Profile | Ignore Fri Nov-24-06 04:41 PM
Response to Reply #1
3. Isn't "complete an infinite loop" an oxymoron?
After all, how can something that is infinite be completed?
Printer Friendly | Permalink |  | Top
 
Xipe Totec Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 04:46 PM
Response to Reply #3
4. Why yes, yes it is....
and welcome to DU!

:hi:
Printer Friendly | Permalink |  | Top
 
Commie Pinko Dirtbag Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 04:46 PM
Response to Reply #3
5. OMG! How does one reply to this?
At least, without getting a mod warning? :banghead:
Printer Friendly | Permalink |  | Top
 
boolean Donating Member (992 posts) Send PM | Profile | Ignore Fri Nov-24-06 05:16 PM
Response to Reply #3
8. Technically....
Your multitasking OS is an infinite loop....
Printer Friendly | Permalink |  | Top
 
Tesha Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 05:23 PM
Response to Reply #3
10. That was an updated instance of one of the world's oldest computer jokes. (NT)
Printer Friendly | Permalink |  | Top
 
dubykc Donating Member (321 posts) Send PM | Profile | Ignore Sat Nov-25-06 03:51 AM
Response to Reply #10
17. Sorry for being so dense....
I guess I am just not up to date on even the oldest computer humor.
Printer Friendly | Permalink |  | Top
 
jmowreader Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 07:34 PM
Response to Original message
13. I got bad news for you, Sunshine...
Microsoft just put out a press release.

Sez here that Los Alamos' shiny new computer is the Minimum Recommended Configuration for the Windows release after Vista.
Printer Friendly | Permalink |  | Top
 
karlrschneider Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 08:21 PM
Response to Reply #13
15. But you have to buy extra RAM
:evilgrin:
Printer Friendly | Permalink |  | Top
 
HCE SuiGeneris Donating Member (1000+ posts) Send PM | Profile | Ignore Sat Nov-25-06 04:42 AM
Response to Reply #15
19. lmao
:D :9
Printer Friendly | Permalink |  | Top
 
jmowreader Donating Member (1000+ posts) Send PM | Profile | Ignore Sat Nov-25-06 02:14 PM
Response to Reply #15
21. I KNOW that, dammit!
Tell me you EVER got a Microsoft OS past...oh, MS-DOS 2.1...to run in the amount of RAM listed on the box.
Printer Friendly | Permalink |  | Top
 
karlrschneider Donating Member (1000+ posts) Send PM | Profile | Ignore Fri Nov-24-06 08:23 PM
Response to Original message
16. Those silly teraflops, so 2005
;-)
Printer Friendly | Permalink |  | Top
 
Warren DeMontague Donating Member (1000+ posts) Send PM | Profile | Ignore Sat Nov-25-06 04:36 AM
Response to Original message
18. So. When can I play "Halo 3" on one?
That's what I want to know.
Printer Friendly | Permalink |  | Top
 
upi402 Donating Member (1000+ posts) Send PM | Profile | Ignore Sat Nov-25-06 05:14 AM
Response to Reply #18
20. By Christmas
?
:rofl:
Printer Friendly | Permalink |  | Top
 
symbolman Donating Member (1000+ posts) Send PM | Profile | Ignore Sat Nov-25-06 02:42 PM
Response to Original message
22. But it locks up after three months
and you can't get your money back, even with a receipt..

"Sorry but you allowed a 'Protein Unit' to operate it, and that voids all warranties.." :)
Printer Friendly | Permalink |  | Top
 
DU AdBot (1000+ posts) Click to send private message to this author Click to view 
this author's profile Click to add 
this author to your buddy list Click to add 
this author to your Ignore list Sun Nov 03rd 2024, 07:17 AM
Response to Original message
Advertisements [?]
 Top

Home » Discuss » Archives » General Discussion (01/01/06 through 01/22/2007) Donate to DU

Powered by DCForum+ Version 1.1 Copyright 1997-2002 DCScripts.com
Software has been extensively modified by the DU administrators


Important Notices: By participating on this discussion board, visitors agree to abide by the rules outlined on our Rules page. Messages posted on the Democratic Underground Discussion Forums are the opinions of the individuals who post them, and do not necessarily represent the opinions of Democratic Underground, LLC.

Home  |  Discussion Forums  |  Journals |  Store  |  Donate

About DU  |  Contact Us  |  Privacy Policy

Got a message for Democratic Underground? Click here to send us a message.

© 2001 - 2011 Democratic Underground, LLC