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 38 for “"Data locality"”.
-
Exploiting Data Locality in Dynamic Web Applications
… are made, the first showing the location of data inside a datacenter influences the web system's performance, and secondly, that relaxing strict consistency inside the web application at a fine- grained level can greatly lower latencies for geographically diverse users. Experiments are used …
-
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 …
-
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 …
-
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 …
-
Preliminary Investigation of Productivity Tools for Memory Profiling in Parallel Programs
… from program transformations that improve their data locality, to better exploit modern memory hierarchies. Reuse distance is a useful measure for analyzing data locality in an architecture-agnostic way, i.e., independent of specific cache sizes. Previous work has researched different ways to …
-
Row Projection Methods for Linear Systems
… vector of additional storage, provides good data locality, gives numerically well conditioned subproblems defining the projectors, and can be generalized to other matrices.
-
Parallel and Distributed Just-in-Time Shell Script Compilation
… storage systems to efficiently execute data-processing pipelines. Distributed-PaSh analyzes the dataflow graph of a given script to create highly parallel data pipelines and execute those pipelines in a distributed cluster while giving special attention to data locality and movement. …
-
Transforming and Optimizing Irregular Applications for Parallel Architectures
… many approaches have been proposed to improve data locality and reduce irregularities through computational and data transformations. However, there are two major drawbacks in these existing approaches that prevent them from achieving optimal performance. First, these approaches use local …
-
Optimizing Out-Of-Memory Sparse-Dense Matrix Multiplication
… matrix formats, tiling, load balancing, and data locality, and investigate how they affect performance. Based on the performance study, we will design and implement an out-of-core framework that supports massive graph datasets which can not fit into memory. We foresee challenges in mitigating …
-
Performance Analysis of Program Executions on Modern Parallel Architectures
… have become common in supercomputers, data centers, and mobile chips. Usually, parallel architectures have complex features: many hardware threads, deep memory hierarchies, and non-uniform memory access (NUMA). Program designs without careful consideration of these features may lead to …
-
Dynamic resource provisioning for data center workloads with data constraints
Dynamic resource provisioning, as an important data center software building block, helps to achieve high resource usage efficiency, leading to enormous monetary benefits. Most existing work for data center dynamic provisioning target on stateless servers, where any request can be routed to any …
-
Implementing a Tiled Singular Value Decomposition: A Framework for Tiled Linear Algebra in Julia
… approach, the implemented framework improves data locality, parallelism, and scalability, making it well-suited for modern heterogeneous environments. Its practical benefits are demonstrated through the implementation of tiled QR-based singular value decomposition (SVD), demonstrating how it …
-
Locality-aware cache hierarchy management for multicore processors
… and applications will operate on massive data with significant sharing. A major challenge in their implementation is the storage requirement for tracking the sharers of data. The bit overhead for such storage scales quadratically with the number of cores in conventional directory-based …
-
Retina: Cross-Layered Key-Value Store using Computational Storage
… SSDs are getting faster and smarter with near-data computing capabilities. Due to their design choices, traditional key-value stores do not fully leverage these new storage devices. These key-value stores become CPU-bound even before fully utilizing the IO bandwidth. LSM or B+ tree-based …
-
On the Factor Refinement Principle and its Implementation on Multicore Architectures
… algorithm optimization techniques such as data locality analysis, balancing subproblems, etc. to fully exploit modern multicore architectures. The Cilk++ implementation of our parallel algorithm based on the augment refinement principle of Bach, Driscoll and Shallit achieves linear speedup …
-
A polyhedral-based systemc modeling and generation framework for effective low-power design space exploration
… model-based techniques while performing powerful data locality and parallelism transformations. We then leverage key properties of affine computations to design a fast and accurate latency and power characterization flow. Using this flow, we build analytical models of power and performance that …
-
EdgeFn: A Lightweight Customizable Data Store for Serverless Edge Computing
… we introduce EdgeFn, a lightweight distributed data store for the serverless edge computing system. While serverless comput- ing platforms simplify the development and automated management of software functions, running serverless applications reliably on resource-constrained edge devices poses …
-
Compiling reductions in data parallel programs for distributed memory multiprocessors
… group of reduction statements to better exploit data locality. We have evaluated the effectiveness of our optimization oil an IBM Scalable PowerParallel System SP2. The results indicate that without reduction optimization, reduction operations are sequentially executed and become an execution …
-
Routing and scheduling for cloud service data centers
… commerce, have been moved to the Cloud service data centers. One of the features offered by Cloud data centers is on-demand service. To achieve this, current Cloud data centers are designed with an excess of provision for highly dynamic work load. Problems with such design include low server …
Page 1 of 2