Search for dissertations about: "Scheduling data locality"
Showing result 1 - 5 of 10 swedish dissertations containing the words Scheduling data locality.
-
1. Multithreaded PDE Solvers on Non-Uniform Memory Architectures
Abstract : A trend in parallel computer architecture is that systems with a large shared memory are becoming more and more popular. A shared memory system can be either a uniform memory architecture (UMA) or a cache coherent non-uniform memory architecture (cc-NUMA). READ MORE
-
2. Understanding Task Parallelism : Providing insight into scheduling, memory, and performance for CPUs and Graphics
Abstract : Maximizing the performance of computer systems while making them more energy efficient is vital for future developments in engineering, medicine, entertainment, etc. However, the increasing complexity of software, hardware, and their interactions makes this task difficult. READ MORE
-
3. Improving OpenMP Productivity with Data Locality Optimizations and High-resolution Performance Analysis
Abstract : The combination of high-performance parallel programming and multi-core processors is the dominant approach to meet the ever increasing demand for computing performance today. The thesis is centered around OpenMP, a popular parallel programming API standard that enables programmers to quickly get started with writing parallel programs. READ MORE
-
4. Packet Order Matters! : Improving Application Performance by Deliberately Delaying Packets
Abstract : Data-centers increasingly deploy commodity servers with high-speed network interfaces to enable low-latency communication. However, achieving low latency at high data rates crucially depends on how the incoming traffic interacts with the system's caches. When packets that need to be processed in the same way are consecutive, i.e. READ MORE
-
5. Integrated Optimal Code Generation for Digital Signal Processors
Abstract : In this thesis we address the problem of optimal code generation for irregular architectures such as Digital Signal Processors (DSPs).Code generation consists mainly of three interrelated optimization tasks: instruction selection (with resource allocation), instruction scheduling and register allocation. READ MORE