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 22 for “"Data placement"”.

  1. Large-scale optimization for data placement problem

    lethbridge

  2. Improving Energy-Efficiency through Smart Data Placement in Hadoop Clusters

    … source framework, has revolutionized the big data world because of its ability to process vast amounts of unstructured and semi-structured data. This ability makes Hadoop the ‘go-to’ technology for many industries that generate big data, thus it also aids in being cost effective, unlike other …

    columbus-state Repository record for Improving Energy-Efficiency through Smart Data Placement in Hadoop Clusters (opens in a new tab)

  3. Distributed data as a choice in PetaBricks

    … systems requires programmers to hand place the data and computation across all system components such as memory, processors, and GPUs. As each system can have sufficiently different compositions, the application partitioning, as well as algorithms and data structures, has to be different for …

    mit Repository record for Distributed data as a choice in PetaBricks (opens in a new tab)

  4. Movement and placement of non-contiguous data in distributed GPU computing

    … delegated the task of understanding and copying data to the system or application developer. Data transfer performance on these systems is now impacted by many factors including data transfer modality, system interconnects hardware details, CPU caching state, CPU power management state, driver …

    uiuc Repository record for Movement and placement of non-contiguous data in distributed GPU computing (opens in a new tab)

  5. Run-Time Adaptive Cache Management

    … scheme where the hardware determines data placement within the cache hierarchy based on dynamic referencing behavior. This scheme is fully compatible with existing instruction set architectures. This dissertation also examines the theoretical upper bounds on the cache hit ratio that …

    uiuc Repository record for Run-Time Adaptive Cache Management (opens in a new tab)

  6. Performance and Memory Space Optimizations for Embedded Systems

    … We use code restructuring, loop scheduling, data transformation, code and data placement, and scratch-pad memory (SPM) management as our tools in different embedded system scenarios. The majority of our work is focused on loop scheduling. Main contributions of our work are:</p> <p>We propose …

    syracuse-diss Repository record for Performance and Memory Space Optimizations for Embedded Systems (opens in a new tab)

  7. Redesigning the memory hierarchy for memory-safe programming languages

    … and unifies hierarchical garbage collection and data placement. As a result, Hotpads improves memory performance and efficiency substantially, and unlocks many new optimizations. This thesis contributes important optimizations for Hotpads and a comprehensive evaluation of Hotpads against prior …

    mit Repository record for Redesigning the memory hierarchy for memory-safe programming languages (opens in a new tab)

  8. Heterogeneous system and application communication modeling

    … it has exacerbated existing challenges of data placement as the specialized hardware often has local memories to fuel its computational demands. In addition to using appropriate software resources to target application computation at the best hardware for the job, application developers now …

    uiuc Repository record for Heterogeneous system and application communication modeling (opens in a new tab)

  9. Page management in hybrid memory systems

    … to address the capacity requirements of data intensive workloads and achieve high performance. The main challenge lies in dynamically managing data placement between DRAM and NVM in a flat address space configuration, where the Operating System can allocate pages to either of the two …

    uiuc Repository record for Page management in hybrid memory systems (opens in a new tab)

  10. Reducing data movement in multicore chips with computation and data co-scheduling

    … focus on making cores more efficient. However, data movement is much more costly than basic compute operations. For example, at 28 nm, a main memory access is 100x slower and consumes 1000x the energy of a floatingpoint operation, and moving 64 bytes across a 16-core processor is 50 x slower and …

    mit Repository record for Reducing data movement in multicore chips with computation and data co-scheduling (opens in a new tab)

  11. Investigating Asymmetric Collaboration and Interaction in Immersive Environments

    … collaborative view dimensionalities in data-driven decision-making and interaction from non-immersive devices remain under-explored. A crucial inquiry arises: although presenting a consistent 3D virtual world on both immersive and non-immersive platforms has been a common practice in …

    vt Repository record for Investigating Asymmetric Collaboration and Interaction in Immersive Environments (opens in a new tab)

  12. Fine-grained Adaptivity for Dynamic On-chip Networks

    … is too restrictive in terms of parallelism and data placement. Therefore, we propose a new, more flexible class of hierarchical NoCs: Elastic Hierarchical NoCs. Elastic Hierarchical NoCs dynamically adjust the number and size of clusters during runtime according to the system's communication …

    toronto-retro Repository record for Fine-grained Adaptivity for Dynamic On-chip Networks (opens in a new tab)

  13. Cutting the datacenter tax in heterogeneous systems: a coherence-spectrum approach

    Modern datacenters pay two persistent overheads: a memory tax from memory management and optimization features such as memory deduplication and compressed swapping, and a network tax from end-host processing that surrounds the NIC rather than the packet transmission itself. This thesis reduces …

    uiuc Repository record for Cutting the datacenter tax in heterogeneous systems: a coherence-spectrum approach (opens in a new tab)

  14. Building interactive distributed processing applications at a global scale

    … typically process a massive amount of data at a global scale. In this cases, distributing storage and processing is key to handling the large scale. Distribution necessitates handling two main aspects: a) the placement of data/processing and b) the data motion across the distributed …

    uiuc Repository record for Building interactive distributed processing applications at a global scale (opens in a new tab)

  15. P-Pascal : a data-oriented persistent programming language

    … by providing the full range of persistence for data of any type. Moreover, data which remains on disk after program termination, is manipulated in the same way as transient data. As these languages are based on general purpose programming languages, they tend to be program-centred rather than …

    cape-town Repository record for P-Pascal : a data-oriented persistent programming language (opens in a new tab)

  16. Elastic database systems

    Distributed on-line transaction processing (OLTP) database management systems (DBMSs) are a critical part of the operation of large enterprises. These systems often serve time-varying workloads due to daily, weekly or seasonal fluctuations in load, or because of rapid growth in demand due to a …

    mit Repository record for Elastic database systems (opens in a new tab)

  17. Design and analysis of spatially-partitioned shared caches

    Data movement is a growing problem in modern chip-multiprocessors (CMPs). Processors spend the majority of their time, energy, and area moving data, not processing it. For example, a single main memory access takes hundreds of cycles and costs the energy of a thousand floating-point operations. …

    mit Repository record for Design and analysis of spatially-partitioned shared caches (opens in a new tab)

  18. Exploiting Heterogeneity in Distributed Software Frameworks

    … Hadoop, Dryad, and Pregel, for supporting data-intensive scientific and enterprise applications on emerging heterogeneous compute, storage and network infrastructure. Large DSF deployments in the cloud continue to grow both in size and number, given DSFs are cost-effective and easy to …

    vt Repository record for Exploiting Heterogeneity in Distributed Software Frameworks (opens in a new tab)

  19. Systems and applications for persistent memory

    Performance-hungry data center applications demand increasingly higher performance from their storage in addition to larger capacity memory at lower cost. While the existing storage technologies (e.g., HDD and flash-based SSD) are limited in their performance, the most prevalent memory technology …

    gatech Repository record for Systems and applications for persistent memory (opens in a new tab)

  20. BUILDING EFFICIENT AND COST-EFFECTIVE CLOUD-BASED BIG DATA MANAGEMENT SYSTEMS

    In today’s big data world, data is being produced in massive volumes, at great velocity and from a variety of different sources such as mobile devices, sensors, a plethora of small devices hooked to the internet (Internet of Things), social networks, communication networks and many others. …

    maryland Repository record for BUILDING EFFICIENT AND COST-EFFECTIVE CLOUD-BASED BIG DATA MANAGEMENT SYSTEMS (opens in a new tab)

Page 1 of 2