FEAST: Development of HPC Technologies for FEM Applications

C. Becker, S. Buijssen and S. Turek
Additional contact information
C. Becker: University of Dortmund, Institute for Applied Mathematics and Numerics
S. Buijssen: University of Dortmund, Institute for Applied Mathematics and Numerics
S. Turek: University of Dortmund, Institute for Applied Mathematics and Numerics

A chapter in High Performance Computing in Science and Engineering `07, 2008, pp 503-516 from Springer

Abstract: Abstract Modern processors reach their performance speedup not merely by increasing clock frequency, but to a greater extend by fundamental changes and extensions of the processor architecture itself. These extensions require the application developer to adapt programming techniques to exploit the existing performance potential. Otherwise the situation may arise that the processor becomes nominally faster, but the application doesn’t run faster [3, 4]. A limiting factor for computations is memory access. There is an ever increasing discrepancy between CPU cycle time and main storage access time. Fetching data is expensive in terms of CPU being idle. To narrow the gap between smaller CPU cycle times and possible access times of main storage in general, a rapid access temporary storage between CPU and main storage was introduced, the so-called cache. The basic idea of a cache is to store data following the locality of reference principle. Latency is reduced if a subsequently requested datum is found in the faster cache instead of having to transfer it from slow main storage. Given a sufficient locality of the data, i.e. the data of preceding accesses is still cached, the number of accesses to the cache will exceed those to slow main storage. Throughput can be increased significantly this way. Access to main storage will not be faster with any access sample automatically, but only if the program uses mainly data being already in the cache. This requires appropriate adjustments being made to the applications [2].

Keywords: Matrix Vector Multiplication; Multi Grid Method; Block Layer; Main Storage; Partition Size (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-74739-0_34

Ordering information: This item can be ordered from
http://www.springer.com/9783540747390

DOI: 10.1007/978-3-540-74739-0_34

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().