Synthetic Loads Analysis of Directed Acyclic Graphs for Scheduling Tasks
| Autor: | Apolinar Velarde Martinez |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Theoretical computer science
General Computer Science Computer science 0202 electrical engineering electronic engineering information engineering 020206 networking & telecommunications 020201 artificial intelligence & image processing 02 engineering and technology Directed acyclic graph Graph MathematicsofComputing_DISCRETEMATHEMATICS Scheduling (computing) |
| Zdroj: | International Journal of Advanced Computer Science and Applications. 9 |
| ISSN: | 2156-5570 2158-107X |
| DOI: | 10.14569/ijacsa.2018.090348 |
| Popis: | Graphs are structures used in different areas of scientific research, for the ease they have to represent different models of real life. There is a great variety of algorithms that build graphs with very dissimilar characteristics and types that model the relationships between the objects of the problem to solve. To model the relationships, characteristics such as depth, width and density of the graph are used in the directed acyclic graphs (DAGs) to find the solution to the objective problem. These characteristics are rarely analyzed and taken into account before being used in the approach of a solution. In this work, we present a set of methods for the random generation of DAGs. DAGs are produced with three of these methods representing three synthetic loads. Each of the three above characteristics is evaluated and analyzed in each of DAGs. The generation and evaluation of synthetic loads is with the objective of predicting the behavior of each DAG, based on its characteristics, in a scheduling algorithm and assignment of parallel tasks in a distributed heterogeneous computing system (DHCS). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|