1 / 69

An HPspmd Programming Model

An HPspmd Programming Model. Bryan Carpenter NPAC at Syracuse University Syracuse, NY 13244 dbc@npac.syr.edu. Goals of this lecture. Motivate a parallel programming model that combines data parallel features from HPF with an explicitly SPMD programming style.

blenda
Download Presentation

An HPspmd Programming Model

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An HPspmd Programming Model Bryan Carpenter NPAC at Syracuse University Syracuse, NY 13244 dbc@npac.syr.edu

  2. Goals of this lecture • Motivate a parallel programming model that combines data parallel features from HPF with an explicitly SPMD programming style. • Review in detail a specific HPspmd language called HPJava.

  3. Contents of Lecture • Introduction. • HPspmd language extensions. • Integration of high-level libraries. • HPJava. • Processes and distributed arrays. • Mapping arrays. • Array sections. • Rules and definitions • A distributed array communication library

  4. HPF status • Standard is more than 6 years old. • Many companies involved in the HPF forum no longer in business; many of those remaining abandoned their HPF projects. • Problems: • Language too complex—robust compilers very difficult to implement. • Perception that language inflexible—limited demand from application developers. • Most parallel applications still developed in direct SPMD style, using MPI, etc.

  5. High-level SPMD libraries • While the HPF language hit problems, various data-parallel SPMD libraries have been deployed: • ScaLAPACK • PetSc • Kelp • Global Array Toolkit • PARTI/CHAOS • Adlib • Higher-level libraries support programming with distributed arrays in essentially MPI-like environment.

  6. Idea of HPspmd • Library approach to distributed arrays clearly works, but lacks uniformity and elegance of data-parallel languages. No unifying framework. • Can we take a minimal subset of the ideas from HPF—unified syntax for distributed arrays—to make the library-based SPMD approach more attractive?

  7. Features of HPspmd • Adopts ideas, run-time technologies and some compilation techniques from HPF. • Abandon: • single, logical, global thread of control, • compiler-determined placement of computations, • compiler-generated, automatic insertion of communications. • Left with: • explicitly MIMD (SPMD) programming model, • syntax for representing distributed arrays, • syntax for expressing placement of computation.

  8. Benefits • Translators are much easier to implement than HPF compilers. No compiler magic needed. • Attractive framework for library development, avoiding inconsistent parametrizations of distributed array arguments. • Better prospects for handling irregular problems—easier to fall back on specialized libraries as required. • Ultimate fall-back: can directly call MPI functions from within an HPspmd program.

  9. Language extensions • HPspmd languages extended from standard base languages (Fortran, C++, Java, . . .). • A program (fragment) that doesn’t use the extensions should be executed exactly as a SPMD program—in independent processes with their own threads of control. • Distributed array types added. • Strictly separate from sequential arrays of base language—no attempt to conceal the distinction. • Distributed controlconstructs added. • Most important is a distributed, data-parallel loop.

  10. An HPspmd program Procs p = new Procs2(P, P); on(p) { Range x = new ExtBlockRange(N, p.dim(0), 1); Range y = new ExtBlockRange(N, p.dim(1), 1); float [[,]] u = new float [[x, y]]; . . . some code to initialize ‘u’ for (int iter = 0; iter < NITER; iter++) { Adlib.writeHalo(u); overall (i = x for 1 : N-2) overall (j = y for 1 + (i` + iter) % 2 : N-2 : 2) u[i, j] = 0.25 * (u[i-1, j] + u[i+1, j] + u[i, j-1] + u[i, j+1]); } }

  11. HPspmd Architecture

  12. HPJava • Language for parallel programming. • Extends Java with syntax for manipulating distributed arrays. • Implements the HPspmd model—independent processes executing same program, sharing elements of distributed arrays. • Processes operate directly on locally owned elements. Explicit communication needed in program to permit access to elements owned by other processes.

  13. Processes and Process Grids • HPJava program started concurrently in some set of processes. • Processes named through grid objects: Procs p = new Procs2(2, 3); • Assumes program currently executing on 6 or more processes. • Restrict execution to processes within grid by on construct: on(p) { . . . }

  14. Basic use of grids • HPJava program: Procs p = new Procs2(2, 3); on(p) { Dimension d = p.dim(0), e = p.dim(1); System.out.prinln(“My coordinates are(“ + d.crd() + “, “ + e.crd() + “)”); } • Sample output: My coordinates are (0, 2) My coordinates are (1, 2) My coordinates are (0, 0) My coordinates are (1, 0) My coordinates are (1, 1) My coordinates are (0, 1)

  15. Distributed Arrays in HPJava • Many differences between distributed arrays and ordinary arrays of Java. New kind of container class with special syntax. • Type signatures, constructors use double brackets to emphasize distinction: Procs2 p = new Procs2(2, 3); on(p) { Range x = new BlockRange(N, p.dim(0)); Range y = new BlockRange(N, p.dim(1)); float [[,]] a = new float [[x, y]]; . . . }

  16. 2-dimensional array distributed over p

  17. Parallel programming • Matrix addition: Procs2 p = new Procs2(2, 3); on(p) { Range x = new BlockRange(N, p.dim(0)); Range y = new BlockRange(N, p.dim(1)); float [[,]] a = new float [[x, y]], b = new float [[x, y]], c = new float [[x, y]]; . . . initialize values in ‘a’, ‘b’ overall (i = x for :) overall (j = y for :) c[i, j] = a[i, j] + b[i, j]; }

  18. The overall construct • Second special control construct (after on)—a distributed parallel loop. • General form parametrized by index triplet: overall (i = x for l : u : s) { . . . } l = lower bound, u = upper bound, s = step. All indices must be within range x. • Special forms: overall (i = x for l : u) { . . . } stride defaults to 1, and: overall (i = x for :) { . . . } lower bound = 0, upper bound = x.size() - 1.

  19. A parallel stencil update program float [[,]] u = new float [[x, y]]; . . . initialize values in ‘u’ float [[,]] n = new float [[x, y]], s = new float [[x, y]], e = new float [[x, y]], w = new float [[x, y]]; Adlib.shift(n, u, 1, 0); Adlib.shift(s, u, -1, 0); Adlib.shift(e, u, 1, 1); Adlib.shift(w, u, -1, 1); overall (i = x for 1 : N - 2) overall (j = y for 1 : N - 2) u[i, j] = 0.25 * (n[i, j] + s[i, j] + e[i, j] + w[i, j]);

  20. Shift communication • As, advertised, communication goes through library call. • Use a binding of the Adlib function, shift: void shift(float [[,]] dst, float [[,]] src, int amount, int dimension); • Destination and source arrays must be identically aligned. • Implements “edge-off” shift. • Overloaded to apply to different array ranks, types.

  21. About overall loop indexes • Why does language demand use of shift? Could we just write: overall (i = x for 1 : N - 2) overall (j = y for 1 : N - 2) u[i, j] = 0.25 * (u[i-1, j] + u[i+1, j] + u[i, j-1] + u[i, j+1]); ? • Generally, no. Symbols i, j are not integer loop indexes. They are distributed indexes. • Value of a distributed index is a location—an abstract element of a distributed range.

  22. Mapping of locations to grid

  23. Distributed indexes • Can only be declared in header of overall construct (or atconstruct—see next slide). • No other location-valued variables (no Java type associated with a location). • In general a subscript used in a distributed array element reference must be a distributed index, whose value is a location in the associated range of the array. • Dramatically limits patterns of subscripting.

  24. The at construct • If a is a distributed array, generally cannot write: a [1, 4] = 73 ; to assign element. 1, 4 not distributed indexes. • If x and y are the ranges of a, can write: at (i = x [1]) at (j = y [4]) a [i, j] = 73 ; • at is the final special control construct of HPJava. Similar to on—restricts execution of body to processes holding specified location.

  25. Relationship between overall and at • If s>0, the construct: overall (i = x for l : u : s) {. . .} is equivalent to for (int n = l; n <= u; n += s) at (i = x [n]) {. . .} • If s<0, it is equivalent to for (int n = l; n >= u; n += s) at (i = x [n]) {. . .}

  26. Global index expression • Inside the body of the construct: at (i = x [n]) { . . . } the expression i` stands for the integer value, n. • Most useful in overall. According to the equivalence in the previous slide, i` is then the global index value.

  27. A Complete example Procs2 p = new Procs2(P, P); on(p) { Range x = new BlockRange(N, p.dim(0)); Range y = new BlockRange(N, p.dim(1)); float [[,]] u = new float [[x, y]], r = new float [[x, y]]; . . . Initialize ‘u’, ‘r’ float [[,]] n = new float [[x, y]], s = new float [[x, y]], e = new float [[x, y]], w = new float [[x, y]]; . . . Main loop Adlib.printArray(u); }

  28. Initialize ‘u’, ‘r’ overall (i = x for :) overall (j = y for :) if (i` == 0 || i` == N - 1 || j` == 0 || j` == N - 1) { u[i, j] = (float) (i` * i` - j` * j`); r[i, j] = 0.0; } else u[i, j] = 0.0;

  29. Main loop do { Adlib.shift(n, u, 1, 0); Adlib.shift(s, u, -1, 0); Adlib.shift(e, u, 1, 1); Adlib.shift(w, u, -1, 1); overall (i = x for 1 : N - 2) overall (j = y for 1 : N - 2) { float newU = 0.25 * (n[i, j] + s[i, j] + e[i, j] + w[i, j]); r[i, j] = Math.abs(newU – u[i, j]); u[i, j] = newU; } } while(Adlib.maxval(r) > EPS);

  30. Load balancing—Mandelbrot set example • Set of complex numbers, c, such that the limit of the iteration: z = c 1 2 z = c + (z ) i+1 i has absolute value less than 2: 2 |z | < 4  • Numerical computation of set: points outside the set are eliminated quickly; points inside or close to the set are computed for many iterations.

  31. Mandelbrot set computation Procs2 p = new Procs2(2, 3); on(p) { Range x = new BlockRange(N, p.dim(0)); Range y = new BlockRange(N, p.dim(1)); boolean [[,]] set = new boolean [[x, y]]; overall (i = x for :) overall (j = y for :) { float cr = (4.0 * i` - 2 * N) / N; float ci = (4.0 * j` - 2 * N) / N; . . . Inner loop } Adlib.printArray(set); }

  32. Inner loop set[i, j] = false; int k = 0; while(zr * zr + zi * zi < 4.0) { if (k++ == CUTOFF) { set[i, j] = true; break; } // z = c + z * z float newr = cr + zr * zr – zi * zi; float newi = ci + 2 * zr * zi; zr = newr; zi = newi; }

  33. Changing mapping of problem • Block distribution leads to poor load-balancing. • To go over to cyclic decomposition, just change Range x = new BlockRange(N, p.dim(0)); Range y = new BlockRange(N, p.dim(1)); to Range x = new CyclicRange(N, p.dim(0)); Range y = new CyclicRange(N, p.dim(1));

  34. Block-wise decomposition of Mandelbrot set

  35. Cyclic decomposition of Mandelbrot set

  36. Using ghost regions • As discussed in previous lecture, ghost regions are extremely useful in parallel stencil updates. • Usually in HPJava, distributed array subscripts must be distributed indexes. Special syntax extension for subscripting arrays with ghost regions: • shifted indexes allowed.

  37. Shifted indexes • If i is a distributed index, then: i ± expression is a shifted index. Here expression is an integer, usually a small constant. • Assuming array a has suitable ghost regions, can write, say: overall (i = x for 1 : N-2) overall (j = y for 1 : N-2) a[i, j] = 0.25 * (a[i-1, j] + a[i+1, j] + a[i, j-1] + a[i, j+1]);

  38. Creating arrays with ghost regions. • No special syntax, but new range classes. ExtBlockRange is a range class alignment-equivalent to BlockRange, but with ghost extensions. • Size of extensions specified in constructor of range object.

  39. Filling ghost regions • Ghost regions not magic. They must be explicitly filled with values from (usually) neighboring processes. • Adlib has a collective communication operation, writeHalo, that does this.

  40. Laplace equation using ghost regions Procs2 p = new Procs2(P, P); on(p) { Range x = new ExtBlockRange(N, p.dim(0), 1, 1); Range y = new ExtBlockRange(N, p.dim(1), 1, 1); float [[,]] a = new float [[x, y]]; … Set boundary values of ‘a’ … Main loop }

  41. Main loop float [[,]] b = new float [[x, y]], r = new float [[x, y]]; do { Adlib.writeHalo(a); overall (i = x for 1 : N-2) overall (j = y for 1 : N-2) { b[i, j] = 0.25 * (a[i-1, j] + a[i+1, j] + a[i, j-1] + a[i, j+1]); r[i, j] = Math.abs(b[i, j] - a[i, j]); } HPspmd.copy(a, b); } while(Adlib.maxval(r) > EPS);

  42. Red-black version float [[,]] r = new float [[x, y]]; HPspmd.init(r, 0.0); int iter = 0; do { Adlib.writeHalo(a); overall (i = x for 1 : N-2) overall (j = y for 1 + (i` + iter) % 2 : N-2 : 2) { float newA = 0.25 * (a[i-1, j] + a[i+1, j] + a[i, j-1] + a[i, j+1]); r[i, j] = Math.abs(newA - a[i, j]); a[i, j] = newA; } iter++; } while(Adlib.maxval(r) > EPS);

  43. Conway’s Life using ghost regions int mode [] = {Adlib.CYCL, Adlib.CYCL}; Procs2 p = new Procs2(P, P); on(p) { Range x = new ExtBlockRange(N, p.dim(0), 1, 1); Range y = new ExtBlockRange(N, p.dim(1), 1, 1); int [[,]] state = new int [[x, y]]; … Define initial state of Life board, ‘state’. … Main loop }

  44. Main loop int [[,]] sums = new int [[x, y]]; for (int iter = 0; iter < NITER; iter++) { Adlib.writeHalo(state, mode); overall (i = x for :) overall (j = y for :) sums[i, j] = state[i-1, j-1] + state[i-1, j] + state[i-1, j+1] + state[i, j-1] + state[i, j+1] + state[i+1, j-1] + state[i+1, j] + state[i+1, j+1]; overall (i = x for :) overall (j = y for :) switch (sums [i, j]) { case 2: break; case 3: state[i, j] = 1; break; default: state[i, j] = 0; break; } }

  45. Collapsed Distributions • CollapsedRange subclass of Range stands for range that is not distributed. • In: Range x = CollapsedRange(N); Range y = BlockRange(M, p.dim(0)); float [[,]] a = new float [[x, y]]; first dimension of a is collapsed.

  46. Sequential array dimensions • Subscripts in first dimension of array declared above must still be distributed indexes, although effectively a sequential array w.r.t. that dimension. • Very convenient to use integer subscripts in sequential dimensions. • Introduce “subtypes” of distributed arrays with sequential dimensions. Example becomes: Range y = BlockRange(M, p.dim(0)); float [[*,]] a = new float [[N, y]];

  47. Syntax for sequential dimensions • Asterisk, *, appears in slot of type signature for sequential dimension. • Integer expression (rather than range) appears in constructor slot. If x is a range, the expression new int [[10, x]] has type int [[*,]]. • Can use integer expressions for subscripts in element references!

  48. Replicated distributions • Collapsed distributions mean array rank can be larger than process grid rank. • Also allowed for array rank to be smaller than grid rank: Procs2 p = new Procs2(P, P); on(p) { Range x = new BlockRange(N, p.dim(0)); float [[]] b = new float [[x]]; } Array b is replicated overp.dim(1).

  49. Aside: replicated variables versus replicated values • The HPJava language does not enforce that all copies of replicated variables hold the same value at corresponding points of program execution. • However, a common programming practice is to maintain same values in all copies (most of the time)—“canonical style”. • Adlib communication library, for example, typically broadcasts results to replicated destination arrays.

  50. Matrix multiplication example float [[,]] c = new float [[x, y]]; float [[,*]] a = new float [[x, N]]; float [[*,]] b = new float [[N, y]]; … Initialize ‘a’, ‘b’ overall (i = x for :) overall (j = y for :) { c [i, j] = 0.0; for(int k = 0; k < N; k++) c[i, j] += a[i, k] * b[k, j]; }

More Related