Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 137 for “"Data locality"”.

  1. Improving data locality for caches

    … computer architecture, techniques to improve the data locality of programs with respect to cache have been essential to good performance. This thesis is a contribution in that direction. It is divided in three main parts: (1) A survey of the existing techniques that address data locality and the …

    rice Repository record for Improving data locality for caches (opens in a new tab)

  2. Deep Data Locality on Apache Hadoop

    The amount of data being collected in various areas such as social media, network, scientific instrument, mobile devices, and sensors is growing continuously, and the technology to process them is also advancing rapidly. One of the fundamental technologies to process big data is Apache Hadoop that …

    unlv Repository record for Deep Data Locality on Apache Hadoop (opens in a new tab) Download PDF for Deep Data Locality on Apache Hadoop (opens in a new tab)

  3. Improving Data Locality in Applications through Execution Delegation

    … specialized to access mostly disjoint sets of data. In this way, data locality and, therefore, performance are improved. The aim of this work is to develop tools and methods for predicting situations in which execution delegation via user thread migration is useful for improving an …

    waterloo Repository record for Improving Data Locality in Applications through Execution Delegation (opens in a new tab)

  4. Improving Data Locality in Applications using Message Passing

    … components. However it improves the temporal locality of data in a program by facilitating temporal and spatial reorganization of program components. Temporal reorganization refers to the batched execution of program components. Spatial reorganization refers to the scheduling of components on …

    waterloo Repository record for Improving Data Locality in Applications using Message Passing (opens in a new tab)

  5. Optimizing Data Locality in Analytic Workloads over Distributed Computing Environments

    With the explosion of data that are generated every second, there is an emerging need for big data analytics using scalable systems and platforms for exploration, mining and decision making purposes. To gain better business insights, the business users are interested to integrate different kinds of …

    queens Repository record for Optimizing Data Locality in Analytic Workloads over Distributed Computing Environments (opens in a new tab)

  6. Partitioning social networks for data locality on a memory budget

    … the OSN social graph in such a way as to promote data locality, i.e. such that a user's data will be stored on the same server as his friends' data, has proven difficult to do, and many existing OSN partitioning systems do not even attempt this. However, recent work has demonstrated techniques …

    uiuc Repository record for Partitioning social networks for data locality on a memory budget (opens in a new tab)

  7. HARMONY: EXPLORING STAGE EXECUTION AND DATA LOCALITY IN GEO-DISTRIBUTED DATA PROCESSING

    Big-data application processing is increasingly geo-distributed, a paradigm shift from the traditional cluster-based processing frameworks. As the communication time for data movement across geo-distributed data centers is not a design criterion for traditional cluster-based processing approaches, …

    nus Repository record for HARMONY: EXPLORING STAGE EXECUTION AND DATA LOCALITY IN GEO-DISTRIBUTED DATA PROCESSING (opens in a new tab) Download file for HARMONY: EXPLORING STAGE EXECUTION AND DATA LOCALITY IN GEO-DISTRIBUTED DATA PROCESSING (opens in a new tab)

  8. Near-data scheduling for data centers with multiple levels of data locality

    Data locality is a fundamental issue for data-parallel applications. Considering MapReduce in Hadoop, the map task scheduling part requires an efficient algorithm which takes data locality into consideration; otherwise, the system may become unstable under loads inside the system's capacity region …

    uiuc Repository record for Near-data scheduling for data centers with multiple levels of data locality (opens in a new tab)

  9. A model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality

    … like SpMV require the use of special sparse data structures that efficiently store and access non-zeros. However, sparse data structures can tax the memory bandwidth of a machine and limit the performance of a computation, which for these computations is typically less than 10% of a …

    colostate Repository record for A model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality (opens in a new tab)

  10. On optimizing data locality for data-intensive parallel workloads: a compile-time framework for machine learning models and a run-time abstraction for task-based systems

    Modern data-intensive workloads, from high-performance computing (HPC) to machine learning (ML), are increasingly bottlenecked by data movement rather than computation. This "memory wall" is especially pronounced in heterogeneous systems combining multi-core CPUs and many-core GPU accelerators. …

    texas Repository record for On optimizing data locality for data-intensive parallel workloads: a compile-time framework for machine learning models and a run-time abstraction for task-based systems (opens in a new tab)

  11. ILAN: The Interference- and Locality-Aware NUMA Scheduler

    … runtime does not account for interference or data locality aspects, leading to performance degradations on NUMA systems where these effects become magnified. To address these challenges, this thesis proposes ILAN, an interference- and data locality-aware NUMA scheduler integrated into the LLVM …

    chalmers Repository record for ILAN: The Interference- and Locality-Aware NUMA Scheduler (opens in a new tab)

  12. Automatic and interactive parallelization

    … consideration the interaction of parallelism and data locality, as well as the overhead of parallelism. The algorithm is based on a simple cost model that accurately predicts cache line reuse from multiple accesses to the same memory location and from consecutive accesses. The optimizer uses this …

    rice Repository record for Automatic and interactive parallelization (opens in a new tab)

  13. Autonomic Management And Performance Optimization For Cloud Computing Services

    … of map and reduce tasks and renders existing data locality-aware task scheduling policy, like delay scheduling, no longer effective. On the other hand, virtualization offers an extra opportunity of data locality for co-hosted VMs. To address these issues, we present a task scheduling strategy …

    wayne-thes Repository record for Autonomic Management And Performance Optimization For Cloud Computing Services (opens in a new tab)

  14. A Network Integrated Design for Micro-scale Cloud Services

    … multiple scheduling policies such as FIFO, and data locality aware policies. Our empirical evaluation shows that Falcon reduces scheduling latency by 120 times and increases the scheduling throughput by 100 times compared to state-of-the-art schedulers.

    waterloo Repository record for A Network Integrated Design for Micro-scale Cloud Services (opens in a new tab)

  15. A resource constrained loop pipelining technique for perfectly-nested loop structures.

    … negative effect that the transformation has on data locality and the cache miss rate, as well as the use of iteration space tiling to restore data locality and cache miss rate to the levels expected from sequential loop execution.

    nps Repository record for A resource constrained loop pipelining technique for perfectly-nested loop structures. (opens in a new tab)

  16. Metadata And Data Management In High Performance File And Storage Systems

    … on petascale-and-beyond computing over large data sets of the same magnitude. While the computational power of supercomputers has recently entered the era of petascale, the performance of their storage system is far lagged behind by many orders of magnitude. This places an imperative demand on …

    ucf Repository record for Metadata And Data Management In High Performance File And Storage Systems (opens in a new tab)

  17. Optimizing Fortran90D/HPF for distributed-memory computers

    … architectures. Programmers express data parallelism using Fortran90 array operations and use data layout directives to direct the partitioning of the data and computation among the processors of a parallel machine. For HPF to gain acceptance as a vehicle for parallel scientific …

    rice Repository record for Optimizing Fortran90D/HPF for distributed-memory computers (opens in a new tab)

  18. Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis

    Analysis of Big data to gain better insights has been the focus of researchers in the recent past. Traditional desktop computers or database management systems may not be suitable for efficient and timely analysis, due to the requirement of massive parallel processing. Distributed computing …

    lsu-thes Repository record for Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis (opens in a new tab)

Page 1 of 7