The topic of (scalable) concurrency models in the era of multicore PCs
has been of great interest recently in programming language communities.
I'm just curious about this and would like to know how PicoLisp deals with
concurrency. The (traditional) multiprocessing by forking, shared memory
etc. is error-prone and not scalable!


On Fri, Oct 9, 2009 at 7:48 PM, Tomas Hlavaty <> wrote:

> Hi Nik,
> > I didn't find anything useful about multithreading and
> > concurrency model in PicoLisp by a quick search in google.
> >
> > Does PicoLisp has some sort of built-in concurrency at all?
> picolisp doesn't do threads but uses processes and ipc instead (see
> 'fork', 'pipe', 'tell', 'hear', 'rpc' etc. in the picolisp reference).
> For example, the database stuff or the web server uses multiple
> processes.
> There have been discussions about concurency on this mailing list in the
> past I think.  When I tried to understand concurency in picolisp, I
> wrote which implements the Dining
> Philosophers Problem.
> Is there anything specific you want to achieve?
> Regards,
> Tomas
> --

Reply via email to