Practical verification of an embedded Beowulf architecture using standard cluster benchmarks

M. R. Fowler, E. Stipidis, F. H. Ali

    Research output: Chapter in Book/Conference proceeding with ISSN or ISBNConference contribution with ISSN or ISBNpeer-review

    Abstract

    The advent of embedded systems with greater capacity in terms of processing and general functionality has given rise to the recent use of embedded clusters, as seen in Singapore's Satellite Mission, X-Sat. This paper presents a Linux-based concurrent system of embedded network nodes, interconnected by Ethernet. It is formed of readily available components and is configured as a standard, commodity-based Beowulf class computer. It uses a free implementation of the Message Passing Interface. Combining the inherent benefits of Beowulf and embedded systems forms a space-efficient distributed system. Thus a multiple node system can be comfortably housed on a developer's desk, being programmed and administered in the same way as a conventional PC based cluster. To validate the system, standard benchmark results are shown for message passing protocol overhead and peak floating point rate of computation.

    Original languageEnglish
    Title of host publicationProceedings - The 3rd International Conference on Software Engineering Advances, ICSEA 2008, Includes ENTISY 2008
    Subtitle of host publicationInternational Workshop on Enterprise Information Systems
    Pages140-145
    Number of pages6
    DOIs
    Publication statusPublished - 22 Dec 2008
    Event3rd International Conference on Software Engineering Advances, ICSEA 2008 - Sliema, Malta
    Duration: 26 Oct 200831 Oct 2008

    Conference

    Conference3rd International Conference on Software Engineering Advances, ICSEA 2008
    Country/TerritoryMalta
    CitySliema
    Period26/10/0831/10/08

    Fingerprint

    Dive into the research topics of 'Practical verification of an embedded Beowulf architecture using standard cluster benchmarks'. Together they form a unique fingerprint.

    Cite this