American University
Browse
thesesdissertations_5531_OBJ.pdf (2.97 MB)

Scheduling algorithms for distributed/parallel computation on Beowulf clusters

Download (2.97 MB)
thesis
posted on 2023-08-04, 20:45 authored by Narayana Mahankali

Beowulf clusters are proving to be a cost-effective alternative to costly parallel computers. The performance of parallel and distributed programs running on a Beowulf cluster can be improved if the underlying LINUX operating system provides support for coscheduling mechanisms. The goal of coscheduling is to achieve simultaneous scheduling of communicating parallel processes on their respective nodes thereby reducing the communication lags between them. This report discusses some coscheduling mechanisms in general and describes the implementation and evaluation of the Periodic Boost-Decay algorithm in particular. We find that Periodic Boost-Decay algorithm provides significant improvement in the performance of parallel programs run on a Beowulf cluster.

History

Publisher

ProQuest Dissertations & Theses

Language

English

Notes

Thesis (M.S.)--American University, 2001.

Handle

http://hdl.handle.net/1961/thesesdissertations:5531

Media type

application/pdf

Access statement

Unprocessed

Usage metrics

    Theses and Dissertations

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC