• Sep 17, 2018 News!Welcome to 2019 4th International Conference on Information and Network Technologies (ICINT 2019), which will be held in Kyoto, Japan during May 25-27, 2019.   [Click]
  • Jul 04, 2018 News!JACN Vol.6, No.1 has been published with online version.   [Click]
  • May 22, 2018 News!JACN has been included in EBSCO database.
General Information
    • ISSN: 1793-8244
    • Frequency: Semiyearly
    • DOI: 10.18178/JACN
    • Editor-in-Chief: Dr. Ka Wai Gary Wong
    • Executive Editor: Ms. Nina Lee
    • Abstracting/ Indexing: EI (INSPEC, IET),  Electronic Journals Library, Ulrich's Periodicals Directory, EBSCO, ProQuest, and Google Scholar.
    • E-mail: jacn@ejournal.net
Editor-in-chief
Dr. Ka Wai Gary Wong
Division of Information and Technology Studies, Faculty of Education, The University of Hong Kong.
It's a honor to serve as the editor-in-chief of JACN. I'll work together with the editors and reviewers to help the journal progress
JACN 2014 Vol.2(1): 10-13 ISSN: 1793-8244
DOI: 10.7763/JACN.2014.V2.72

Genetic Algorithm with Descendants Idea for Scheduling Tasks Graph in the Multi-Processor Architecture

Mostafa Mahi and Halife Kodaz
Abstract—Nowadays, multi-processor systems are being used extensively in parallel computing. The effective scheduling system for implementing parallel programs to achieve high performance is crucial. The timing should be done in such a way that the total execution time of the program with according to time and tasks to be minimize communication between processors. This is a NP-Hard problem which tasks graph scheduling approaches based on deterministic methods are not effective in this context while the use of evolutionary computing and genetic algorithms to solve this problem effectively are mainly. In this paper, a new genetic algorithm is proposed for the problem of scheduling tasks graph which is able to spend less time to get. This algorithm is based on a new approach to minimize the length of the critical path and the cost of communication between processors. In this paper, we calculate the number of descendants for each node in which tries to minimize the total execution time of the program.

Index Terms—Scheduling multi-processor, tasks graph, algorithm genetic.

Mostafa Mahi is with the Department of Computer Engineering and Information Technology, Payame Noor University, Tehran, Iran (e-mail: mahi@pnu.ac.ir).
Halife Kodaz is with the Department of Computer Engineering, Selcuk University, Konya, Turkey (e-mail: hkodaz@selcuk.edu.tr).

[PDF]

Cite:Mostafa Mahi and Halife Kodaz, "Genetic Algorithm with Descendants Idea for Scheduling Tasks Graph in the Multi-Processor Architecture," Journal of Advances in Computer Networks vol. 2, no. 1, pp. 10-13, 2014.

Copyright © 2008-2018. Journal of Advances in Computer Networks.  All rights reserved.
E-mail: jacn@ejournal.net