A mathematical model for performability of Beowulf clusters.

Book chapter


Ever, E., Gemikonakli, O. and Chakka, R. 2006. A mathematical model for performability of Beowulf clusters. in: 39th Annual Simulation Symposium: proceedings. California IEEE Computer Society. pp. 118-126
Chapter titleA mathematical model for performability of Beowulf clusters.
AuthorsEver, E., Gemikonakli, O. and Chakka, R.
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.

Research GroupSensoLab group
Page range118-126
Book title39th Annual Simulation Symposium: proceedings.
PublisherIEEE Computer Society
Place of publicationCalifornia
ISBN
Hardcover9780769525594
Publication dates
Print2006
Publication process dates
Deposited30 Mar 2009
Output statusPublished
Additional information

Conference held from April 2-6, 2006 at Huntsville, Alabama.

Web address (URL)http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1612851
Digital Object Identifier (DOI)https://doi.org/10.1109/ANSS.2006.6
LanguageEnglish
Permalink -

https://repository.mdx.ac.uk/item/81677

  • 19
    total views
  • 0
    total downloads
  • 0
    views this month
  • 0
    downloads this month

Export as