Evaluating the benefits of an extended memory hierarchy for parallel streamline algorithms

The increasing cost of achieving sufficient I/O bandwidth for high end supercomputers is leading to architectural evolutions in the I/O subsystem space. Currently popular designs create a staging area on each compute node for data output via solid state drives (SSDs), local hard drives, or both. In...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2011 IEEE Symposium on Large Data Analysis and Visualization S. 57 - 64
Hauptverfasser: Camp, D., Childs, H., Chourasia, A., Garth, C., Joy, K. I.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.10.2011
Schlagworte:
Acceleration
Bandwidth
Computation by Abstract Devices [F.1.2]: Modes of Computation-Parallelism and Concurrency
Computer Graphics [I.3.3]: Picture/Image Generation-Display Algorithms
Data visualization
High definition video
Magnetic cores
Programming Techniques [D.1.3]: Concurrent Programming-Parallel Programming
Toroidal magnetic fields
Vectors
ISBN:9781467301565, 1467301566
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The increasing cost of achieving sufficient I/O bandwidth for high end supercomputers is leading to architectural evolutions in the I/O subsystem space. Currently popular designs create a staging area on each compute node for data output via solid state drives (SSDs), local hard drives, or both. In this paper, we investigate whether these extensions to the memory hierarchy, primarily intended for computer simulations that produce data, can also benefit visualization and analysis programs that consume data. Some algorithms, such as those that read the data only once and store the data in primary memory, can not draw obvious benefit from the presence of a deeper memory hierarchy. However, algorithms that read data repeatedly from disk are excellent candidates, since the repeated reads can be accelerated by caching the first read of a block on the new resources (i.e. SSDs or hard drives). We study such an algorithm, streamline computation, and quantify the benefits it can derive.
ISBN:9781467301565
1467301566
DOI:10.1109/LDAV.2011.6092318