Performance Models for the Processor Farm Paradigm
IEEE Transactions on Parallel and Distributed Systems
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
Small-college supercomputing: building a Beowulf cluster at a comprehensive college
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Coscheduling in Clusters: Is It a Viable Alternative?
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Highly reliable linux HPC clusters: self-awareness approach
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Generalized QBD processes, spectral expansion and performance modeling applications
Network performance engineering
| Hi-index | 0.00 |
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.