
Cascading Molecules Drive IBM's Smallest Computer 226
Benoit Fries writes "EE Times reports that IBM researchers have created a simple computation engine that's more than 250,000 times smaller than the most advanced silicon circuitry. Called the world's smallest computer, the system relies on a 'molecular cascade' that pushes a handful of carbon monoxide molecules across a copper surface to perform digital logic functions. 'Even if CMOS density follows Moore's Law for 40 more years, molecular cascades are still going to be smaller,' they said."
Think Smarter - new IBM motto (Score:4, Interesting)
We should be attempting massive parallelism instead of packing more logic per area.
Isn't that how our brain works?
Re:Think Smarter - new IBM motto (Score:2, Insightful)
Re:Think Smarter - new IBM motto (Score:5, Interesting)
Re:Think Smarter - new IBM motto (Score:2, Informative)
Unbounding the Future: the Nanotechnology Revolution
Eric Drexler and Chris Peterson, with Gayle Pergamit William Morrow and Company, Inc.
I don't know where I downloaded it from, but it's a free ebook (.DOC format) download.
I can send you it in PDF if you're interested enough and contact me.
Re:Think Smarter - new IBM motto (Score:5, Insightful)
Re:Think Smarter - new IBM motto (Score:5, Funny)
Now I have a tiny cube with a PC connected by ethernet to a tiny server no bigger than a chopping cart. AND we still don't get any more done than we did back in the day.
Re:Think Smarter - new IBM motto (Score:2, Funny)
Re:Think Smarter - new IBM motto (Score:2, Funny)
lizzardo
Re:Think Smarter - new IBM motto (Score:3, Funny)
Now I have a tiny cube with a PC connected by ethernet to a tiny server no bigger than a chopping cart. AND we still don't get any more done than we did back in the day.
He has a point.
An excercise: Make a graph of average computer size versus average computer nerd's salary. Notice that they both spiral ever-downwards? Maybe the problem is that, as computers get small, the Boss thinks they're simple and won't pay people as much to fix them. Maybe if computers got really huge again, we could scare our employers with some crazy Scotty-talk and demand more money for maintaining the beasts.
Hey, it could happen...
parallelism is a bit overrated (Score:5, Informative)
You have to learn entirely different programming methods to program algorithms to run in parallel. Managing memory and cache access between multiple processors is a pain in the ass on the hardware side. That's what makes mobos for multiple processors more expensive. Plus, some tasks are just not well-suited to scaling across multiple processors at all.
In short, I'd rather have a one processor machine over a two or more processor machine if the one processor machine gives sufficient speed for a reasonable price.
Re:parallelism is a bit overrated (Score:2)
Re:parallelism is a bit overrated (Score:2, Interesting)
A compiler should be able to find all memory accesses that are parallel and provide the appropriate locks around that memory. I don't have the time to prove it mathematically, but here is the idea:
Let's say that memory address X is to be accessed from two or more threads.
int x;
void access_x()
{
x = 5;
}
void indirect_access_x()
{
access_x();
}
void foo1()
{
access_x();
}
void foo2()
{
indirect_access_x();
}
int main()
{
begin_thread(foo1);
begin_thread(foo2);
}
What stops a compiler from understanding that both threads access the memory location 'x' ? all it needs to know is where a thread starts. Then it could certainly built a tree internally for variable access.
Even in cases that you have pointers and parameters, the multithreaded access can still be caught by the compiler:
int x;
int *p =
void pointer_access()
{
*p = x;
}
Re:parallelism is a bit overrated (Score:3)
Yes, it should be able to. Whether it should do is a matter of taste. Paralell programming is still hard, and this doesn't make it significantly easier. It still doesn't tell you how to avoid deadlocks, how to structure your program for reasonable performance (too many locks, and you could just as well have a single-threaded program), how to make transactions (locking every memory access to each variable is not enough, sometimes you want to guarantee that a sequence of accesses is serialized), how to avoid starvation of resources, how to prove your algorithm correct (debuggers are more or less useless in multithreaded programs), how to design the algorithm in the first place, how the design of the interconnections between the processors should be and what this means for performance in the program, and of course the standard issues of priority inversion, cache coherency, thread cancellation, etc...
What stops a compiler from understanding that both threads access the memory location 'x' ?
In C, it's pointer arithmetic. In other languages, the complexity of global analysis (this can be fixed).
Re:parallelism is a bit overrated (Score:2, Informative)
BTW, even for single applications, multi-threading is tricky, but not THAT hard. Any second year CompSci student can do that.
Re:Think Smarter - new IBM motto (Score:2)
Re:Think Smarter - new IBM motto (Score:2)
Pfft.... (Score:5, Funny)
Pfft - if I had a nickel for every time I heard that...
Re:Pfft.... (Score:5, Funny)
Gordon Moore (of Intel) does
More like 27 years... (Score:2)
They say it's 250,000 times smaller than current tech, then they say it's better than current tech plus 40 years of Moore's Law.
Moore's Law states a doubling period of 18 months, or 1.5 years. This gives 26.666... doubling periods for 40 years. So, "if CMOS density follows Moore's Law for 40 more years", it will be 2 ^ 26.666 times smaller, which is in the neighborhood of 106.5 MILLION... that's more than 425 times smaller than "250,000 times smaller".
To reach 250,000 times smaller, under Moore's Law, 27 years would be more than enough.
Also just released.... (Score:5, Funny)
Just what we need! (Score:3, Funny)
Re:Just what we need! (Score:4, Interesting)
Hmm (Score:4, Funny)
Re:Hmm (Score:3, Insightful)
Benchmarks please (Score:5, Funny)
*LoC == Standard metric unit of information (Library of Congress). Size of unit varies from year to year.
Re:Benchmarks please (Score:5, Funny)
*LoC == Standard metric unit of information (Library of Congress). Size of unit varies from year to year.
Exactly! did you also notice...
so small that 190 billion could fit atop a standard pencil-top eraser 7mm (about 1/4-inch) in diameter.
pencil-top eraser?!? What the hell kind of unit is that? Everyone knows that the standard units of area are football fields, US states, and obscure counties! I want to know how many of these things would would fit in one Azerbaijan! [cia.gov]
-
P.S. (Score:4, Funny)
The CIA website provides a convient and fairly comprehensive translation table [cia.gov] between US units and international units.
-
Re:P.S. (Score:2)
That's one of the more frightening things I've ever seen the US government do. I wonder if it was for the sake of W...
Re:Benchmarks please (Score:2, Insightful)
Computing model (Score:3, Interesting)
Re:Computing model (Score:2, Insightful)
big deal (Score:3, Insightful)
Chances are it'll be more than 40 years until they could make an actual product with this technology so I don't think that I'm going to hold off on getting that new conventional cpu quite yet
real life applications? (Score:2)
I'm guessing medicine, but does anyone have any good ideas on how to use it?
Re:real life applications? (Score:2)
Just a thought.
Re:real life applications? (Score:2)
it's called research there maybe no application for it. You are also extremely ignorant if you cannot gues what a an array of logic gates might be used for.
I guess the PC has somewhat lowered the bar.
Nobody knows yet... (Score:5, Insightful)
Kind of like when Alexander Fleming wrote up a journal paper back in 1928(?) about how mould killed bacteria, and Walter Florey found it in a literature search a decade later and set his research team to isolate the responsible compound and figure out how to produce it in bulk.
I've had this experience myself. I needed to find an efficient algorithm for a relatively obscure problem. The usual textbooks didn't help, but I finally located a survey paper which finally revealed a 1981 journal article which described exactly the algorithm I was looking for.
Size is great and all... (Score:5, Insightful)
"The slow operation of the gates -- some required seconds to settle -- underscores the fact that the work was part of a research project."
You pretty much have your choice of one chip that does something 250,000 times in a second, or 250,000 chips that do one thing each a second... Until they can speed these things up, they're more of a curiosity than a useful technology.
Re:Size is great and all... (Score:2, Interesting)
Re:Size is great and all... (Score:3, Funny)
Re:Size is great and all... (Score:2, Interesting)
In any case, it has little bearing on the validity of the original poster's point. A CPU operating at 1Hz is useless unless it is massively parallel. It is also worth noting that you would need several billion of these CPUs in parallel just to equal one of todays processors. So, until they can make it go several billion times faster (not an exageration btw) it is just an interesting experiment.
Re:Size is great and all... (Score:5, Informative)
Applying a little physics (but not too much, since I don't have the references or the desire/ability to go through the really rough calculations
The "average" air molecule travels at about 300 meters/sec at room temperature. This speed is a multiple of the temperature T, divided by the mass m of the molecule - E=3/2kT=1/2 mv^2 (so CO is a little faster than average, since Carbon is lighter than Oxygen or Nitrogen)
So, if they can build room temperature versions of this (the sample was at 4-10 K), and the size remains about the same (17nm across), and the molecules travel say half their speed in atmosphere, and the computational nodes get "recharged" as fast as they calculate, then the thing would be able to go at about 4.4 GHz.
Not too bad, actually.
Probably within an order of magnitude, at least (ie, wrong
Re:Size is great and all... (Score:2)
Oh, the irony
Re:Size is great and all... (Score:2)
Where are all the servers? (Score:5, Funny)
Re:Where are all the servers? (Score:3, Funny)
"I would like to present our newest line of ser...ah...Ahh...CHOOOOO!......Fuck!"
Someone had to say it... (Score:3, Funny)
That was so unexpected.....yeah, right.
CO in this application will be safe (Score:5, Informative)
CO binds very tightly to metallic ligands such as copper. The Carbon atom has an unbound lone pair of electrons, that are donated to the metal's d-electron shell. Additionally the CO molecule creates a pi-back-bonding system with the metal center, making the complex even more stable.
Upshot: the CO is not going to spontaneously leak off the chip into your atmosphere. In any case, I doubt that such logic circuits would contain sufficient carbon monoxide to pose a health threat.
(Interesting side note: CO asphyxiates you by binding very tightly to the iron in hemoglobin in your blood, much more tightly than oxygen can. IIRC, however, CO will preferentially bind to copper over Fe.)
Re:CO in this application will be safe (Score:4, Interesting)
Re:CO in this application will be safe (Score:2)
Re:CO in this application will be safe (Score:2, Interesting)
If my memory serves me right, an alternative term is "chelate" compounds. And I believe its Magnesium - not Manganese that is present in chlorophyll.
Re:CO in this application will be safe (Score:2, Informative)
For example, the Mg in the Cytochrome C Oxidase of Paracoccus Denhas been shown to sometimes be substituted by Mn.
(see Iwata et al, Nature, 24 august 1995)
The first person... (Score:2, Funny)
Re:The first person... (Score:4, Funny)
That would be you, right?
'Exceedingly Slow' Beowulf Cluster? (Score:3, Informative)
It's "exceedingly slow," according to the article. Still, maybe some kind of niche exists for it to be useful. Then again, maybe they'll implement the NOT gate and get this puppy running near the frequency of 500nm light or something.
I'd be excited by that.
Re:'Exceedingly Slow' Beowulf Cluster? (Score:2)
size ain't everything (Score:5, Funny)
250,000 times smaller than the most advanced silicon circuitry. Of course, it's also 250,000,000 times slower. I'm guessing there won't be molecular cascade chips in my PC anytime soon, unless I have a lot of free time...
In other news... (Score:5, Funny)
Re:In other news... (Score:2)
I don't know if they really want this. Look:
the system relies on a 'molecular cascade' that pushes a handful of carbon monoxide molecules across a copper surface to perform digital logic functions.
It is miniture *slavery*. A bunch of cascade dudes bully a "handful" of carbon molecules by pushing them around and dragging them across the copper floor, forcing them to perform functions.
Does not sound like Dwarf Paradise to me.
hmmm... quantum effects (Score:5, Interesting)
1) they were already fallen you just didn't know, or
2) statistically speaking there is a much higher chance for "spontaneous reverse-thermodynamics" on a molecular level.
what i mean is that while macroscopically speaking, the universe is headed toward higher entropy, molecularly speaking, it's not necessarily so; The example commonly given is that you can drop and shatter an egg, or an shattered egg can come together, absorbing the sound waves etc and rise back into your hand. the latter will not (or, has completely ignorable probability of) happening, but as you and the egg gets smaller, the chance of this ignorable probability becomes less so.
hence, a molecular computer has the probability of operating "faultily" because of the laws of thermodynamics is not followed 100%. this is currently overcome by the thousands / millions of electrons we send over gates, probabilistically speaking they still behave on a macro level, but a molecular computer has no such luxury.
i mean, even there was only a minute chance that one molecule will go backwards as what we intended -- counting up the billions of calculations per second we expect from each chip, and the number of chips out there, and then the number of seconds / days / monthes / years they are expected to operate, the chance of error is almost inevitable. some serious redundancy / self-healing hardware / software might need to be invented.
i am just blabbing, though. like i said: i am no molecular physicist, so if there are some here, please comment.
Re:hmmm... quantum effects (Score:4, Interesting)
Re:hmmm... quantum effects (Score:2)
Re:hmmm... quantum effects (Score:2)
Re:hmmm... quantum effects (Score:2)
Re:hmmm... quantum effects (Score:5, Interesting)
I am qualified to answer. Quantum uncertainty
isn't THE problem in this case. You are dealing
with huge atoms like copper and even huger
system like CO. They aren't exactly classical
at this scale but they aren't going to tunnel
out either. Especially since this research was
done at or below 4K (Don only has low temp.
microscope in the lab). At that temperature stuff
doesn't like to go anywhere.
The real limitations here are:
a. STM is slow. In this case STM is used to
manipulate individual atoms so it will be hard to
make this much faster than it is already.
b. STM tips sometimes change. They are usually
atomically sharp so the probability of one atom
moving is not altogether small. Not a big deal
in research but may not be reliable enough for
production.
c. Copper or any other surface cannot be made
entirely free of defects. This limits the size of
circuits you can build. I will be amazed if this
technology scales at all (even by one order of
magnitude).
d. Did I mention this will only work so reliably
at low temperature? You have heard of crazy guys
cooling their OC'ed rigs with liquid nitrogen...
Well, this is waaaay colder than that.
All that said, this is very impressive work as far
as research goes.
Re:hmmm... quantum effects (Score:2, Funny)
Dude, you've got to get out more. :)
Re:hmmm... quantum effects (Score:4, Insightful)
stuff is stable at the atomic level (Score:2)
IBM has some stiff competition... (Score:3, Funny)
Oh my God (Score:5, Funny)
Is God going to sue us for stealing processing power ?
graspee
Re:Oh my God (Score:2, Funny)
Re:Oh my God (Score:3, Funny)
Well duh! What do you think the mice are doing here?
If that's the case... (Score:2)
I tend to think that we're more likely the mung that's collected inside God's keyboard...
"News Flash! Hubble Telescope Detects Giant Fingernail Clipping and Cluster of Muffin Crumbs"
Cheers,
Jim
Re:Oh my God (Score:3, Funny)
He wants it to be accurate, so he's modeling every moment since the year 2001.
You've made a great point about how presumptive all religions are.
Re:Oh my God (Score:2)
If I had a beowulf cluster of these... (Score:5, Funny)
Re:If I had a beowulf cluster of these... (Score:2)
Stephenson was first (Score:2)
Molecular cascade...? (Score:2, Funny)
RMN
~~~
The biggest difference... (Score:4, Funny)
link to their published paper (Score:2, Informative)
Cheating (Score:4, Funny)
The most complex circuit they built is so small that 190 billion could fit atop a standard pencil-top eraser 7mm in diameter.
In my days, when you wanted to show something was really small, you counted how many you could fit on the end of a pin, or in the width of a human hair. Comparing it with something that's almost 1 cm across is cheating.
RMN
~~~
Toppling and resetting the structure! (Score:5, Informative)
My idea is, have a non-stationary background of copper plane, which through some mechanism (which causes repulsion of the CO molecules) places the molecules in the reset position, ready to be "toppled" again!
Like an Etch-a-Sketch (Score:2)
Yeah, but.. (Score:2)
They compare this to a domino effect. I dont recall any dominos volenteering to set themselves back up. Is this just one-shot proccessing? Nice idea, but I dont think this is the future, not in current form anyway.
Smaller = Faster Bitrot (Score:2)
there is a nail stuck in a piece of stone for 200 years.
the nail has fused itself into the stone.
there is a glass window pane, it has slowly melted
into a warbled surface, so the light passing through
it and coming into my room is no longer uniform.
the smaller you make it,
the less long it will last.
the 0.20 micron chips will last longer
than the nano-chips made 10 years later.
cheers!
john [earthlink.net]
Re:Smaller = Faster Bitrot (Score:2)
Glass doesn't flow. Old glass is crap because it was crap when they made it. Their manufacturing techniques weren't as good as ours.
Here a link [sciencenews.org].
Re:Smaller = Faster Bitrot (Score:2)
into a warbled surface, so the light passing through
it and coming into my room is no longer uniform.
Nope. Myth. Glass doesn't sag. It was like that to begin with[0]; glass processes have gotten better which is why window panes today are perfectly flat. This analogy actually DISPROVES what you are trying to say.
[0] They used to blow a big bubble of molten glass on the end of a metal rod. While spinning the bubble, someone would break the bubble at the end, causing the edges of the bubble to fly out and form a spinning disk. The edge portions of the discs were cut into panes; while pretty flat, they would have concentric irregularities. The center of the disk was called a bulls-eye, they would use them in windows and lamps to spread light in different directions.
A Beowulf Cluster 20 years from now: (Score:4, Funny)
*SNEEZE*
"SHIT! OK, nobody move..."
I think I'll patent it... (Score:2, Funny)
Moores Law will eventually hit a limit. (Score:2)
Now it's electrons on silicon
Next its CO on Cu
Then will it be quarks in a single atom?
Eventually we will be figuring out how to slow down tachyons enough to read our output.
I go now to the Toronto Metro Ref
I'm looking for something to invent
I need a 1901 newspaper
More than he thought (Score:2)
The head of a pin is the supercomputer.
Nanotech is yesterday's news.
Even Feynman [zyvex.com] couldn't imagine how much room there is.
Moleculer Tinker Toys (Score:2, Interesting)
damn (Score:3, Funny)
Oh wait.... they power ALL computers
Cascading domino NOT gate is easy (Score:5, Informative)
TtttttttttttttR
i
i
I
It's 2 runs in an L shape. Simultaneously gate a True signal at T and the input signal at I, read the result at R. Note: True = Falls, False = Stands.
Here's how it works
If I = True then the shorter I run knocks down the last t. When the longer T run reaches R, the last t will already have fallen so R will not fall. so we have:
I = True --> R = False
If I = False then the T run will knock down R. So we have:
I = False --> R = True
That's a NOT gate!
Combine that with a V shaped OR gate and you have a NOR gate. It's well known that any logic function can be constructed from NOR gates.
Jonathan Weesner
Re:Cascading domino NOT gate is easy (Score:2)
Now I'm only midway through my intro to digital logic class this semester, but from my current understanding can't you massage any logic function to be implemented with any sort of gates you want? It may not be pretty, but it always seems possible.
Re:Cascading domino NOT gate is easy (Score:2)
this is it (Score:2)
The Intel Crazium Processor (Score:4, Funny)
I can do this! (Score:3, Funny)
It's an interesting project, but that's a long way to go....
Re:What? (Score:5, Funny)