Slashdot Mirror


Introducing Probability into Chip Design

prostoalex writes "The August issue of Intel Developer Update has an interview with Shekhar Borkar, Intel Fellow and Director of Circuit Research at Intel Corp. talking about the future of microprocessor design and what goes on inside Intel Labs. Borkar tells why we need even faster processors and how probability will make its way into future chip designs - "It's like the shift from Newtonian mechanics to quantum mechanics. We will shift from the deterministic designs of today to probabilistic and statistical designs of the future.""

12 of 271 comments (clear)

  1. 1 + 1 by rastos1 · · Score: 5, Funny
    1 + 1 = 2. However there is a 0.0009% probability of it being 1.999999999.

    Sorry could not resist.

    1. Re:1 + 1 by SpaghettiPattern · · Score: 5, Funny

      That was done before in the first batches of Pentium 0.99999999.

      --

      I hadn't the slightest objection to his spending his time planning massacres for the bourgeoisie... (P.G. Wodehouse)
  2. so does that mean improbability drives too? by Wameku · · Score: 5, Funny

    UM, Ford. theres an infinite number of monkeys outside that want to talk to us about a script for hamlet they've hammered out. PROBABILITY FACTOR OF 1 to 1: any other problems are your own lookout.

  3. Is this new? by Jugalator · · Score: 4, Insightful

    "We will shift from the deterministic designs of today to probabilistic and statistical designs of the future"

    Doesn't branch predictions in current processors use probabilities already?

    --
    Beware: In C++, your friends can see your privates!
    1. Re:Is this new? by bentini · · Score: 4, Interesting
      Probabilities that will always be the same if you run the exact same sequence of commands.

      What he appears to be suggesting is transistors that we acknowledge to be based in an analog world -- their state depends not only on the data you feed them, but also on the temperature they are immersed in, etc.

    2. Re:Is this new? by Jugalator · · Score: 4, Informative

      Oh, I see... The page now loaded for me, and it seems they're simply considering the fact that previously, hardware performance didn't vary that much, but now when we've got down to real small components -- down to atom level -- that are packed closely together, the probability that the chips will behave differently from environment changes becomes greater. And as the probability of chips "misbehaving" increases, there will also be an increasing need of chips that can take this probability of fluctations into account.

      I first thought the article was about speeding up stuff by probabilities and statistics, but it's mostly about solving a currently theoretical problem that might soon become an actual, real world problem. And to solve that problem, we might even have to move away from some of the computer architecture as we know it today.

      --
      Beware: In C++, your friends can see your privates!
  4. Is that 1.999 repeating? by TrekkieGod · · Score: 4, Funny
    Is that .9 repeating? If so, there's a 100% possibility of 1 + 1 = 1.9999...

    .999... is exactly equal to 1. To the non-believers out there, consider that 1/3 = .333..., and that 1/3 + 1/3 + 1/3 = 1.

    --

    Warning: Opinions known to be heavily biased.

    1. Re:Is that 1.999 repeating? by blancolioni · · Score: 4, Insightful


      The supremum of all reals less than one is one. The set itself, as you said, doesn't have a maximum element.

      In a not-at-all-patronising way, I'm surprised that this is even up for discussion on /. but that's probably my bad. Anyway, say X was the maximum real number less than one. Let Y = 1 - (1 - X) / 2. Now clearly Y is less than 1, but also Y - X = (1 - X) / 2 which is > 0 since 1 - X > 0, so Y > X, and therefore X is not the maximum.

    2. Re:Is that 1.999 repeating? by Anonym0us+Cow+Herd · · Score: 4, Informative

      An easier form of this proof that I used back in 1979 or thereabouts is when arguing with those who don't understand that 0.9999... is equal to 1. I had learned this proof even earlier from my excellent math teacher in high school.

      Let x be 0.99999....

      x = 0.9999....
      10x = 9.9999...
      10x - x = 9.9999... - 0.9999... = 9
      10x - x = 9 (the infinite trail of nines drop off in the subtraction)
      but also, 10x - x = 9x
      So, 9x = 9
      Therefore x = 1

      With this form of the proof, it is easier to see how the trailing nines just drop off in the subtraction. After thinking about this, the key seems to be that after multiplying 0.9999... by ten, to get 9.9999..., you still have the same number (infinity) of nines behind the decimal point.

      --
      The price of freedom is eternal litigation.
  5. I remember... by Muad'Dave · · Score: 5, Interesting

    ...back in the heady days of Concurrent Computer their top-of-the-line 3280 processor has "usual branch" instructions. The compiler could use the usual branch instructions to provide hints about the probability of the branch being taken to the processor. In a loop, for instance, you'd use a "usual branch not equal" (UBNE) instruction to send execution back to the top. This would indicate to the processor that it should preemptively invalidaate the cache and pipeline.

    I'm sure many mainstream processors have this now, but it's funny to think that CCUR had this technology in the late 1980's.

    --
    Tiller's Rule: Never use a word in written form that you've only heard and never read. You will end up looking foolish.
  6. it is an old story by wannasleep · · Score: 5, Informative

    In the interview, a lot of things have been left out. The topic is first and foremost old. It goes back to the 80s. Statistical variations have always been taken into account by using worst cases. Problem is that the worst case approach sucks in the latest technologies, so more sophisticated methods have to be used. There has been a lot of research in the last 10 years (Check american, german, and italian universities, just to name few).
    Also, the problem is old, meaning that analog designers had to deal with these problems since the early stages (example: the offset in the operational amplifiers is caused by transistor performance mismatch). Now, digital designs are affected too. First on the clocking network and now all the rest. Furthermore, it is widely known (in the community) that interconnect variations are of the same order of magnitude of the device (i.e. transistor)performance variations, and on the top of that dynamic effects (like cross talk) may severely affect the performance.
    I don't agree with him on the fact that all the variations are gaussian, there is plenty of literature that states the contrary, and major chip makers know it very well.
    Last but not least, there are already tools that deal with statistical variations, although none of them can handle a microprocessor, as they are mostly circtuit simulation-based. All in all, the good news is that awareness is spreading thru the designers.

  7. Re:Corporate Feces by Peldor · · Score: 4, Funny

    At least it didn't say Pentium(R) 4(R). Not for lack of trying, I'm sure.