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 80 for “"Data Placement"”.

  1. Large-scale optimization for data placement problem

    … problems are characterized by large sets of data (variables and constraints). In this thesis, we study large-scale optimization of the data placement problem with zero storage cost. The goal in the data placement problem is to find the placement of data objects in a set of fixed capacity …

    lethbridge Repository record for Large-scale optimization for data placement problem (opens in a new tab)

  2. Reuse aware data placement schemes for multilevel cache hierarchies

    … designed to achieve the maximum performance of data intensive workloads. What grows with the depth and capacity is the amount of data movement happened between different levels of caches and the associated energy consumption. Prior art [65] shows that the energy cost of moving data from memory …

    texas Repository record for Reuse aware data placement schemes for multilevel cache hierarchies (opens in a new tab)

  3. Accelerator Programming with Decoupled Data Placement for Heterogeneous Architectures

    As modern applications grow increasingly data-intensive and computationally demanding, dataflow accelerators, such as FPGAs and AMD Versal AI-Engine (AIE), are emerging as promising solutions because they enable parallel execution of compute units and allow direct data transfer between units …

    cornell Repository record for Accelerator Programming with Decoupled Data Placement for Heterogeneous Architectures (opens in a new tab)

  4. Algorithms for data placement, reconfiguration and monitoring in storage networks

    … related to self-management of storage networks - data placement, data reconfiguration and data monitoring. Examples of such storage networks include centrally managed systems like Storage Area Networks and Network Attached Storage devices, or even highly distributed systems like a P2P network or a …

    maryland Repository record for Algorithms for data placement, reconfiguration and monitoring in storage networks (opens in a new tab)

  5. 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)

  6. Hash-Store: Next-generation data storage with hash-based data placement

    Facing the data explosion generated by applications like social networks, multimedia streaming, information retrieval, scientific simulations, and data analytics, a key challenge in both research community and industry is how to store and manage data highly effectively at massive scales. …

    ttu Repository record for Hash-Store: Next-generation data storage with hash-based data placement (opens in a new tab)

  7. Data Placement And Task Mapping Optimization For Big Data Workflows In The Cloud

    Data-centric workflows naturally process and analyze a huge volume of datasets. In this new era of Big Data there is a growing need to enable data-centric workflows to perform computations at a scale far exceeding a single workstation's capabilities. Therefore, this type of applications can benefit …

    wayne-thes Repository record for Data Placement And Task Mapping Optimization For Big Data Workflows In The Cloud (opens in a new tab)

  8. Achieving High Reliability and Efficiency in Maintaining Large-Scale Storage Systems through Optimal Resource Provisioning and Data Placement

    <p>With the explosive increase in the amount of data being generated by various applications, large-scale distributed and parallel storage systems have become common data storage solutions and been widely deployed and utilized in both industry and academia. While these high performance storage …

    utk-theses Repository record for Achieving High Reliability and Efficiency in Maintaining Large-Scale Storage Systems through Optimal Resource Provisioning and Data Placement (opens in a new tab)

  9. Semantically-aware data discovery and placement in collaborative computing environments

    As the size of scientific datasets and the demand for interdisciplinary collaboration grow in modern science, it becomes imperative that better ways of discovering and placing datasets generated across multiple disciplines be developed to facilitate interdisciplinary scientific research. For …

    lsu-thes Repository record for Semantically-aware data discovery and placement in collaborative computing environments (opens in a new tab)

  10. Performance study of parallel I/O systems

    … Specifically, we investigate the impact of data placement on I/O performance. For one intuitively good placement policy, a race develops among concurrent merge sorts, resulting in the serialization of job executions and significant performance degradation. We present a model of a system with …

    rice Repository record for Performance study of parallel I/O systems (opens in a new tab)

  11. On exploiting location flexibility in data-intensive distributed systems

    With the fast growth of data-intensive distributed systems today, more novel and principled approaches are needed to improve the system efficiency, ensure the service quality to satisfy the user requirements, and lower the system running cost. This dissertation studies the design issues in the …

    uvic Repository record for On exploiting location flexibility in data-intensive distributed systems (opens in a new tab)

  12. The interaction of architecture and operating system in the designing of a scalable shared memory multiprocessor

    … access behavior, the exploitation of thread and data placement by the operating system is mandatory for improved performance. The organization of the SALSA kernel exploits the underlying memory architecture. We describe a programming model that takes into account the clustering in the system, and …

    rice Repository record for The interaction of architecture and operating system in the designing of a scalable shared memory multiprocessor (opens in a new tab)

  13. Data transfer scheduling with advance reservation and provisioning

    … applications have become more complex and more data intensive. Although through the use of distributed resources the institutions and organizations gain access to the resources needed for their large-scale applications, complex middleware is required to orchestrate the use of these storage and …

    lsu-thes Repository record for Data transfer scheduling with advance reservation and provisioning (opens in a new tab)

  14. Fine-grain parallelism and run-time decision-making

    … when and how processes communicate, and how data is placed in the memories of the processors. The challenge is to address these issues simply, portably, and efficiently. This dissertation presents the Filaments package, which provides fine-grain parallelism and a shared-memory programming …

    arizona-thes Repository record for Fine-grain parallelism and run-time decision-making (opens in a new tab)

  15. SageFS: the location aware wide area distributed filesystem

    … have to make a choice about how to main- tain data within the system. Distributed storage systems are often self- contained in a single cluster or are a black box as data placement is unknown by an applica- tion. Using wide area distributed storage either means using multiple APIs or loss of …

    uvic Repository record for SageFS: the location aware wide area distributed filesystem (opens in a new tab)

  16. Designing Scalable Mechanisms for Geo-Distributed Platform Services in the Presence of Client Mobility

    … and Pulsar, for managing their compute and data components across the geo-distributed Edge infrastructure. Situation-awareness applications impose peculiar requirements on the compute and data placement policies of the platform services. Firstly, the processing logic of these applications is …

    gatech Repository record for Designing Scalable Mechanisms for Geo-Distributed Platform Services in the Presence of Client Mobility (opens in a new tab)

  17. Scheduling for High Throughput and Small Latency in Parallel and Distributed Systems

    … at high throughput. Finally, we analyzed various data-placement strategies for distributed key-value stores. In distributed key-value stores, a large amount of data is stored across multiple servers. When a request to access data arrives, it is routed to the appropriate server, queued, and …

    wustl Repository record for Scheduling for High Throughput and Small Latency in Parallel and Distributed Systems (opens in a new tab)

  18. 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)

Page 1 of 4