. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 733 56 Tasks 737 57 Scheduling 741 58 Mul�-Threading 749 58.1 ccall using a threadpool (Experimental) . . . . . . . . . . . type now has a thread-safe replacement, accessed as Threads.Condition. With that addi- �on, task scheduling primi�ves such as ReentrantLock are now thread-safe (#30061). • It is possible to schedule and can be used to wait for mul�ple events at the same �me, which provides for dynamic scheduling. In dynamic scheduling, a program decides what to compute or where to compute it based on when other jobs finish

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 735 57 Tasks 739 58 Scheduling 743 CONTENTS xiii 59 Mul�-Threading 751 59.1 ccall using a threadpool (Experimental) . . . type now has a thread-safe replacement, accessed as Threads.Condition. With that addi- �on, task scheduling primi�ves such as ReentrantLock are now thread-safe (#30061). – It is possible to schedule and can be used to wait for mul�ple events at the same �me, which provides for dynamic scheduling. In dynamic scheduling, a program decides what to compute or where to compute it based on when other jobs finish

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1120 49 Tasks 1126 49.1 Scheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1132 49.2 Synchronization occur at intervals (by default, 1 ms on Unix systems and 10 ms on Windows, although the actual scheduling is subject to operating system load). Moreover, as discussed further below, because samples are sampling tasks that are running—a wall-time task profiler sam- ples tasks independently of their scheduling state. For example, tasks that are sleeping on a synchroniza- tion primitive at the time the profiler

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1119 49 Tasks 1125 49.1 Scheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1131 49.2 Synchronization occur at intervals (by default, 1 ms on Unix systems and 10 ms on Windows, although the actual scheduling is subject to operating system load). Moreover, as discussed further below, because samples are sampling tasks that are running—a wall-time task profiler sam- ples tasks independently of their scheduling state. For example, tasks that are sleeping on a synchroniza- tion primitive at the time the profiler

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1119 49 Tasks 1125 49.1 Scheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1131 49.2 Synchronization occur at intervals (by default, 1 ms on Unix systems and 10 ms on Windows, although the actual scheduling is subject to operating system load). Moreover, as discussed further below, because samples are sampling tasks that are running—a wall-time task profiler sam- ples tasks independently of their scheduling state. For example, tasks that are sleeping on a synchroniza- tion primitive at the time the profiler

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1111 48 Tasks 1117 48.1 Scheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1123 48.2 Synchronization occur at intervals (by default, 1 ms on Unix systems and 10 ms on Windows, although the actual scheduling is subject to operating system load). Moreover, as discussed further below, because samples are sampling tasks that are running—a wall-time task profiler sam- ples tasks independently of their scheduling state. For example, tasks that are sleeping on a synchroniza- tion primitive at the time the profiler

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 756 57 Tasks 761 58 Scheduling 767 59 Multi-Threading 775 59.1 ccall using a threadpool (Experimental) . . . . . . . . . . can be used to wait for multiple events at the same time, which provides for dynamic scheduling. In dynamic scheduling, a program decides what to compute or where to compute it based on when other jobs effectively executed sequentially on a single OS thread. Future versions of Julia may support scheduling of tasks on multiple threads, in which case compute bound tasks will see benefits of parallel

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 739 58 Tasks 743 59 Scheduling 749 60 Mul�-Threading 757 60.1 ccall using a threadpool (Experimental) . . . . . . . . . . . can be used to wait for mul�ple events at the same �me, which provides for dynamic scheduling. In dynamic scheduling, a program decides what to compute or where to compute it based on when other jobs finish are effec�vely executed sequen�ally on a single OS thread. Future versions of Julia may support scheduling of tasks on mul�ple threads, in which case compute bound tasks will see benefits of parallel execu�on

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 754 57 Tasks 759 58 Scheduling 765 59 Multi-Threading 773 59.1 ccall using a threadpool (Experimental) . . . . . . . . . . can be used to wait for multiple events at the same time, which provides for dynamic scheduling. In dynamic scheduling, a program decides what to compute or where to compute it based on when other jobs effectively executed sequentially on a single OS thread. Future versions of Julia may support scheduling of tasks on multiple threads, in which case compute bound tasks will see benefits of parallel

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 756 57 Tasks 761 58 Scheduling 767 59 Multi-Threading 775 59.1 ccall using a threadpool (Experimental) . . . . . . . . . . can be used to wait for multiple events at the same time, which provides for dynamic scheduling. In dynamic scheduling, a program decides what to compute or where to compute it based on when other jobs effectively executed sequentially on a single OS thread. Future versions of Julia may support scheduling of tasks on multiple threads, in which case compute bound tasks will see benefits of parallel