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 18 of 18 for “"Beowulf Cluster"”.

  1. Profiling and optimizing K-means algorithms in a beowulf cluster environment

    … description of two parallel environments, the Beowulf style clusters and the Symmetric Multi-Processors (SMP) parallel machines. A mixture of theoretical and empirical models were used to characterize these environments and set baseline expectations pertaining to the K-means algorithm. Due to …

    ets-quebec Download PDF for Profiling and optimizing K-means algorithms in a beowulf cluster environment (opens in a new tab)

  2. Identifying Data Exchange Congestion Through Real-Time Monitoring Of Beowulf Cluster Infiniband Networks

    … data for information. High Performance Computing Cluster systems have been developed to fulfill a role required for fast processing of large amounts of data for many difficult types of computing applications. Beowulf Clusters use many separate compute nodes to create a tightly coupled parallel …

    nodak Repository record for Identifying Data Exchange Congestion Through Real-Time Monitoring Of Beowulf Cluster Infiniband Networks (opens in a new tab)

  3. Creating Software [Sic] Environments on an M-Node Beowulf Cluster to Execute Discrete-Event Simulations

    … program on several nodes of an M-node Beowulf cluster. It is assumed that each cluster-node consists of p processors. The p processors that are contained in the master cluster-node are termed master processors, and the p processors that are contained in a slave cluster-node are termed …

    odu Repository record for Creating Software [Sic] Environments on an M-Node Beowulf Cluster to Execute Discrete-Event Simulations (opens in a new tab)

  4. Concurrent Viola Jones classifiers on a portable Beowulf cluster : a thesis presented in partial fulfilment of the requirements for the degree of Master of Engineering in Mechatronics at Massey University

    Real-time Computer Vision is an interesting application for supercomputing, real-time applications (vision processing in particular) employ special purpose hardware such as DSPs to achieve high performance. This thesis explores parallel computers particularly commodity general purpose hardware. We …

    massey Repository record for Concurrent Viola Jones classifiers on a portable Beowulf cluster : a thesis presented in partial fulfilment of the requirements for the degree of Master of Engineering in Mechatronics at Massey University (opens in a new tab)

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

    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) Download PDF for A Descriptive Performance Model of Small, Low Cost, Diskless Beowulf Clusters (opens in a new tab)

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

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

  8. A scalable application server on Beowulf clusters : a thesis presented in partial fulfilment of the requirement for the degree of Master of Information Science at Albany, Auckland, Massey University, New Zealand

    … ECperf benchmark application in the Massey Beowulf Clusters namely the Sisters and the Helix. My testing environment consists of Open Source software: The integrated JBoss-Tomcat as the application server and the web server, along with PostgreSQL as the database. My testing programs were run …

    massey Repository record for A scalable application server on Beowulf clusters : a thesis presented in partial fulfilment of the requirement for the degree of Master of Information Science at Albany, Auckland, Massey University, New Zealand (opens in a new tab)

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

  10. Effects of land management upon species population dynamics: a spatially explicit, individual-based model

    … to distribute the simulation across a 30-node Beowulf cluster was the most effective at increasing model efficiency whilst preserving model behaviour. Key scenarios are presented, that show the power of this approach in predicting potential impacts of agricultural landscape change, including …

    whiterose Download PDF for Effects of land management upon species population dynamics: a spatially explicit, individual-based model (opens in a new tab)

  11. The development of free energy methods for protein-ligand complexes

    … This, combined with the use of a large Linux Beowulf cluster, enabled each protein-ligand free energy calculation to be run within 1.5 days. We predict that, using the latest computers, these calculations could take less than 12 hours.</p>

    soton Download PDF for The development of free energy methods for protein-ligand complexes (opens in a new tab)

  12. Refinement of numerical models and parametric study of SOFC stack performance

    … 1-D SOFC single cell models in parallel on a Beowulf cluster. In order to study cross-flow geometries a novel Multi-Component Multi-Physics (MCMP) scheme was instantiated to produce a Reduced Order 3-D Fuel Cell Model. A C++ implementation of the MCMP scheme developed in this study utilized …

    wvu Repository record for Refinement of numerical models and parametric study of SOFC stack performance (opens in a new tab)

  13. X-ray CT on the GPU

    … processing of data is to run the programs on a cluster. CNDE uses a 64 node Beowulf cluster to do the reconstruction of an image. However with the advent of the GPU (Graphic Processing Unit) we have a far more cost efficient and time efficient hardware to run the reconstruction algorithm. The …

    iastate Repository record for X-ray CT on the GPU (opens in a new tab)

  14. A distributed-memory implementation of KIVA-3 with refinements for large eddy simulation.

    … 2000, Cray T3E and recently Alpha Linux based Beowulf cluster. Benchmark runs for speedup and parallel efficiency were performed on up to 48 processors with several grid resolutions starting from 250,000 to 4.28 million cells for the selected validation and benchmark problems on Origin 2000. …

    wvu Repository record for A distributed-memory implementation of KIVA-3 with refinements for large eddy simulation. (opens in a new tab)

  15. Algorithmic skeletons for exact combinatorial search at scale

    … allowing search to execute on multi-cores, clusters, cloud, and high performance computing systems. Underpinning the skeleton design is a novel formal model, MT^3 , a parallel operational semantics that describes multi-threaded tree traversals, allowing reasoning about parallel search, e.g. …

    glasgow Download PDF for Algorithmic skeletons for exact combinatorial search at scale (opens in a new tab)

  16. Profiling a parallel domain specific language using off-the-shelf tools

    … running on up to 192 cores of a 32 nodes Beowulf cluster. We characterise the performance of HdpHProf in terms of profiling data size and profiling execution runtime overhead. It shows that HdpHProf does not alter the behaviour of the GHC-PPS and retains low tracing overheads close to the …

    glasgow Download PDF for Profiling a parallel domain specific language using off-the-shelf tools (opens in a new tab)

  17. Performability modelling of homogenous and heterogeneous multiserver systems with breakdowns and repairs

    … stage. Applications of these for the popular Beowulf cluster systems and memory servers are also accomplished. Existing techniques used in performance evaluation of multi-server systems are investigated and analysed in detail. Pure performance modelling techniques, pure availability models, …

    middlesex Download PDF for Performability modelling of homogenous and heterogeneous multiserver systems with breakdowns and repairs (opens in a new tab)

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