[gambit-list] Primitives & practices for paralellism such as work stealing, in SMP Gambit?

Adam adam.mlmb at gmail.com
Sun Sep 17 10:25:43 EDT 2017

Zooming out, the memory ordering question is in here also.

Do you intend to implement a (barrier!) primitive for platforms with weak
memory ordering?

2017-09-17 18:19 GMT+08:00 Adam <adam.mlmb at gmail.com>:

> Hi Marc,
> This is a general question on how to use SMP (and single-processor) Gambit:
> If you're running some algorithm or other code that requires
> fine-granularity work stealing or otherwise parallel execution and/or data
> structure access, how are you supposed to implement that, in a way that
> should have good performance and be effective? -
> Are mutex lock/unlock operations with zero-timeouts, and/or the use of
> condition variables, and/or the use of thread message passing with zero
> timeout, intended to satisfy these use cases, or do you propose other
> primitives or methods?
> Also, do you plan to implement any additional parallelism primitives now
> with SMP Gambit?
> Thanks!
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.iro.umontreal.ca/pipermail/gambit-list/attachments/20170917/a9181738/attachment.htm>

More information about the Gambit-list mailing list