1 / 1

Parallel Computing in Distributed Arrays

Explore the concurrency management in a distributed 96x96 array processing across four processors while updating elements based on nearest neighbors. Calculate the number of messages produced for directory-based CC-NUMA.

aracely-trey
Download Presentation

Parallel Computing in Distributed Arrays

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. Homework Assignment Suppose a 96x96 array S is distributed by blocks across four processors, so that each contains a 48x48 subarray. At each position S[i,j] is updated by the sum of its 8 nearest neighbors: S’[i,j]=(S[i-1,j-1]+S[i-1,j]+S[i-1,j+1]+S[i,j+1]+S[i+1,j+1] +S[i+1,j]+S[i+1,j-1]+S[i,j-1])/8; If each processor updates its own elements, how many messages must are produced to maintain concurrency for a directory based CC-NUMA? HINT: Assume that an extra row and column, initialized to zero, surrounds A, A is allocated in rmo, and storage for S alternates with S’

More Related