ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    A message-passing class library C++ for portable parallel programming (1997)
    Springer
    Engineering with computers 13 (1997), S. 20-34 
    Details
    ISSN: 1435-5663
    Keywords: Message-passing ; Object-oriented programming ; Parallel processing ; Portability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract An object-oriented message-passing class library in C++, called PPI++, for portable parallel programming has been developed. PPI++ (parallel portability interface in C++) is designed to serve as a stable (unchanging) interface between the client parallel code and the rapidly evolving distributed computing environments. By taking advantage of encapsulation, inheritance, and polymorphism supported by C++, PPI++ provides a clean and consistent programming interface, which helps improve the clarity and expressiveness of client parallel codes and hides implementation details and complexity from the user to ease parallel programming tasks. In addition, the use of strong type-checking in C++ allows the detection of potential misuses of the library at compile time, and thus promotes code reliability. This paper describes the object-oriented design and implementation of PPI++. Evaluation of PPI++ on important performance issues, such as portability, ease-of-use, extensibility, and efficiency, is also discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01201858
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Efficiency of group implicit concurrent algorithms for transient finite element analysis (1989)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 28 (1989), S. 2761-2776 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The performance of group implicit algorithms is assessed on actual concurrent computers. We show that, as the number of subdomains is increased, performance enhancements are derived from two sources: the increased parallelism in the computations; and a reduction in equation solving effort. Moreover, we show that these two performance enhancements are synergistic, in the sense that the corresponding speed-ups are multiplied, rather than merely added. Our numerical simulations demonstrate that, if n is the number of degrees of freedom of the structure, p the number of processors used in the computations, and s ≥ p is the number of subdomains in the partition, the net speed-up is \documentclass{article}\pagestyle{empty}\begin{document}$ O\left({p\sqrt s} \right) $\end{document} in 2D and O(ps) in 3D, asymptotically as n/s → ∞. In particular, speed-ups with respect to Newmark's method of \documentclass{article}\pagestyle{empty}\begin{document}$ O\left({p\sqrt s} \right) $\end{document} in 2D and O(s) in 3D are obtained on a single-processor machine. Finally, simulations on a 32-node hypercube are presented for which the interprocessor communication efficiencies obtained are consistently in excess of 90 per cent.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620281204
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    facet.materialart.
    Unknown
    A message-passing class library C++ for portable parallel programming (1997)
    Springer
    Details
    Publication Date: 1997-03-01
    Print ISSN: 0177-0667
    Electronic ISSN: 1435-5663
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 4
    facet.materialart.
    Unknown
    Group implicit concurrent algorithms in nonlinear structural dynamics (1989)
    In:  CASI
    Details
    Publication Date: 2019-06-28
    Description: During the 70's and 80's, considerable effort was devoted to developing efficient and reliable time stepping procedures for transient structural analysis. Mathematically, the equations governing this type of problems are generally stiff, i.e., they exhibit a wide spectrum in the linear range. The algorithms best suited to this type of applications are those which accurately integrate the low frequency content of the response without necessitating the resolution of the high frequency modes. This means that the algorithms must be unconditionally stable, which in turn rules out explicit integration. The most exciting possibility in the algorithms development area in recent years has been the advent of parallel computers with multiprocessing capabilities. So, this work is mainly concerned with the development of parallel algorithms in the area of structural dynamics. A primary objective is to devise unconditionally stable and accurate time stepping procedures which lend themselves to an efficient implementation in concurrent machines. Some features of the new computer architecture are summarized. A brief survey of current efforts in the area is presented. A new class of concurrent procedures, or Group Implicit algorithms is introduced and analyzed. The numerical simulation shows that GI algorithms hold considerable promise for application in coarse grain as well as medium grain parallel computers.
    Keywords: STRUCTURAL MECHANICS
    Type: NASA-CR-185950 , NAS 1.26:185950
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 5
    facet.materialart.
    Unknown
    Efficiency of group implicit concurrent algorithms for transient finite element analysis (1989)
    In:  Other Sources
    Details
    Publication Date: 2019-07-12
    Description: The performance of group implicit algorithms is assessed on actual concurrent computers. It is shown that, as the number of subdomains is increased, performance enhancements are derived from two sources: the increased parallelism in the computations; and a reduction in equation solving effort. Moreover, these two performance enhancements are synergistic, in the sense that the corresponding speed-ups are multiplied, rather than merely added. Simulations on a 32-node hypercube are presented for which the interprocessor communications efficiencies obtained are consistently in excess of 90 percent.
    Keywords: NUMERICAL ANALYSIS
    Type: International Journal for Numerical Methods in Engineering (ISSN 0029-5981); 28; 2761-277
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...