Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
Message from discussion How Many Processor Cores Are Enough?
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Chris Thomasson  
View profile  
 More options Oct 24 2006, 7:45 am
Newsgroups: comp.arch
From: "Chris Thomasson" <cris...@comcast.net>
Date: Tue, 24 Oct 2006 04:45:57 -0700
Local: Tues, Oct 24 2006 7:45 am
Subject: Re: How Many Processor Cores Are Enough?
"Joe Seigh" <jseigh...@xemaps.com> wrote in message

news:hvGdnXAAUoqlaqDYnZ2dnUVZ_rGdnZ2d@comcast.com...

> Nick Maclaren wrote:
>> In article <4q4ledFlff5...@individual.net>,
>> Del Cecchi <cecchinos...@us.ibm.com> writes:
>> |> |> If I interpret this article
>> http://www.linuxjournal.com/article/8211
>> |> correctly, expecting those stores to not be reordered as seen from |>
>> another cpu is unrealistic unless steps are taken in the software to |>
>> make it so.  It is realistic to expect them to occur in order as seen |>
>> from the cpu where they originate.

>> Thanks for finding that; at a quick glance, I agree, and it justifies
>> a more thorough perusal.  The performance issue is why I have always
>> been somewhat suspicious of salesmen and othhers who claim complete
>> sequential consistency on the memory of a modern SMP system.  I can't
>> think of how it can be done, efficiently, even in theory ....

> Transactional memory, aka magic at this point.

The cache coherency mechanism that could properly support a robust
transactional memory scheme would have to be really strict IMHO... Think of
scenarios in which there could be lots of reader threads iterating over
large shared linked data-structures in parallel... The transactional
coherency system could potentially wind up having to track all of those many
thousands of reads transactions' that will be generated my the frequently
reading threads... It would die from livelock; ahh the explicit contention
manager to the rescue! So, when the times get tough for TM, it basically is
forced to fold under its security blanket, and wait for things to cool way
down for a while... This is because TM is kind of like obstruction free
algorithms... One small trivial interference from another thread, and the
operations dies and asks the contention manager if it can retry...

I don't think TM can scale very well at all wrt the previous scenarios that
I briefly described...

Any thoughts on this?

http://groups.google.com/group/comp.programming.threads/browse_frm/th...

http://groups.google.com/group/comp.programming.threads/browse_frm/th...

:O


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.