Computer Chess Club Archives

Search

Messages

Subject: Re: On Beowulf - long post

Author: Gian-Carlo Pascutto

Date: 08:57:12 06/05/01

Go up one level in this thread

On June 05, 2001 at 11:49:20, Daniel Clausen wrote:

>Second, there are processors which use more than 1 bit for branch prediction.
>(I think the Sparc-architecture is one of them, but I'm not sure) So
>recognizing simple patterns like 101010 or thelike would not be a problem for
>such architectures either.

The branch predictors on x86 also can do this and much more.

They can recognize quite large patterns. I once stumbled upon
a site that had a great explanation of how it works, but I
dont remember the link (maybe it was at Dr Dobbs)

--
GCP

• Re: On Beowulf - long post Robert Hyatt 11:10:18 06/05/01
• Here ya go Gian-Carlo Pascutto 09:31:30 06/05/01
  • Re: Here ya go Robert Hyatt 11:17:03 06/05/01
    • Re: Here ya go Gian-Carlo Pascutto 11:47:04 06/05/01
      • Re: Here ya go Vincent Diepeveen 17:07:13 06/05/01
        • Re: Here ya go Robert Hyatt 20:03:18 06/05/01
          • Re: Here ya go Vincent Diepeveen 06:33:10 06/06/01
            • Re: Here ya go Robert Hyatt 09:55:45 06/06/01
      • Re: Here ya go Robert Hyatt 12:16:26 06/05/01
        • Re: Here ya go Vincent Diepeveen 17:12:12 06/05/01

This page took 0.01 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.