Maybe you could work something out using READL shared locks.
Process 1 takes a READU lock, does it's work, then demotes to a READL
lock and notifies process 2. Process 2 takes a READL lock and tells
process 1, which drops it's READL and goes on to its next task.
Process 2 then promotes it's lock to a READU.
While process 1 and 2 have the READL, no other process can take a
READU. Another process could however take a READL, and you would have
to code anyone taking a READL to check for the lock transfer and drop
their READL.
On May 4, 2009, at 8:38 AM, Marco Manyevere wrote:
The solution I have for a certain problem could easily be solved
without redesigning large portions of the existing code if I could
implement an algorithm to have process1 release a READU lock and
have process2 acquire that lock ahead of all other processes that
may be interested in the same lock. Does anyone have an idea how I
could do this in UV?
Kind regards, Marco.
-------
u2-users mailing list
[email protected]
To unsubscribe please visit http://listserver.u2ug.org/
-------
u2-users mailing list
[email protected]
To unsubscribe please visit http://listserver.u2ug.org/
