A mathematical model for performability of Beowulf clusters.
Ever, Enver, Gemikonakli, Orhan 
ORCID: https://orcid.org/0000-0002-0513-1128 and Chakka, Ram
(2006)
A mathematical model for performability of Beowulf clusters.
In:
39th Annual Simulation Symposium: proceedings.
IEEE Computer Society, California, pp. 118-126.
ISBN 9780769525594.
[Book Section]
(doi:10.1109/ANSS.2006.6)
Abstract
Beowulf clusters have become very popular as an alternative to supercomputers world-wide. However, the most pressing issues of today’s cluster solutions is the need for high availability and performance. Such systems, clearly, are prone to break-downs. Even if cover is provided with some probability c, there will be reconfiguration and/or rebooting delays to resume the operation of a cluster. In this paper, the performance modelling for Beowulf multiprocessor systems is presented. For these systems, one head processor and several identical processors serving a common stream of arriving jobs is considered. To account for delays due to reconfiguration and rebooting, such systems are modelled and solved for exact performability measures, for both bounded and unbounded queuing capacities, using the spectral expansion method.
| Item Type: | Book Section |
|---|---|
| Additional Information: | Conference held from April 2-6, 2006 at Huntsville, Alabama. |
| Research Areas: | A. > School of Science and Technology > Computer and Communications Engineering A. > School of Science and Technology > Computer Science > SensoLab group |
| Item ID: | 1740 |
| Useful Links: | |
| Depositing User: | Enver Ever |
| Date Deposited: | 30 Mar 2009 16:31 |
| Last Modified: | 08 Jul 2019 13:40 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/1740 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)