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 10 of 10 for “"Beowulf cluster"”.

  1. Development of a parallel SAR processor on a Beowulf cluster

    … distributed in memory over the nodes in the cluster. This was successfully achieved using a in-place method, thus saving valuable memory resources. Once the parallel processor was implemented some timing tests were performed, yielding a maximum speedup factor of 6.2 for an 8 slave processor …

    cape-town Repository record for Development of a parallel SAR processor on a Beowulf cluster (opens in a new tab)

  2. Speedup of MCNP(X) parallel KCODE execution via communication algorithm development and Beowulf Cluster optimization

    … The first approach is assembly of a low cost Beowulf Cluster for parallel computation. The first half describes the MIT Nuclear Engineering Department's Beowulf Cluster, Echelon, as a prototype. Echelon is a low cost, 30 CPIJ, disk-less Debian Linux Beowulf Cluster. A user's manual is …

    mit Repository record for Speedup of MCNP(X) parallel KCODE execution via communication algorithm development and Beowulf Cluster optimization (opens in a new tab)

  3. A Descriptive Performance Model of Small, Low Cost, Diskless Beowulf Clusters

    <p>Commodity supercomputing clusters known as Beowulf clusters, have become a low cost alternative to traditional supercomputers. Beowulf clusters combine inexpensive computers and specialized software to achieve supercomputing power. The processing nodes in a diskless Beowulf cluster do not have a …

    byu Repository record for A Descriptive Performance Model of Small, Low Cost, Diskless Beowulf Clusters (opens in a new tab)

  4. Parallelization of ECG template-based abnormality detection

    … in the data. The processing is done on a Linux Beowulf Cluster using the standardized Message Passing Interface (MPI) libraries. In the thesis, the results of four different parallel approaches are compared, and their performance is evaluated.

    wvu Repository record for Parallelization of ECG template-based abnormality detection (opens in a new tab)

  5. An R*-Tree Based Semi-Dynamic Clustering Method for the Efficient Processing of Spatial Join in a Shared-Nothing Parallel Database System

    … the data set across several nodes of a cluster and executing queries across these nodes in parallel. This document discusses a new parallel algorithm that implements the spatial join in an efficient manner. This algorithm is compared to an existing parallel spatial-join algorithm, the …

    uno Repository record for An R*-Tree Based Semi-Dynamic Clustering Method for the Efficient Processing of Spatial Join in a Shared-Nothing Parallel Database System (opens in a new tab)

  6. Development of multifunctional software for evaluating the photonic properties of new dielectric composite geometries

    … solutions to be obtained quickly using a beowulf cluster. An extension to the basic FDTD plane wave source was derived, allowing for the creation of angled, periodic, unidirectional plane waves on a square grid. 1D photonic crystal stacks were arranged in a square array and it was …

    mit Repository record for Development of multifunctional software for evaluating the photonic properties of new dielectric composite geometries (opens in a new tab)

  7. Threaded WARPED : An Optimistic Parallel Discrete Event Simulator for Cluster of Multi-Core Machines

    … and many-core processors suitable for use in Beowulf clusters provides an opportunity for PDES execution on a platform containing both shared memory and distributed memory parallelism. This thesis explores the migration of an existing PDES simulation kernel called WARPED to a Beowulf Cluster

    ohiolink Repository record for Threaded WARPED : An Optimistic Parallel Discrete Event Simulator for Cluster of Multi-Core Machines (opens in a new tab)

  8. Global Optimization of Transmitter Placement for Indoor Wireless Communication Systems

    … ray tracing modeler running on a 200-node Beowulf cluster of Linux workstations, and surrogate functions for a WCDMA (wideband code division multiple access) simulator are also used to estimate the channel performance. Any component failure of this large computation would abort the entire …

    vt Repository record for Global Optimization of Transmitter Placement for Indoor Wireless Communication Systems (opens in a new tab)

  9. Scalable parallel simulation of small-scale structures in cold dark matter

    … (P³M) algorithm for distributed memory clusters. The llp3m-hc code uses a hybrid method for both computation and domain decomposition. Long-range forces are computed using a Fourier transform gravity solver on a regular mesh; the mesh is distributed across parallel processes using a …

    mit Repository record for Scalable parallel simulation of small-scale structures in cold dark matter (opens in a new tab)

  10. Black Hole Accretion Systems

    … performing numerical simulations on our group's Beowulf computer clusters, which I designed and constructed. For about $50,000, one can buy a private cluster of computers that will provide as much computing power as today's typical time-shared ""supercomputer."" I give an account of the …

    uiuc Repository record for Black Hole Accretion Systems (opens in a new tab)