The Cilk part is a small set of linguistic extensions to C/C++ to support fork-join parallelism. (The Plus part supports vector parallelism.

Transcription

1 Cilk Plus The Cilk part is a small set of linguistic extensions to C/C++ to support fork-join parallelism. (The Plus part supports vector parallelism.) Developed originally by Cilk Arts, an MIT spinoff, which was acquired by Intel in July Based on the award-winning Cilk multithreaded language developed at MIT. Features a provably efficient work-stealing scheduler. Provides a hyperobject library for parallelizing code with non-local variables. Includes the Cilkscreen race detector and Cilkview scalability analyzer.

2 Nested Parallelism in Cilk uint64_t fib(uint64_t n) { if (n < 2) { return n; else { uint64_t x, y; x = cilk_spawn fib(n- 1); y = fib(n- 2); cilk_sync; return (x + y); The named child function may execute in parallel with the parent caller. Control cannot pass this point until all spawned children have returned. Cilk keywords grant permission for parallel execution. They do not command parallel execution.

3 Loop Parallelism in Cilk Example: In-place matrix transpose The iterations of a cilk_for loop execute in parallel. a 11 a 12 a 1n a 21 a 22 a 2n a n1 a n2 a nn A a 11 a 21 a n1 a 12 a 22 a n2 a 1n a 2n a nn A T // indices run from 0, not 1 cilk_for (int i=1; i<n; ++i) { for (int j=0; j<i; ++j) { double temp = A[i][j]; A[i][j] = A[j][i]; A[j][i] = temp;

4 Serial Semantics Cilk source uint64_t fib(uint64_t n) { if (n < 2) { return n; else { uint64_t x, y; x = cilk_spawn fib(n- 1); y = fib(n- 2); cilk_sync; return (x + y); uint64_t fib(uint64_t n) { if (n < 2) { return n; else { uint64_t x, y; x = fib(n- 1); y = fib(n- 2); serialization return (x + y); The serialization of a Cilk program is always a legal interpretation of the program s semantics. Remember, Cilk keywords grant permission for parallel execution. They do not command parallel execution. #define cilk_for for To obtain the serialization: #define cilk_spawn #define cilk_sync

5 Scheduling The Cilk concurrency platform allows the programmer to express logical parallelism in an application. The Cilk scheduler maps the executing program onto the processor cores dynamically at runtime. Cilk s work-stealing scheduler is provably efficient. uint64_t fib(uint64_t n) { if (n < 2) { return n; else { uint64_t x, y; x = cilk_spawn fib(n- 1); y = fib(n- 2); cilk_sync; return (x + y); Memory $ P Network $ P I/O $ P

6 Cilk Platform 1 uint64_t fib(uint64_t n) { if (n < 2) { return n; else { uint64_t x, y; x = cilk_spawn fib(n- 1); y = fib(n- 2); cilk_sync; return (x + y); Cilk++ source uint64_t fib(uint64_t n) { if (n < 2) { return n; else { uint64_t x = fib(n- 1); uint64_t y = fib(n- 2); return (x + y); Serialization 2 Compiler Linker Binary Hyperobject Library Cilkview Scalability Analyzer Cilkscreen Race Detector Conventional Regression Tests 4 Runtime System Parallel Regression Tests Reliable Single- Threaded Code Parallel Performance Reliable Multi- Threaded Code

7 Execution Model int fib (int n) { if (n<2) return (n); else { int x,y; x = cilk_spawn fib(n- 1); y = fib(n- 2); cilk_sync; return (x+y); Example: fib(4)

8 Execution Model int fib (int n) { if (n<2) return (n); else { int x,y; x = cilk_spawn fib(n- 1); y = fib(n- 2); cilk_sync; return (x+y); Example: fib(4) Processor oblivious 1 0 The computation dag unfolds dynamically.

9 Computation Dag continue edge spawn edge initial strand call edge final strand strand return edge A parallel instruction stream is a dag G = (V, E ). Each vertex v V is a strand : a sequence of instructions not containing a call, spawn, sync, or return (or thrown exception). An edge e E is a spawn, call, return, or continue edge. Loop parallelism (cilk_for) is converted to spawns and syncs using recursive divide-and-conquer.

10 How Much Parallelism? Assuming that each strand executes in unit time, what is the parallelism of this computation?

11 Amdahl s Law If 50% of your application is parallel and 50% is serial, you can t get more than a factor of 2 speedup, no matter how many processors it runs on. Gene M. Amdahl In general, if a fraction α of an application must be run serially, the speedup can be at most 1/α.

12 Quantifying Parallelism What is the parallelism of this computation? Amdahl s Law says that since the serial fraction is 3/18 = 1/6, the speedup is upper-bounded by 6.

13 Performance Measures T P = execution time on P processors T 1 = work = 18

14 Performance Measures T P = execution time on P processors T 1 = work T = span* = 18 = 9 * Also called critical-path length or computational depth.

15 Performance Measures T P = execution time on P processors T 1 = work T = span* = 18 = 9 WORK LAW T P T 1 /P SPAN LAW T P T * Also called critical-path length or computational depth.

16 Series Composition A B Work: T 1 (A B) = T 1 (A) + T 1 (B) Span: T (A B) = T (A) + T (B)

17 Parallel Composition A B Work: T 1 (A B) = T 1 (A) + T 1 (B) Span: T (A B) = max{t (A), T (B)

18 Speedup Definition. T 1 /T P = speedup on P processors. If T 1 /T P < P, we have sublinear speedup. If T 1 /T P = P, we have (perfect) linear speedup. If T 1 /T P > P, we have superlinear speedup, which is not possible in this simple performance model, because of the WORK LAW T P T 1 /P.

19 Parallelism Because the SPAN LAW dictates that T P T, the maximum possible speedup given T 1 and T is T 1 /T = parallelism = the average amount of work per step along the span = 18/9 = 2.

20 Example: fib(4) Assume for simplicity that each strand in fib(4) takes unit time to execute. 5 Work: T 1 = 17 Span: T = 8 Parallelism: T 1 /T = Using many more than 2 processors can yield only marginal performance gains.

21 Greedy Scheduling IDEA: Do as much as possible on every step. Definition. A strand is ready if all its predecessors have executed.

22 Greedy Scheduling IDEA: Do as much as possible on every step. Definition. A strand is ready if all its predecessors have executed. Complete step P strands ready. Run any P. P = 3

23 Greedy Scheduling IDEA: Do as much as possible on every step. Definition. A strand is ready if all its predecessors have executed. P = 3 Complete step P strands ready. Run any P. Incomplete step < P strands ready. Run all of them.

24 Analysis of Greedy Theorem [G68, B75, EZL89]. Any greedy scheduler achieves T P T 1 /P + T. Proof. # complete steps T 1 /P, since each complete step performs P work. # incomplete steps T, since each incomplete step reduces the span of the unexecuted dag by 1.

25 Optimality of Greedy Corollary. Any greedy scheduler achieves within a factor of 2 of optimal. Proof. Let T P * be the execution time produced by the optimal scheduler. Since T P * max{t 1 /P, T by the WORK and SPAN LAWS, we have T P T 1 /P + T 2 max{t 1 /P, T 2T P *.

26 Linear Speedup Corollary. Any greedy scheduler achieves nearperfect linear speedup whenever T 1 /T P. Proof. Since T 1 /T P is equivalent to T T 1 /P, the Greedy Scheduling Theorem gives us T P T 1 /P + T T 1 /P. Thus, the speedup is T 1 /T P P. Definition. The quantity T 1 /PT is called the parallel slackness.

27 Cilk Performance Cilk s work-stealing scheduler achieves T P = T 1 /P + O(T ) expected time (provably); T P T 1 /P + T time (empirically). Near-perfect linear speedup as long as P T 1 /T. Instrumentation in Cilkview allows you to measure T 1 and T.