Performance and Energy Consumption Prediction of Randomly Selected Nodes in Heterogeneous Cluster

Idrees, Sara Kadhum; Fanfakh, Ahmed

doi:10.1007/978-3-030-01653-1_2

Cited by 4 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Authors introduced a prediction framework to execute parallel programs using a small training set. In [11,12,13,14,15,16], researchers have been proposed analytical execution time prediction models for NAS MPI programs over heterogenous cluster and grid. The remainder of the paper is organized as follows: Section 2 describes the execution time of MPI applications over grid.…”

Section: -Intoductionmentioning

confidence: 99%

Predicting the Performance of MPI Applications over Different Grid Architectures

Fanfakh¹

2019

JUBPAS

Self Cite

View full text Add to dashboard Cite

Nowadays, the high speed and accurate optimization algorithms are required. In most of the cases, researchers need a method to predict some criteria with acceptable accuracy to use it after in their algorithms. However, in the field of parallel computing the execution time can be considered the most important criteria. Consequently, this paper presents new execution time prediction model for message passing interface applications execute over numerous grid scenarios. The model has ability to predict the execution time of the message passing applications running over any grid configuration in term of different number of nodes and their computing powers. The experiments are evaluated over SimGrid simulator to simulate the grid configuration scenarios. The results of comparing the real and the predicted execution time show a good accuracy. The average error ratio between the real and the predicted execution time for three benchmarks are 4.36%, 5.79% and 6.81%.

show abstract

Section: -Intoductionmentioning

confidence: 99%

Predicting the Performance of MPI Applications over Different Grid Architectures

Fanfakh¹

2019

JUBPAS

Self Cite

View full text Add to dashboard Cite

show abstract

Parallel Genetic Algorithm for Optimizing Compiler Sequences Ordering

Almohammed

Fanfakh

Alwan

2020

Communications in Computer and Information Science

View full text Add to dashboard Cite

Duality for Instantial Neighbourhood Logic via Coalgebra

Bezhanishvili¹,

Enqvist²,

Groot³

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Instantial Neighbourhood Logic (INL) has been introduced recently as a language for neighbourhood frames where existential information can be given about what kind of worlds occur in a neighbourhood of a current world. Apart from its semantics, its proof theory and bisimulation games have also been studied. However, conspicuously absent from the treatment of INL is the notion of descriptive frames. This is the gap that we are closing in this paper. We introduce descriptive frames for INL and we prove that these are dual to boolean algebras with instantial operators (BAIOs), which give the algebraic semantics of INL. Our methods for establishing this duality make essential use of coalgebra: we observe that BAIOs are algebras for a functor on the category of boolean algebras and show that this functor is dual to the double Vietoris functor (i.e. the composition of the Vietoris functor with itself), thus obtaining a dual equivalence between double Vietoris coalgebras and BAIOs. The proof of our main result is then completed by showing that double Vietoris coalgebras correspond precisely to descriptive frames. As a corollary we obtain that every extension of INL is sound and complete with respect to descriptive frames, that descriptive frames enjoy the Hennessy-Milner property, and as a result, that finite neighbourhood frames enjoy the Hennessy-Milner property.

show abstract

Performance and Energy Consumption Prediction of Randomly Selected Nodes in Heterogeneous Cluster

Cited by 4 publications

References 23 publications

Predicting the Performance of MPI Applications over Different Grid Architectures

Predicting the Performance of MPI Applications over Different Grid Architectures

Parallel Genetic Algorithm for Optimizing Compiler Sequences Ordering

Duality for Instantial Neighbourhood Logic via Coalgebra

Contact Info

Product

Resources

About