000189719 001__ 189719
000189719 005__ 20210129215423.0
000189719 0247_ $$2doi$$a10.1007/3-540-58430-7_41
000189719 0247_ $$2ISSN$$a0302-9743
000189719 0247_ $$2ISSN$$a1611-3349
000189719 020__ $$a978-3-540-58430-8 (print)
000189719 020__ $$a978-3-540-48789-0 (electronic)
000189719 037__ $$aFZJ-2015-02754
000189719 082__ $$a004
000189719 1001_ $$0P:(DE-HGF)0$$aBerrendorf, Rudolf$$b0
000189719 1112_ $$aThird Joint International Conference on Vector and Parallel Processing$$cLinz$$d1994-09-06 - 1994-09-08$$wAustria
000189719 245__ $$aA comparison of shared virtual memory and message passing programming techniques based on a finite element applicationBerrendorf
000189719 260__ $$aBerlin, Heidelberg$$bSpringer Berlin Heidelberg$$c1994
000189719 29510 $$aParallel Processing: CONPAR 94 — VAPP VI
000189719 300__ $$a461 - 472
000189719 3367_ $$0PUB:(DE-HGF)8$$2PUB:(DE-HGF)$$aContribution to a conference proceedings$$bcontrib$$mcontrib$$s1429680574_3348
000189719 3367_ $$033$$2EndNote$$aConference Paper
000189719 3367_ $$2ORCID$$aCONFERENCE_PAPER
000189719 3367_ $$2DataCite$$aOutput Types/Conference Paper
000189719 3367_ $$2DRIVER$$aconferenceObject
000189719 3367_ $$2BibTeX$$aINPROCEEDINGS
000189719 4900_ $$aLecture Notes in Computer Science$$v854
000189719 520__ $$aThis 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.
000189719 536__ $$0G:(DE-HGF)POF2-899$$a899 - ohne Topic (POF2-899)$$cPOF2-899$$fPOF I$$x0
000189719 588__ $$aDataset connected to CrossRef Book, juser.fz-juelich.de
000189719 7001_ $$0P:(DE-HGF)0$$aGerndt, Michael$$b1
000189719 7001_ $$0P:(DE-HGF)0$$aLahjomri, Zakaria$$b2
000189719 7001_ $$0P:(DE-HGF)0$$aPriol, Thierry$$b3
000189719 773__ $$a10.1007/3-540-58430-7_41
000189719 8564_ $$uhttps://juser.fz-juelich.de/record/189719/files/ib-9410.pdf$$yRestricted
000189719 8564_ $$uhttps://juser.fz-juelich.de/record/189719/files/ib-9410.gif?subformat=icon$$xicon$$yRestricted
000189719 8564_ $$uhttps://juser.fz-juelich.de/record/189719/files/ib-9410.jpg?subformat=icon-1440$$xicon-1440$$yRestricted
000189719 8564_ $$uhttps://juser.fz-juelich.de/record/189719/files/ib-9410.jpg?subformat=icon-180$$xicon-180$$yRestricted
000189719 8564_ $$uhttps://juser.fz-juelich.de/record/189719/files/ib-9410.jpg?subformat=icon-640$$xicon-640$$yRestricted
000189719 8564_ $$uhttps://juser.fz-juelich.de/record/189719/files/ib-9410.pdf?subformat=pdfa$$xpdfa$$yRestricted
000189719 909CO $$ooai:juser.fz-juelich.de:189719$$pVDB
000189719 9132_ $$0G:(DE-HGF)POF3-899$$1G:(DE-HGF)POF3-890$$2G:(DE-HGF)POF3-800$$aDE-HGF$$bForschungsbereich Materie$$lForschungsbereich Materie$$vohne Topic$$x0
000189719 9131_ $$0G:(DE-HGF)POF2-899$$1G:(DE-HGF)POF2-890$$2G:(DE-HGF)POF2-800$$3G:(DE-HGF)POF2$$4G:(DE-HGF)POF$$aDE-HGF$$bProgrammungebundene Forschung$$lohne Programm$$vohne Topic$$x0
000189719 915__ $$0StatID:(DE-HGF)0100$$2StatID$$aJCR
000189719 915__ $$0StatID:(DE-HGF)0150$$2StatID$$aDBCoverage$$bWeb of Science Core Collection
000189719 915__ $$0StatID:(DE-HGF)0199$$2StatID$$aDBCoverage$$bThomson Reuters Master Journal List
000189719 915__ $$0StatID:(DE-HGF)0200$$2StatID$$aDBCoverage$$bSCOPUS
000189719 915__ $$0StatID:(DE-HGF)0420$$2StatID$$aNationallizenz
000189719 920__ $$lyes
000189719 9201_ $$0I:(DE-Juel1)VDB62$$kZAM$$lZentralinstitut für Angewandte Mathematik$$x0
000189719 9201_ $$0I:(DE-Juel1)JSC-20090406$$kJSC$$lJülich Supercomputing Center$$x1
000189719 980__ $$acontrib
000189719 980__ $$aVDB
000189719 980__ $$aI:(DE-Juel1)VDB62
000189719 980__ $$aI:(DE-Juel1)JSC-20090406
000189719 980__ $$aUNRESTRICTED
000189719 981__ $$aI:(DE-Juel1)JSC-20090406