AN EFFICIENT HYBRID APPROACH BASED ON THE ACO AND CLA FOR STATIC TASK-GRAPH SCHEDULING IN HOMOGENEOUS MULTIPROCESSOR ENVIRONMENTS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

BOVEIRI HAMID REZA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT) Year:2016 | Volume:5 | Issue:3 Page(s): 35-54

Download Full-Text

Persian Verion

View:

981

Download:

Cites:

Information Journal Paper

Title

AN EFFICIENT HYBRID APPROACH BASED ON THE ACO AND CLA FOR STATIC TASK-GRAPH SCHEDULING IN HOMOGENEOUS MULTIPROCESSOR ENVIRONMENTS

Author(s)

BOVEIRI HAMID REZA | Issue Writer Certificate

Keywords

ANT COLONY OPTIMIZATION (ACO)Q2

CELLULAR LEARNING AUTOMATA (CLA)Q2

META-HEURISTICSQ2

MULTIPROCESSOR TASK-GRAPH SCHEDULINGQ2

PARALLEL AND DISTRIBUTED SYSTEMSQ2

Abstract

Task scheduling has been so far of important challenges in high-performance computers e.g. PARALLEL AND DISTRIBUTED SYSTEMS. Using such architectures during compiling, each application program is divided to some tasks. Because of data-flow among the tasks, they may be dependent to one another; hence, there will be precedence constraints and communication delays among them so that each application with its corresponding tasks can be modeled using a Directed Acyclic Graph (DAG) named task graph. In static task-graph scheduling in homogeneous multiprocessor environments, tasks in the given task graph should be mapped to a predefined number of identical processing elements regarding the precedence constraints and communication delays so that the program’s completion time (finish time) is minimized, and this is an NP-hard problem form the time-complexity perspective. Actually, the achieved results are dominated by two different-in-nature factors: 1) which topological order of tasks should be considered? (sequencing subproblem), and 2) how should the extracted order be distributed over the processors? (assigning subproblem). In this paper, an efficient hybrid approach is proposed in which the Ant Colony Optimization (ACO) determines the order of tasks, and a Cellular Learning Automata (CLA) machine tackles with the assigning subproblem, and maps the task order derived by ACO to the existing processors.125 randomly-generated task graphs with different shape parameters such as size, Communication-to-Computation Ratio (CCR), and parallelism are used for the comparison study, and the results shows that the proposed approach is more successful than the traditional counterparts from the performance point of view, and eventually outperforms them.

Cites

No record.

References

No record.

Cite

APA: Copy

BOVEIRI, HAMID REZA. (2016). AN EFFICIENT HYBRID APPROACH BASED ON THE ACO AND CLA FOR STATIC TASK-GRAPH SCHEDULING IN HOMOGENEOUS MULTIPROCESSOR ENVIRONMENTS. JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT), 5(3 ), 35-54. SID. https://sid.ir/paper/245841/en

Vancouver: Copy

BOVEIRI HAMID REZA. AN EFFICIENT HYBRID APPROACH BASED ON THE ACO AND CLA FOR STATIC TASK-GRAPH SCHEDULING IN HOMOGENEOUS MULTIPROCESSOR ENVIRONMENTS. JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT)[Internet]. 2016;5(3 ):35-54. Available from: https://sid.ir/paper/245841/en

IEEE: Copy

HAMID REZA BOVEIRI, “AN EFFICIENT HYBRID APPROACH BASED ON THE ACO AND CLA FOR STATIC TASK-GRAPH SCHEDULING IN HOMOGENEOUS MULTIPROCESSOR ENVIRONMENTS,” JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT), vol. 5, no. 3 , pp. 35–54, 2016, [Online]. Available: https://sid.ir/paper/245841/en

Related Journal Papers