Spelling suggestions: "subject:"supercomputers""
1 |
Computer-aided management of commodity parts-based supercomputers /Nemecek, Josef. January 2006 (has links)
ETH, Diss.--Zürich, 2005. / Literaturverz. S. 219 - 222.
|
2 |
Werkzeugunterstützte effiziente Nutzung von Hochleistungsrechnern /Simon, Jens. January 2000 (has links)
Zugl.: Paderborn, Universiẗat, Diss., 1999.
|
3 |
Self-tuning job scheduling strategies for the resource management of HPC systems and computational gridsStreit, Achim. January 2003 (has links) (PDF)
Paderborn, University, Diss., 2003.
|
4 |
Die Berechnung von Wiedereintrittsphänomenen auf hierarchischen Supercomputern mit einem effizienten parallelen MultiblockverfahrenBönisch, Thomas. January 2007 (has links)
Zugl.: Stuttgart, University, Diss., 2007.
|
5 |
Concept and implementation of an efficient communication network for commodity supercomputing /Lienhard, Martin. January 2000 (has links)
Diss., Technische Wissenschaften ETH Zürich, Nr. 13847, 2000.
|
6 |
Performance Analysis of the PVFS2 Persistency LayerKunkel, Julian Martin. January 2006 (has links)
Heidelberg, Univ., Bach.-Arb., 2006.
|
7 |
HEAVEN eine hierarchische Speicher- und Archivierungsumgebung für multidimensionale Array- Datenbankmanagement-Systeme /Reiner, Bernd. Unknown Date (has links)
Techn. Universiẗat, Diss., 2005--München.
|
8 |
Power-Constrained SupercomputingBailey, Peter E. January 2015 (has links)
As we approach exascale systems, power is turning from an optimization goal to a critical operating constraint. With power bounds imposed by both stakeholders and the limitations of existing infrastructure, achieving practical exascale computing will therefore rely on optimizing performance subject to a power constraint. However, this requirement should not add to the burden of application developers; optimizing the runtime environment given restricted power will primarily be the job of high-performance system software. In this dissertation, we explore this area and develop new techniques that extract maximum performance subject to a particular power constraint. These techniques include a method to find theoretical optimal performance, a runtime system that shifts power in real time to improve performance, and a node-level prediction model for selecting power-efficient operating points. We use a linear programming (LP) formulation to optimize application schedules under various power constraints, where a schedule consists of a DVFS state and number of OpenMP threads for each section of computation between consecutive message passing events. We also provide a more flexible mixed integer-linear (ILP) formulation and show that the resulting schedules closely match schedules from the LP formulation. Across four applications, we use our LP-derived upper bounds to show that current approaches trail optimal, power-constrained performance by up to 41%. This demonstrates limitations of current systems, and our LP formulation provides future optimization approaches with a quantitative optimization target. We also introduce Conductor, a run-time system that intelligently distributes available power to nodes and cores to improve performance. The key techniques used are configuration space exploration and adaptive power balancing. Configuration exploration dynamically selects the optimal thread concurrency level and DVFS state subject to a hardware-enforced power bound. Adaptive power balancing efficiently predicts where critical paths are likely to occur and distributes power to those paths. Greater power, in turn, allows increased thread concurrency levels, CPU frequency/voltage, or both. We describe these techniques in detail and show that, compared to the state-of-the-art technique of using statically predetermined, per-node power caps, Conductor leads to a best-case performance improvement of up to 30%, and an average improvement of 19.1%. At the node level, an accurate power/performance model will aid in selecting the right configuration from a large set of available configurations. We present a novel approach to generate such a model offline using kernel clustering and multivariate linear regression. Our model requires only two iterations to select a configuration, which provides a significant advantage over exhaustive search-based strategies. We apply our model to predict power and performance for different applications using arbitrary configurations, and show that our model, when used with hardware frequency-limiting in a runtime system, selects configurations with significantly higher performance at a given power limit than those chosen by frequency-limiting alone. When applied to a set of 36 computational kernels from a range of applications, our model accurately predicts power and performance; our runtime system based on the model maintains 91% of optimal performance while meeting power constraints 88% of the time. When the runtime system violates a power constraint, it exceeds the constraint by only 6% in the average case, while simultaneously achieving 54% more performance than an oracle. Through the combination of the above contributions, we hope to provide guidance and inspiration to research practitioners working on runtime systems for power-constrained environments. We also hope this dissertation will draw attention to the need for software and runtime-controlled power management under power constraints at various levels, from the processor level to the cluster level.
|
9 |
Numerische Simulation strömungsmechanischer und aeroelastischer Vorgänge auf unstrukturierten, hybriden Gittern /Günther, Gero. January 2007 (has links)
Techn. Hochsch., Diss.--Aachen, 2006.
|
10 |
Objektorientierte parallele Ein-, Ausgabe auf Höchstleistungsrechnern /Pinkenburg, Simon. January 1900 (has links)
Zugl.: Tübingen, Universiẗat, Diss., 2006.
|
Page generated in 0.0641 seconds