Re: futures and parallel forms in Guile and Bigloo
Sven Hartrumpf <[email protected]> Thu, 20 Aug 2020 17:34:26 +0200 (CEST)
| Newsgroups | gmane.lisp.scheme.bigloo |
|---|---|
| Message-ID | <[email protected]> |
Hello Joseph. Thanks for your message and the link to hop code. I must admit that this looks a little bit scary to me. Maybe it is easier to port https://github.com/ktakashi/scheme-concurrent (which already runs on several Schemes) to Bigloo? It was presented at the Scheme Workshop 2016: http://schemeworkshop.org/2016/ (it's the second talk) Greetings Sven Joseph wrote, 2020-08-06 17:30: > Hello, Sven, > > Given Bigloo's support for threads (pthreads or java threads), efficiently implementing Guile's futures and parallel forms is definitely possible. As mentioned in the Guile documentation, the most obvious implementation would be to introduce a threadpool abstraction and > build the futures and parallel-forms on top of that. Manuel created a similar abstraction for his hop executors. See https://github.com/manuel-serrano/hop/blob/master/src/queue_scheduler.scm. Taking a look at Java's ThreadPoolExecutor abstraction may also be helpful. > > I think this would be an interesting project and would be willing to contribute to it. > > Best Regards, > Joseph Donaldson. > > On Wednesday, August 5, 2020, 3:04:46 AM PDT, Sven Hartrumpf <[email protected]> wrote: > > Dear Bigloo users. > > I read about futures in Guile (see https://www.gnu.org/software/guile/manual/html_node/Futures.html) > and the parallel forms built on-top, e.g. parallel, par-map and par-for-each > (see https://www.gnu.org/software/guile/manual/html_node/Parallel-Forms.html). > > They look very promising, > especially because 8, 16 or more CPU cores are available on more and more > standard CPUs. > > Can these constructs be efficiently implemented in Bigloo, too? > > Greetings > Sven