Analysis of Finite-Source Cluster Networks

Adam Toth, Tamas Berczes, Attila Kuki, Bela Almasi, Wolfgang Schreiner, Jintin Wang, Fang Wang

Research output: Contribution to journalArticlepeer-review

Abstract

Nowadays the distributed heterogeneous resources of networks, like the computational grid, start to have a greater part of interest so, the investigations of such systems are vital. Because of the more efficient utilisation of the resources, the job scheduling becomes more challenging for the system administrators. The allocation of the arriving jobs has a great impact on the efficiency and the energy consumption of the system. In this paper, we present a finite source generalized model for the performance evaluation of scheduling compute-intensive jobs based on the infinite model of Tien Van Do. The available computers are classified into three groups. This classification is based on two aspects: high performance priority (HP) and energy efficiency priority (EE). We investigate three schemes (separate queue, class queue and common queue) for buffering the jobs in a computational cluster that is built from Commercial Off-The-Shelf (COTS) servers. Our main interest is to calculate performance measures and energy consumption of the system using the different buffering schemes and classifications.
Original languageEnglish
Pages (from-to)223-235
Number of pages14
JournalCreative Mathematics and Informatics
Volume25
Issue number2
Publication statusPublished - 2016

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101005 Computer algebra
  • 101009 Geometry
  • 101012 Combinatorics
  • 101013 Mathematical logic
  • 101020 Technical mathematics

JKU Focus areas

  • Computation in Informatics and Mathematics

Cite this