Genetic algorithm for data exchange optimization

Research output: Contribution to journalArticle

Abstract

Dynamic architectures have emerged to be a promising implementation platform to provide flexibility, high performance, and low power consumption for computing devices. They can bring unique capabilities to computational tasks and offer the performance and energy efficiency of hardware with the flexibility of software. This paper proposes a genetic algorithm to develop an optimum configuration that optimizes the routing among its communicating processing nodes by minimizing the path length and maximizing possible parallel paths. In addition, this paper proposes forward, virtually inverse, and hybrid data exchange approaches to generate dynamic configurations that achieve data exchange optimization. Intensive experiments and qualitative comparisons have been conducted to show the effectiveness of the presented approaches. Results show significant performance improvement in terms of total execution time of up to 370%, 408%, 477%, and 550% when using configurations developed based on genetic algorithm, forward, virtually inverse, and hybrid data exchange techniques, respectively.

Original languageEnglish
Pages (from-to)630-639
Number of pages10
JournalInternational Journal of Advanced Computer Science and Applications
Volume10
Issue number2
Publication statusPublished - Jan 1 2019

Fingerprint

Electronic data interchange
Genetic algorithms
Energy efficiency
Electric power utilization
Hardware
Processing
Experiments

Keywords

  • And hybrid data exchange method
  • Dynamic architectures
  • Forward data exchange
  • Genetic algorithm
  • Virtually inverse data exchange

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Genetic algorithm for data exchange optimization. / Awadallah, Medhat.

In: International Journal of Advanced Computer Science and Applications, Vol. 10, No. 2, 01.01.2019, p. 630-639.

Research output: Contribution to journalArticle

@article{91e9a8834162472790dae6d6c53cb6f9,
title = "Genetic algorithm for data exchange optimization",
abstract = "Dynamic architectures have emerged to be a promising implementation platform to provide flexibility, high performance, and low power consumption for computing devices. They can bring unique capabilities to computational tasks and offer the performance and energy efficiency of hardware with the flexibility of software. This paper proposes a genetic algorithm to develop an optimum configuration that optimizes the routing among its communicating processing nodes by minimizing the path length and maximizing possible parallel paths. In addition, this paper proposes forward, virtually inverse, and hybrid data exchange approaches to generate dynamic configurations that achieve data exchange optimization. Intensive experiments and qualitative comparisons have been conducted to show the effectiveness of the presented approaches. Results show significant performance improvement in terms of total execution time of up to 370{\%}, 408{\%}, 477{\%}, and 550{\%} when using configurations developed based on genetic algorithm, forward, virtually inverse, and hybrid data exchange techniques, respectively.",
keywords = "And hybrid data exchange method, Dynamic architectures, Forward data exchange, Genetic algorithm, Virtually inverse data exchange",
author = "Medhat Awadallah",
year = "2019",
month = "1",
day = "1",
language = "English",
volume = "10",
pages = "630--639",
journal = "International Journal of Advanced Computer Science and Applications",
issn = "2158-107X",
publisher = "Science and Information Organization",
number = "2",

}

TY - JOUR

T1 - Genetic algorithm for data exchange optimization

AU - Awadallah, Medhat

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Dynamic architectures have emerged to be a promising implementation platform to provide flexibility, high performance, and low power consumption for computing devices. They can bring unique capabilities to computational tasks and offer the performance and energy efficiency of hardware with the flexibility of software. This paper proposes a genetic algorithm to develop an optimum configuration that optimizes the routing among its communicating processing nodes by minimizing the path length and maximizing possible parallel paths. In addition, this paper proposes forward, virtually inverse, and hybrid data exchange approaches to generate dynamic configurations that achieve data exchange optimization. Intensive experiments and qualitative comparisons have been conducted to show the effectiveness of the presented approaches. Results show significant performance improvement in terms of total execution time of up to 370%, 408%, 477%, and 550% when using configurations developed based on genetic algorithm, forward, virtually inverse, and hybrid data exchange techniques, respectively.

AB - Dynamic architectures have emerged to be a promising implementation platform to provide flexibility, high performance, and low power consumption for computing devices. They can bring unique capabilities to computational tasks and offer the performance and energy efficiency of hardware with the flexibility of software. This paper proposes a genetic algorithm to develop an optimum configuration that optimizes the routing among its communicating processing nodes by minimizing the path length and maximizing possible parallel paths. In addition, this paper proposes forward, virtually inverse, and hybrid data exchange approaches to generate dynamic configurations that achieve data exchange optimization. Intensive experiments and qualitative comparisons have been conducted to show the effectiveness of the presented approaches. Results show significant performance improvement in terms of total execution time of up to 370%, 408%, 477%, and 550% when using configurations developed based on genetic algorithm, forward, virtually inverse, and hybrid data exchange techniques, respectively.

KW - And hybrid data exchange method

KW - Dynamic architectures

KW - Forward data exchange

KW - Genetic algorithm

KW - Virtually inverse data exchange

UR - http://www.scopus.com/inward/record.url?scp=85063585553&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063585553&partnerID=8YFLogxK

M3 - Article

VL - 10

SP - 630

EP - 639

JO - International Journal of Advanced Computer Science and Applications

JF - International Journal of Advanced Computer Science and Applications

SN - 2158-107X

IS - 2

ER -