Sökning: "High Performance Computing"
Visar resultat 21 - 25 av 249 avhandlingar innehållade orden High Performance Computing.
21. Application-aware resource management for datacenters
Sammanfattning : High Performance Computing (HPC) and Cloud Computing datacenters are extensively used to steer and solve complex problems in science, engineering, and business, such as calculating correlations and making predictions. Already in a single datacenter server, there are thousands of hardware and software metrics – Key Performance Indicators (KPIs) – that individually and aggregated can give insight in the performance, robustness, and efficiency of the datacenter and the provisioned applications. LÄS MER
22. Approaches for Distributing Large Scale Bioinformatic Analyses
Sammanfattning : Ever since high-throughput DNA sequencing became economically feasible, the amount of biological data has grown exponentially. This has been one of the biggest drivers in introducing high-performance computing (HPC) to the field of biology. LÄS MER
23. Self-Management for Large-Scale Distributed Systems
Sammanfattning : Autonomic computing aims at making computing systems self-managing by using autonomic managers in order to reduce obstacles caused by management complexity. This thesis presents results of research on self-management for large-scale distributed systems. LÄS MER
24. Hardware/Software Co-Design of Heterogeneous Manycore Architectures
Sammanfattning : In the era of big data, advanced sensing, and artificial intelligence, the required computation power is provided mostly by multicore and manycore architectures. However, the performance demand keeps growing. Thus the computer architectures need to continue evolving and provide higher performance. LÄS MER
25. Throughput and energy efficiency of lock-free data structures: Execution Models and Analyses
Sammanfattning : Concurrent data structures are key program components to harness the available parallelism in multi-core processors. Lock-free algorithmic implementations of concurrent data structures offer high scalability and possess desirable properties such as immunity to deadlocks, convoying and priority inversion. LÄS MER