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 16 of 16 for “"data redistribution"”.

  1. An MPI-based 2D data redistribution library for dense arrays

    In HPC, data redistributions (reorganizations) are used in parallel applications to improve performance and/or provide data-locality compatibility with sequences of parallel operations. Data reorganization refers to changing the logical and physical arrangement of data (such as dense arrays or …

    utc Repository record for An MPI-based 2D data redistribution library for dense arrays (opens in a new tab)

  2. High performance virtual architecture parallel libraries with data redistribution for multicomputers

    … programs perform computations on distributed data. Transfer of data between processors is carried out using communication operations which are normally costly. Introduction of parallel library systems gives rise to four important issues. The first one is the design of the library routine …

    concordia Download PDF for High performance virtual architecture parallel libraries with data redistribution for multicomputers (opens in a new tab)

  3. Simultaneous exploitation of task and data parallelism in regular scientific applications

    … simultaneous exploitation of task and data parallelism. Our optimization is implemented as part of the PARADIGM HPF compiler framework and as part of a MATLAB compiler framework we have developed. The intuitive idea behind the optimization is the use of task parallelism to control the …

    uiuc Repository record for Simultaneous exploitation of task and data parallelism in regular scientific applications (opens in a new tab)

  4. Task-based Runtime Optimizations Towards High Performance Computing Applications

    … workloads engendered by HPC applications., i.e., data redistribution, geospatial modeling and 3D unstructured mesh deformation here. Data redistribution aims to reshuffle data to optimize some objective for an algorithm, whose objective can be multi-dimensional, such as improving computational …

    utk-theses Repository record for Task-based Runtime Optimizations Towards High Performance Computing Applications (opens in a new tab)

  5. Software Support for Efficient Data Movement and Memory Sharing in High-Performance Computing

    … but this parallelism introduces substantial data-movement overhead. These costs arise not only from the explicit transfer of data, but also from less-visible preparation work and from data layouts that reduce the efficiency of subsequent computation. This thesis investigates software support …

    queens Repository record for Software Support for Efficient Data Movement and Memory Sharing in High-Performance Computing (opens in a new tab)

  6. Abstractions for Portable Data Management in Heterogeneous Memory Systems

    This thesis is a study of data selection and placement in heterogeneous memories in modern high-performance computer architectures.<br/>Memory systems are becoming increasingly complex and diverse, which complicates the search for optimal data placement and reduces the portability of …

    bristol Repository record for Abstractions for Portable Data Management in Heterogeneous Memory Systems (opens in a new tab) Download PDF for Abstractions for Portable Data Management in Heterogeneous Memory Systems (opens in a new tab)

  7. Workload Management for Data-Intensive Services

    <p>Data-intensive web services are typically composed of three tiers: i) a display tier that interacts with users and serves rich content to them, ii) a storage tier that stores the user-generated or machine-generated data used to create this content, and iii) an analytics tier that runs data …

    duke Repository record for Workload Management for Data-Intensive Services (opens in a new tab)

  8. Data and Processor Mapping Strategies for Dynamically Resizable Parallel Applications

    … in terms of minimizing the cost of data redistribution, choosing and allocating the right set of additional processors, and focusing on the performance of the application after resizing. We explore the tradeoffs between these goals on both homogeneous and heterogeneous clusters. We …

    vt Repository record for Data and Processor Mapping Strategies for Dynamically Resizable Parallel Applications (opens in a new tab)

  9. Improving the performance and scalability of algebraic multigrid solvers through applied performance modeling

    … tasks: guiding an algorithm that redistributes data to trade communication for computation, and informing the selection of thread/task mixes when using a hybrid programming model. Our performance models accurately predict the performance of the AMG solve cycle on multiple platforms, capturing …

    uiuc Repository record for Improving the performance and scalability of algebraic multigrid solvers through applied performance modeling (opens in a new tab)

  10. ReSHAPE: A Framework for Dynamic Resizing of Parallel Applications

    As terascale supercomputers become more common, and as the high-performance computing community turns its attention to petascale machines, the challenge of providing effective resource management for high-end machines grows in both importance and difficulty. These computing resources are by …

    vt Repository record for ReSHAPE: A Framework for Dynamic Resizing of Parallel Applications (opens in a new tab)

  11. Fast data analysis framework for scientific big data applications

    … increasingly powered by advanced computing and data analysis capabilities. The data-driven scientific discovery has become the new fourth paradigm of scientific innovation after theory, experiment, and simulation driven innovations. The data-driven scientific discovery is based upon advanced …

    ttu Repository record for Fast data analysis framework for scientific big data applications (opens in a new tab)

  12. Dynamic Load Balancing in a Geophysics Application Using STAPL

    … construction algorithm. We added a generic redistribution framework for data structures in the C++ parallel library STAPL. We present a redistribution algorithm for the parallel wavefront construction application which uses the recursive coordinate bisection method to find a near-optimal …

    tamu Repository record for Dynamic Load Balancing in a Geophysics Application Using STAPL (opens in a new tab)

  13. Προσομοίωση ψηφιακών συστημάτων - αλγόριθμοι δυναμικής αναδιανομής δεδομένων σε σύστημα παράλληλων επεξεργαστών

    … it may require different distribution of data between several processor sets. Such applications are the alternate direction implicit method [29] and the multidimensional Fast Fourier Transform [40], [44], [45]. Data redistribution is therefore required each time the distribution of data to …

    greece Repository record for Προσομοίωση ψηφιακών συστημάτων - αλγόριθμοι δυναμικής αναδιανομής δεδομένων σε σύστημα παράλληλων επεξεργαστών (opens in a new tab)

  14. Next-Gen Hybrid Memory and Interconnect System Architectures

    … two problems that emerge along with the 'big data' trend: the increasing demands of memory capacity for mobile computing platform, and the needs for interconnection network with higher bandwidth/energy efficiency in the HPC/Data Center. The current mobile applications have rapidly growing …

    tamu Repository record for Next-Gen Hybrid Memory and Interconnect System Architectures (opens in a new tab)

  15. Effiziente parallele Sortier- und Datenumverteilungsverfahren für Partikelsimulationen auf Parallelrechnern mit verteiltem Speicher

    Partikelsimulationen repräsentieren eine Klasse von daten- und rechenintensiven Simulationsanwendungen, die in unterschiedlichen Bereichen der Wissenschaft und der industriellen Forschung zum Einsatz kommen. Der hohe Berechnungsaufwand der eingesetzten Lösungsmethoden und die großen Datenmengen, …

    qucosa-diss