Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^3: avoiding a race (read locks)

by Corion (Patriarch)
on Sep 28, 2010 at 15:48 UTC ( [id://862454]=note: print w/replies, xml ) Need Help??


in reply to Re^2: avoiding a race (read locks)
in thread avoiding a race

See the following sentence in tye's scheme:

When you get [the write lock], you read from the position in the file that was the previous end of the file and update your decision as to whether you need to write.

So, in your example case, Process 321 would notice that the file changed since it last checked and that another process already sent the notification.

Replies are listed 'Best First'.
Re^4: avoiding a race (no longer EOF)
by tye (Sage) on Sep 28, 2010 at 17:28 UTC

    Thanks, Corion.

    I also should have pointed out that, in order to keep reading past what had previously been the end-of-file, you'll need to seek( $fh, 0, 0 ) (if you don't just re-open the file).

    - tye        

Re^4: avoiding a race (read locks)
by westy032001 (Novice) on Sep 29, 2010 at 15:07 UTC
    aha ! Thank you !

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://862454]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (None)
    As of 2024-04-25 01:07 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?

      No recent polls found