Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

Reducing Latency -- Reducing Size of Larger Data Structures

0 views
Skip to first unread message

Casey Hawthorne

unread,
Nov 27, 2009, 2:03:57 PM11/27/09
to
An idea to reduce memeory latency, is to have a complex dual/quad/etc.
core CPU surrounded by four or more simpler CPUs.
The simpler CPUs have a simpler instruction set and do less context
switching.
So any operations (e.g. folding, filtering) that reduce the size of a
larger data structure and that can be done on the simpler CPU
instruction sets are shunted off to the simpler CPUs.

So, the complex CPUs receive less data and therefore can have better
cacheing performance, less latency and better throughput.

--
Regards,
Casey

Peter Grandi

unread,
Nov 29, 2009, 9:19:46 AM11/29/09
to

> An idea to reduce memeory latency, is to have a complex
> dual/quad/etc. core CPU surrounded by four or more simpler
> CPUs. The simpler CPUs have a simpler instruction set and do
> less context switching.

Let's call them peripheral processors :-).

> So any operations (e.g. folding, filtering) that reduce the size
> of a larger data structure and that can be done on the simpler
> CPU instruction sets are shunted off to the simpler CPUs.

Let's call that the IBM's Broadband Engine (aka in a variant as
the Cell):

http://www.research.ibm.com/cell/

> So, the complex CPUs receive less data and therefore can have
> better cacheing performance, less latency and better throughput.

And a more complex programming model, ask PS/3 programmers.

0 new messages