Parallel and Streaming Generation of Ghost Data for Structured Grids

2008 
Parallel simulations decompose large domains into many blocks. A fundamental requirement for subsequent parallel analysis and visualization is the presence of ghost data that supplements each block with a layer of adjacent data elements from neighboring blocks. The standard approach for generating ghost data requires all blocks to be in memory at once. This becomes impractical when there are fewer processors - and thus less aggregate memory - available for analysis than for simulation. We describe an algorithm for generating ghost data for structured grids that uses many fewer processors than previously possible. Our algorithm stores as little as one block per processor in memory and can run on as few processors as are available (possibly just one). The key idea is to slightly change the size of the original blocks by declaring parts of them to be ghost data, and by later padding adjacent blocks with this data.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []