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 387 for “"distributed memory"”.

  1. Distributed Memory Based FPGA Debug

    … has previously been unexplored is the use of distributed LUT memory for debug trace buffers, rather than dedicated FPGA BRAM. This dissertation presents a novel, lean embedded logic analyzer that leverages leftover LUT resources on the FPGA for this purpose. Distributed Memory Debug …

    byu Repository record for Distributed Memory Based FPGA Debug (opens in a new tab) Download PDF for Distributed Memory Based FPGA Debug (opens in a new tab)

  2. Compiling ACE for Distributed-Memory Machines

    Distributed-memory machines offer a very high level of performance, flexibility and scalability. But the memory organization of this kind of machine determines that processes on different processors must communicate explicitly by sending and receiving messages. As a result, the programmer faces the …

    portland-state Repository record for Compiling ACE for Distributed-Memory Machines (opens in a new tab)

  3. Resource Management for Distributed Memory Multicomputers

    … The remap algorithm provides an efficient, distributed implementation with each processor analyzing the tasks assigned to it. Finally, the template strategy provided a static allocation to dynamic tree-based flow graphs.

    uiuc Repository record for Resource Management for Distributed Memory Multicomputers (opens in a new tab)

  4. Optimizing Fortran90D/HPF for distributed-memory computers

    … portable parallel programs for a wide variety of distributed-memory 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 …

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

  5. Automatic data layout for distributed memory machines

    The goal of languages like Fortran D or High Performance Fortran (HPF) is to provide a simple yet efficient machine-independent parallel programming model. Besides the algorithm selection, the data layout choice is the key intellectual challenge in writing an efficient program in such languages. …

    rice Repository record for Automatic data layout for distributed memory machines (opens in a new tab)

  6. Automatic Data Partitioning on Distributed Memory Multicomputers

    Distributed-memory parallel computers are increasingly being used to provide high levels of performance for scientific applications. Unfortunately, such machines are not very easy to program. A number of research efforts seek to alleviate this problem by developing compilers that take over the task …

    uiuc Repository record for Automatic Data Partitioning on Distributed Memory Multicomputers (opens in a new tab)

  7. Reconfiguration and recovery in distributed memory multicomputers

    Restriction data tranferred 2014-07-01T11:16:00-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission

    uiuc Repository record for Reconfiguration and recovery in distributed memory multicomputers (opens in a new tab)

  8. Layer potential evaluations on distributed memory machines

    … investigates evaluating layer potentials on distributed-memory machines. The distributed algorithm introduced in this thesis is based on GIGAQBX and shows GIGAQBX contains plenty of parallelism. We evaluate our algorithm on the Comet supercomputer at the San Diego Supercomputer Center and …

    uiuc Repository record for Layer potential evaluations on distributed memory machines (opens in a new tab)

  9. Distributed Memory Processing of Very Large Graphs

    Big graphs such as social networks or the internet network, biological networks, knowledge graphs appear in many domains. However, processing these graphs rely on the accessibility of high-performance frameworks which are able to handle these large graphs. One aspect of this accessibility is the …

    oregon Repository record for Distributed Memory Processing of Very Large Graphs (opens in a new tab)

  10. Fast Fourier Transforms on Distributed Memory Parallel Machines

    … in developing a general purpose subroutine on a distributed memory parallel machine is the data distribution. It is possible that users would like to use the subroutine with different data distributions. Thus there is a need to design algorithms on distributed memory parallel machines which can …

    odu Repository record for Fast Fourier Transforms on Distributed Memory Parallel Machines (opens in a new tab)

  11. Mapping numerical software onto distributed memory parallel systems

    … the use of parallel computers, in particular distributed memory systems, by proving strategies for parallelisation and developing the core component of tools to aid scalar software porting. The ported code must not only efficiently exploit available parallel processing speed and distributed …

    greenwich Download PDF for Mapping numerical software onto distributed memory parallel systems (opens in a new tab)

  12. Tunable shared-memory abstractions for distributed-memory systems

    Distributed memory multiprocessor architectures offer enormous computational power, by exploiting the concurrent execution of many loosely connected processors. Yet, such scalability is not without price. Interface delays and low interconnection bandwidth to the distributed memories make internode …

    uiuc Repository record for Tunable shared-memory abstractions for distributed-memory systems (opens in a new tab)

  13. Optimizations for Energy Efficiency within Distributed Memory Programming Models

    … libraries and parallelism constructs for distributed computing. While innovative designs of hardware set the upper bounds for power consumption, there is a need for the software to adapt itself to achieve maximum efficiency at minimal joules. This work presents detailed analyses of …

    houston Repository record for Optimizations for Energy Efficiency within Distributed Memory Programming Models (opens in a new tab)

  14. Dynamic Task Execution on Shared and Distributed Memory Architectures

    … world of high performance computing, from shared memory machines to the largest distributed memory clusters. The multicore route to increased performance has a simpler design and better power efficiency than the traditional approach of increasing processor frequencies. But, standard programming …

    utk-theses Repository record for Dynamic Task Execution on Shared and Distributed Memory Architectures (opens in a new tab)

  15. Partial aggregation for collective communication in distributed memory machines

    … PEs increases, data movement across hierarchical memory subsystems introduces high latency. Minimizing latency is particularly challenging in collective communications, where many PEs may interact in complex communication patterns. Although collective communications can be optimized for …

    lmu-germany Repository record for Partial aggregation for collective communication in distributed memory machines (opens in a new tab)

  16. Effcient Simulation of Message-Passing in Distributed-Memory Architectures

    In this thesis we propose a distributed-memory parallel-computer simulation system called PUPPET (Performance Under a Pseudo-Parallel EnvironmenT). It allows the evaluation of parallel programs run in a pseudo-parallel system, where a single processor is used to multitask the program's processes, …

    waterloo Repository record for Effcient Simulation of Message-Passing in Distributed-Memory Architectures (opens in a new tab)

Page 1 of 20