Hybrid real-coded genetic algorithm for data partitioning in multi-round load distribution and scheduling in heterogeneous systems

S. Suresh, Hao Huang, Hyong Joong Kim

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

Data partitioning and scheduling is one the important issues in minimizing the processing time for parallel and distributed computing system. We consider a single-level tree architecture of the system and the case of affine communication model, for a general m processor system with n rounds of load distribution. For this case, there exists an optimal activation order, optimal number of processors.

Original languageEnglish
Pages (from-to)500-510
Number of pages11
JournalApplied Soft Computing Journal
Volume24
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Distributed computer systems
Parallel processing systems
Genetic algorithms
Chemical activation
Scheduling
Communication
Processing

ASJC Scopus subject areas

  • Software

Cite this

@article{156bb24a8a9842589275df8826e7dc00,
title = "Hybrid real-coded genetic algorithm for data partitioning in multi-round load distribution and scheduling in heterogeneous systems",
abstract = "Data partitioning and scheduling is one the important issues in minimizing the processing time for parallel and distributed computing system. We consider a single-level tree architecture of the system and the case of affine communication model, for a general m processor system with n rounds of load distribution. For this case, there exists an optimal activation order, optimal number of processors.",
keywords = "Data partitioning, Divisible loads, Genetic algorithm, Parallel computing, Scheduling",
author = "S. Suresh and Hao Huang and Kim, {Hyong Joong}",
year = "2014",
month = "1",
day = "1",
doi = "10.1016/j.asoc.2014.07.021",
language = "English",
volume = "24",
pages = "500--510",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - Hybrid real-coded genetic algorithm for data partitioning in multi-round load distribution and scheduling in heterogeneous systems

AU - Suresh, S.

AU - Huang, Hao

AU - Kim, Hyong Joong

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Data partitioning and scheduling is one the important issues in minimizing the processing time for parallel and distributed computing system. We consider a single-level tree architecture of the system and the case of affine communication model, for a general m processor system with n rounds of load distribution. For this case, there exists an optimal activation order, optimal number of processors.

AB - Data partitioning and scheduling is one the important issues in minimizing the processing time for parallel and distributed computing system. We consider a single-level tree architecture of the system and the case of affine communication model, for a general m processor system with n rounds of load distribution. For this case, there exists an optimal activation order, optimal number of processors.

KW - Data partitioning

KW - Divisible loads

KW - Genetic algorithm

KW - Parallel computing

KW - Scheduling

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

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

U2 - 10.1016/j.asoc.2014.07.021

DO - 10.1016/j.asoc.2014.07.021

M3 - Article

AN - SCOPUS:84907364233

VL - 24

SP - 500

EP - 510

JO - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

ER -