% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@INPROCEEDINGS{Berrendorf:189719,
      author       = {Berrendorf, Rudolf and Gerndt, Michael and Lahjomri,
                      Zakaria and Priol, Thierry},
      title        = {{A} comparison of shared virtual memory and message passing
                      programming techniques based on a finite element
                      application{B}errendorf},
      volume       = {854},
      address      = {Berlin, Heidelberg},
      publisher    = {Springer Berlin Heidelberg},
      reportid     = {FZJ-2015-02754},
      isbn         = {978-3-540-58430-8 (print)},
      series       = {Lecture Notes in Computer Science},
      pages        = {461 - 472},
      year         = {1994},
      comment      = {Parallel Processing: CONPAR 94 — VAPP VI},
      booktitle     = {Parallel Processing: CONPAR 94 —
                       VAPP VI},
      abstract     = {This paper describes the methods used and experiences made
                      with implementing a finite element application on three
                      different parallel computers with either message passing or
                      shared virtual memory as the programming model. Designing a
                      parallel finite element application using message-passing
                      requires to find a data domain decomposition to map data
                      into the local memory of the processors. Since data accesses
                      may be very irregular, communication patterns are unknown
                      prior to the parallel execution and thus makes the
                      parallelization a difficult task. We argue that the use of a
                      shared virtual memory greatly simplifies the parallelization
                      step. It is shown experimentally on an hypercube iPSC/2 that
                      the use of the KOAN/Fortran-S programming environment based
                      on a shared virtual memory allows to port quickly and easily
                      a sequential application without a significant degradation
                      in performance compared to the message passing version.
                      Results for recent parallel architectures such as the
                      Paragon XP/S for message-passing and the KSR1 for shared
                      virtual memory are presented, too.},
      month         = {Sep},
      date          = {1994-09-06},
      organization  = {Third Joint International Conference
                       on Vector and Parallel Processing, Linz
                       (Austria), 6 Sep 1994 - 8 Sep 1994},
      cin          = {ZAM / JSC},
      ddc          = {004},
      cid          = {I:(DE-Juel1)VDB62 / I:(DE-Juel1)JSC-20090406},
      pnm          = {899 - ohne Topic (POF2-899)},
      pid          = {G:(DE-HGF)POF2-899},
      typ          = {PUB:(DE-HGF)8},
      doi          = {10.1007/3-540-58430-7_41},
      url          = {https://juser.fz-juelich.de/record/189719},
}