【精品】全区校园安全生产大检查活动开展情 ..60教学文案.pptVIP

CS267, Yelick Performance Model of parallel 2D Multigrid Assume 2m+1 by 2m+1 grid of unknowns, n= 2m+1, N=n2 Assume p = 4k processors, arranged in 2k by 2k grid Each processor starts with 2m-k by 2m-k subgrid of unknowns Consider V-cycle starting at level m At levels m through k of V-cycle, each processor does some work At levels k-1 through 1, some processors are idle, because a 2k-1 by 2k-1 grid of unknowns cannot occupy each processor Cost of one level in V-cycle If level j = k, then cost = O(4j-k ) …. Flops, proportional to the number of grid points/processor + O( 1 ) a …. Send a constant # messages to neighbors + O( 2j-k) b …. Number of words sent If level j k, then cost = O(1) …. Flops, proportional to the number of grid points/processor + O(1) a …. Send a constant # messages to neighbors + O(1) b .… Number of words sent Sum over all levels in all V-cycles in FMG to get complexity * * Kathy Yelick /~cs267 Lecture Schedule 11/19: Solving the Poisson Equation 11/21: Solving the Poisson Equation 11/26: Tree-based computation (Poisson Again) 11/28: Visit to NERSC Visualization group need to pick up “pass” for the bus 12/3: TBD 12/5: The Future of Parallel Computing 12/12: CS267 Poster Session (1-3pm, Woz) 12/14: Final Papers due Outline Review Poisson equation Overview of Methods for Poisson Equation Jacobi’s method Red-Black SOR method Conjugate Gradients FFT Multigrid Comparison of methods Particle methods (next week) 2D Poisson’s equation Consider the continuous 2D Poisson equation, again d2u/dx2 + d2u/dy2 = b The discrete version is: T * x = b 4 -1 -1 -1 -1 4 -1 -1 -1 4 -1 -1 -1 4 -1 -1 4 -1 -1 -1 -1 4 -1 -1 -1 -1 4 -1 -1 4 -1 -1 -1 4