Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re: Parallel Computation

by bobr (Monk)
on Nov 16, 2010 at 18:33 UTC ( #871795=note: print w/ replies, xml ) Need Help??

in reply to Parallel Computation

Do you referring to tasks like Sort N numbers using NxN processors? We did those task in Parallel algorithm class way back on college, using PRAM assembler.

I am not sure perl is really best environment for such play, since its threads are quite heavy-weight and have quite a cost for shared data (which are essential here). But for experiments you can build number of threads (like for each digit) and wait until less-significant digit thread provide its carry.

EDIT: You can also use library like Coro for lighter cooperative threads.

-- Roman

Comment on Re: Parallel Computation
Replies are listed 'Best First'.
Re^2: Parallel Computation
by Anonymous Monk on Nov 16, 2010 at 18:36 UTC
    No, I am just talking about the simple exercise that I like to do for myself in Perl. I can implement even via fork() if possible. What I am interested is in the mechanism rather than cost.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (5)
As of 2016-05-27 07:49 GMT
Find Nodes?
    Voting Booth?