Module-based parallel JS strawman
pyalot at gmail.com
Sun Nov 6 11:03:12 UTC 2016
On Sun, Nov 6, 2016 at 6:57 AM, Isiah Meadows <isiahmeadows at gmail.com>
> TL;DR: I'm proposing a completely different threading model,
> supporting lightweight and cooperative multitasking while allowing
> synchronous, thread-safe communication and inspection. Apologies for
> the length.
Cooperative multitasking is a mode of operation where a thread once started
continues to run until it yields control. What you are describing isn't
cooperative multitasking since it lacks the ability to yield. Therefore
your suggestion is preemptive multitasking where tasks timeshare CPU time
(presumably switching at random/scheduled intervals at the interpreter
It's widely acknowledged that preemptive multitasking (however you
implement it be that via interpreter level granularity, or as OS native
threads etc.) is difficult to control and often results in incorrect code,
race conditions, data corruption, mutex proliferation and deadlocks. It
also routinely fails to efficiently address I/O scheduling concerns,
because it is effectively just trying to timeshare a single strand of
processing across disjoint threads of execution. However, preemptive
multitasking is an effective strategy to timeshare CPU time if that is the
bottleneck. It could be argued though that WebWorkers already fill that
role more effectively.
Structured coroutines is a concept that allows switching between strands of
execution by "yielding" control to another strand. This isn't necessarily
related to multitasking, but it can be. If the coroutines are managed by a
scheduler, which is trivial to implement and customize in the presence of
coroutine functionalty, then coroutines can be used to implement
cooperative multitasking. It's widely acknowledged that cooperative
multitasking is not an effective strategy to address CPU timesharing,
however it is an extremely efficient method to address all other forms of
scheduling problems (such as I/O scheduling).
Please note that efficiency in scheduling is always a function of how well
the scheduler matches the use-case in question. Thus it is important to
have a low level concept like coroutines upon which user-code can exist
that implements the scheduling. Examples of scheduling problems may include:
- wait for user-input arrives (i.e. wait for input)
- wait for network actcivity (download or upload) has finished (i.e.
wait for xhr)
- wait for a WebWorker has finished processing (i.e. wait for
- wait for GPU activity (i.e. query results, texImage2D, bufferData,
shader compile etc.)
- evaluation of a dependency graph
- evaluation finite state machines (without resorting to state
I believe it would be much better to introduce true coroutines to JS, than
to try to introduce preemptive threading.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the es-discuss