Re: Why CSST?

On Thu, 31 May 2007 11:55:21 -0400 Art Celestini <spambait@xxxxxxxxxxxxx>
wrote:

:>It uses a different serialization mechanism than PLO. From the POPs:

I saw that.

The question was as to the need - what MVS (or VM or Linux) function has this
need?

:>Programming Notes:

:>1. COMPARE AND SWAP AND STORE may be used in conjunction with other
:> COMPARE AND SWAP or COMPARE DOUBLE AND SWAP instructions to
:> manipulate locks, queue pointers, or other fields that require
:> interlocked updates.

:>2. COMPARE AND SWAP AND STORE should not be used to manipulate
:> fields that are also manipulated by PERFORM LOCKED OPERATION.

--
Binyamin Dissen <bdissen@xxxxxxxxxxxxxxxxxx>
http://www.dissensoftware.com

Director, Dissen Software, Bar & Grill - Israel


Should you use the mailblocks package and expect a response from me,
you should preauthorize the dissensoftware.com domain.

I very rarely bother responding to challenge/response systems,
especially those from irresponsible companies.

----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to listserv@xxxxxxxxxxx with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
.

Relevant Pages

  • Re: Why CSST?
    ... COMPARE AND SWAP AND STORE may be used in conjunction with other ... COMPARE AND SWAP AND STORE should not be used to manipulate ...
    (bit.listserv.ibm-main)
  • Re: The Emperors new clothes
    ... It's lock-free and doesn't involve KCSS (k-compare, single swap) which is only obstruction-free. ... It doesn't require double wide compare and swap and that's all I'm saying for now. ... would be sparc which doesn't have double wide compare and swap. ...
    (comp.arch)
  • Re: race on multi-processor solaris
    ... >looping it's in a race with other processors and while it may ... >the hardware guarantees fairness for compare and swap loops. ... Compare and swap does not guarantee fairness; ...
    (comp.unix.solaris)
  • Re: "Sorting" assignment
    ... move bytes than to compare them you save time by lazy swap. ... Let us assume it takes time A to compare two bytes, ... I believe a Z80 took 3 clock cycles to fetch an instruction ...
    (comp.programming)
  • Re: race on multi-processor solaris
    ... >>the hardware guarantees fairness for compare and swap loops. ... > Compare and swap does not guarantee fairness; ... Compared to conventional locks which tank when a queue forms on the lock ...
    (comp.unix.solaris)