12-02-2010
So, there is a semaphore to take control of the file, for each file, whether reading or writing. You have to create two semaphores and set them to the available state, two empty files, and then start the participants. Are the numbers in text or raw integer? Is the number count the line count or the file size / 4 ? Where do you see your problem?
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hi all,
I have an Producer/Consumer program in C(using shared memory and semaphores).It is working fine with sleep calls after every read/write operation.Each one is a independent program.Now if i remove the sleep calls in consumer,it goes on waiting in the loop till the producer puts some valid... (3 Replies)
Discussion started by: poorni_uma
3 Replies
2. Programming
The intention of the program. Create N threads with 2 shared memories.
One shared memory to write, one shared memory to recieve.
Consumer creates 2 shared memory to share with producer.
I need H threads for the producer as well(somebody help on it..)
Also another question, would segment_id... (2 Replies)
Discussion started by: joey
2 Replies
3. UNIX for Dummies Questions & Answers
I would like to loop through a set of directories, performing operation(s) on each one. The basic script** is
dirs=`find . -name .svn -print`
for f in $dirs; do
echo "Processing $f directory .."
done
Fine and dandy, but here is the problem: the find expression must complete... (2 Replies)
Discussion started by: jakeo25
2 Replies
4. UNIX for Dummies Questions & Answers
I would like to loop through a set of directories, performing operation(s) on each one. The basic script** is
dirs=`find . -name .svn -print`
for f in $dirs; do
echo "Processing $f directory .."
done
Fine and dandy, but here is the problem: the find expression must complete... (7 Replies)
Discussion started by: jakeo25
7 Replies
5. Programming
Control two exclusively shared resources. The two resources are two files. The producer will write even numbers to one file, and odd numbers to another one. The consumer respectively reads from each file until it gets 5 even numbers and 5 odd numbers.
Can any one help me with the code.
... (0 Replies)
Discussion started by: gokult
0 Replies
6. Shell Programming and Scripting
Control two exclusively shared resources. The two resources are two files. The producer will write even numbers to one file, and odd numbers to another one. The consumer respectively reads from each file until it gets 5 even numbers and 5 odd numbers.
Can any one help me with the code.
... (1 Reply)
Discussion started by: gokult
1 Replies
7. UNIX for Advanced & Expert Users
Control two exclusively shared resources(semaphore). The two resources are two files. The producer will write even numbers to one file, and odd numbers to another one. The consumer respectively reads from each file until it gets 5 even numbers and 5 odd numbers.
Can any one help me with the... (0 Replies)
Discussion started by: gokult
0 Replies
8. Programming
Control two exclusively shared resources(semaphore). The two resources are two files. The producer will write even numbers to one file, and odd numbers to another one. The consumer respectively reads from each file until it gets 5 even numbers and 5 odd numbers.
Can any one help me with the... (0 Replies)
Discussion started by: gokult
0 Replies
9. UNIX for Dummies Questions & Answers
Control two exclusively shared resources. The two resources are two files. The producer will write even numbers to one file, and odd numbers to another one. The consumer respectively reads from each file until it gets 5 even numbers and 5 odd numbers.
Can any one help me with the code.
... (3 Replies)
Discussion started by: gokult
3 Replies
10. UNIX for Dummies Questions & Answers
normally, i hate asking someone to do my homework for me but am getting desperate right now.
i have a project about consumer producer problem. the deadline is tonight at 23:55. but i havent gotten it working yet. i just COULDNT get it to work right yet.
the problem is as follows: the C - program... (0 Replies)
Discussion started by: alexantosh
0 Replies
LEARN ABOUT MOJAVE
thread::semaphore5.18
Thread::Semaphore(3pm) Perl Programmers Reference Guide Thread::Semaphore(3pm)
NAME
Thread::Semaphore - Thread-safe semaphores
VERSION
This document describes Thread::Semaphore version 2.12
SYNOPSIS
use Thread::Semaphore;
my $s = Thread::Semaphore->new();
$s->down(); # Also known as the semaphore P operation.
# The guarded section is here
$s->up(); # Also known as the semaphore V operation.
# Decrement the semaphore only if it would immediately succeed.
if ($s->down_nb()) {
# The guarded section is here
$s->up();
}
# Forcefully decrement the semaphore even if its count goes below 0.
$s->down_force();
# The default value for semaphore operations is 1
my $s = Thread::Semaphore->new($initial_value);
$s->down($down_value);
$s->up($up_value);
if ($s->down_nb($down_value)) {
...
$s->up($up_value);
}
$s->down_force($down_value);
DESCRIPTION
Semaphores provide a mechanism to regulate access to resources. Unlike locks, semaphores aren't tied to particular scalars, and so may be
used to control access to anything you care to use them for.
Semaphores don't limit their values to zero and one, so they can be used to control access to some resource that there may be more than one
of (e.g., filehandles). Increment and decrement amounts aren't fixed at one either, so threads can reserve or return multiple resources at
once.
METHODS
->new()
->new(NUMBER)
"new" creates a new semaphore, and initializes its count to the specified number (which must be an integer). If no number is
specified, the semaphore's count defaults to 1.
->down()
->down(NUMBER)
The "down" method decreases the semaphore's count by the specified number (which must be an integer >= 1), or by one if no number
is specified.
If the semaphore's count would drop below zero, this method will block until such time as the semaphore's count is greater than or
equal to the amount you're "down"ing the semaphore's count by.
This is the semaphore "P operation" (the name derives from the Dutch word "pak", which means "capture" -- the semaphore operations
were named by the late Dijkstra, who was Dutch).
->down_nb()
->down_nb(NUMBER)
The "down_nb" method attempts to decrease the semaphore's count by the specified number (which must be an integer >= 1), or by one
if no number is specified.
If the semaphore's count would drop below zero, this method will return false, and the semaphore's count remains unchanged.
Otherwise, the semaphore's count is decremented and this method returns true.
->down_force()
->down_force(NUMBER)
The "down_force" method decreases the semaphore's count by the specified number (which must be an integer >= 1), or by one if no
number is specified. This method does not block, and may cause the semaphore's count to drop below zero.
->up()
->up(NUMBER)
The "up" method increases the semaphore's count by the number specified (which must be an integer >= 1), or by one if no number is
specified.
This will unblock any thread that is blocked trying to "down" the semaphore if the "up" raises the semaphore's count above the
amount that the "down" is trying to decrement it by. For example, if three threads are blocked trying to "down" a semaphore by
one, and another thread "up"s the semaphore by two, then two of the blocked threads (which two is indeterminate) will become
unblocked.
This is the semaphore "V operation" (the name derives from the Dutch word "vrij", which means "release").
NOTES
Semaphores created by Thread::Semaphore can be used in both threaded and non-threaded applications. This allows you to write modules and
packages that potentially make use of semaphores, and that will function in either environment.
SEE ALSO
Thread::Semaphore Discussion Forum on CPAN: <http://www.cpanforum.com/dist/Thread-Semaphore>
threads, threads::shared
MAINTAINER
Jerry D. Hedden, <jdhedden AT cpan DOT org>
LICENSE
This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
perl v5.18.2 2013-11-04 Thread::Semaphore(3pm)