How to make two threads do something in turn, i.e., A => B => A => B
....?
I know the code below is not correct, but I do not know how to make it
correct. Could anybody help?
=======================================
mutex=Mutex.new
t=Thread.new {
while true
Thread.stop
puts "B move..."
Thread.main.wakeup
end
}
while true
puts "A move..."
t.wakeup
Thread.stop
end
--
Posted via http://www.ruby-forum.com/.
Since you want to have one thread active at a time only this is not a
case for threads. If at all you might use Fibers:
http://www.rubyinside.com/ruby-fibers-8-useful-reads-on-rubys-new-concurrency-feature-1769.html
http://www.ruby-doc.org/core-1.9/classes/Fiber.html
The simplest solution is to code interchanges directly:
Actor = Struct.new :number do
def alive?; rand(10) != 0 end
def step
printf "Actor %p working...\n", number
end
end
acts = Array.new(2) {|i| Actor.new i }
until acts.empty?
acts.delete_if do |a|
a.step
!a.alive?
end
end
Kind regards
robert
On Fri, May 13, 2011 at 9:33 AM, Zd Yu <zdyu2000@gmail.com> wrote:
How to make two threads do something in turn, i.e., A => B => A => B
....?I know the code below is not correct, but I do not know how to make it
correct. Could anybody help?=======================================
mutex=Mutex.newt=Thread.new {
while true
Thread.stop
puts "B move..."
Thread.main.wakeup
end
}while true
puts "A move..."
t.wakeup
Thread.stop
end
--
remember.guy do |as, often| as.you_can - without end
http://blog.rubybestpractices.com/
hi Zd -
how about using a GLib::Timeout instead of threads? threads can gum
up the works if you're not careful...
######
require 'glib2'
repeat = true
GLib::Timeout.add(1000){
p '=>A'
true ? repeat : false
}
GLib::Timeout.add(1000){
p '=>B'
true ? repeat : false
}
######
the true or false at the end of each block tells the timeout whether
to repeat the block or stop - true repeats, false stops. the argument
to the #.add method is the amount of time to wait before repeating.
- j
--
Posted via http://www.ruby-forum.com/.
Thanks Robert and Jake. I must use threads. Actually my original problem
is much more complicated and I just simplified it to ask in this forum.
I just found the ConditionVariable class, and it seems it is the key to
implement such cooperation between threads.
Please help review my code below. Let me know if I did anything wrong.
(I have tested the code with both C Ruby and JRuby, and it works well.)
=====================================
require 'thread'
mutex = Mutex.new
resource = ConditionVariable.new
next_one = 'A'
a = Thread.new {
while true
mutex.synchronize {
while next_one != 'A'
resource.wait(mutex)
end
}
puts "A..."
next_one = 'B'
mutex.synchronize {
resource.signal
}
end
}
b = Thread.new {
while true
mutex.synchronize {
while next_one != 'B'
resource.wait(mutex)
end
}
puts "B..."
next_one = 'A'
mutex.synchronize {
resource.signal
}
end
}
a.join
b.join
exit
--
Posted via http://www.ruby-forum.com/.
Robert,
I want to use multi-threading + JRuby to achieve better performance.
My problem has a single input file that contains millions of lines. Each
line is the input of a time-consuming computing and will generate an
output result.
What in my mind is:
1. the main thread prepares N working threads, and put them into sleep
state.
2. the main thread open the input file and pass the file object to each
thread[:file]
3. the main thread send a "GO" command to all the working threads
4. each thread works in the below loop:
4.1 lock the mutex associated with the file object, read a line, and
then unlcok. if EOF is encountered, exit from the loop.
4.2 do the very time-consuming computing
4.3 put the result to thread.current[:result]
4.4 signal the main thread to pick up the result
4.5 go to sleep state (waiting for being waken up by the main thread)
5. the main thread works in the below loop:
5.1 go to sleep state until being waken up by one of the working
threads.
5.2 check all the working threads' [:result] and extract them out and
do some aggregation.
5.3 for those threads whose result has been picked, send a signal to
let them proceed with the next line.
6. once all the working threads finish, the main thread output the
aggregated result.
--
Posted via http://www.ruby-forum.com/.
Thank you Robert!
I did not know the Queue/SizedQueue classes. They perfectly meet my
requirements.
Thank you again!
--
Posted via http://www.ruby-forum.com/.
Thanks Robert and Jake. I must use threads.
Why?
Actually my original problem
is much more complicated and I just simplified it to ask in this forum.
Then apparently you did not abstract the problem properly. Before we
jump to solutions can you explain why you say you must use threads?
What is the real problem you are trying to solve?
I just found the ConditionVariable class, and it seems it is the key to
implement such cooperation between threads.Please help review my code below. Let me know if I did anything wrong.
The whole approach is too complicated for the problem to be solved (see above).
Cheers
robert
On Fri, May 13, 2011 at 2:48 PM, Zd Yu <zdyu2000@gmail.com> wrote:
--
remember.guy do |as, often| as.you_can - without end
http://blog.rubybestpractices.com/
I want to use multi-threading + JRuby to achieve better performance.
My problem has a single input file that contains millions of lines. Each
line is the input of a time-consuming computing and will generate an
output result.What in my mind is:
1. the main thread prepares N working threads, and put them into sleep
state.
2. the main thread open the input file and pass the file object to each
thread[:file]
3. the main thread send a "GO" command to all the working threads
Did you ever hear of blocking queues?
4. each thread works in the below loop:
4.1 lock the mutex associated with the file object, read a line, and
then unlcok. if EOF is encountered, exit from the loop.
4.2 do the very time-consuming computing
4.3 put the result to thread.current[:result]
4.4 signal the main thread to pick up the result
4.5 go to sleep state (waiting for being waken up by the main thread)
5. the main thread works in the below loop:
5.1 go to sleep state until being waken up by one of the working
threads.
5.2 check all the working threads' [:result] and extract them out and
do some aggregation.
5.3 for those threads whose result has been picked, send a signal to
let them proceed with the next line.
6. once all the working threads finish, the main thread output the
aggregated result.
This sounds like a very typical application of farmer worker. You
create two queues, one for tasks and one for results. Then you start
a thread which fetches results from the result queue and processes
them. Then you start a number of threads which read from the tasks
queue, process tasks and place results in the result queue. Finally
you use Thread#value to join on the result processor.
# untested
require 'thread'
WORKERS = 5
tasks = SizedQueue.new WORKERS * 10
results = SizedQueue.new WORKERS * 10
agg = Thread.new do
state = Hash.new 0
th = WORKERS
while th > 0
x = results.deq
if Thread === x
th -= 1
else
# aggregate
state += 1
end
end
state
end
workers = WORKERS.times.map do
Thread.new do
until (it = tasks.deq) == tasks
results.enq(process it)
end
results.enq(Thread.current)
end
end
p agg.value
Kind regards
robert
On Mon, May 16, 2011 at 3:19 AM, Zd Yu <zdyu2000@gmail.com> wrote:
--
remember.guy do |as, often| as.you_can - without end
http://blog.rubybestpractices.com/