Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Wiley ; 2016
    In:  Concurrency and Computation: Practice and Experience Vol. 28, No. 6 ( 2016-04-25), p. 1751-1766
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 28, No. 6 ( 2016-04-25), p. 1751-1766
    Abstract: Parallel semi‐implicit method for pressure‐linked equations(SIMPLE) algorithm is used to solve the 3‐D incompressible pipe flow problem. In this paper, we proposed a novel parallel SIMPLE algorithm that uses the alternate tiling technique. Firstly, a parallel SIMPLE algorithm based on domain decomposition method was established, and the implementation of domain partition and data exchange was presented. Then, we presented serial finite difference stencil algorithm based on alternate tiling. Furthermore, an iteration space parallel two‐way finite difference stencil algorithm based on alternate tiling was proposed, introducing the sequence of iterative space tiles as the sequence of execution and using time skewing technique to partition the iteration space, thus to improve the data locality of algorithm. The cache misses and the cost of communication and synchronization are reduced by reordering the tiles of iteration space. Finally, the effectiveness of the two parallel SIMPLE algorithms were compared. The results showed that the parallel SIMPLE algorithm that uses the two‐way finite difference stencil algorithm based on alternate tiling has good data locality, performance, and scalability in the Deepcomp7000 cluster computing environment. Copyright © 2013 John Wiley & Sons, Ltd.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2016
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages