Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA) Indonesian Journal of Electrical Engineering and Computer Science
Morshed Chowdhury
Deakin University
Electrical & Electronics Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Power graphs: A survey Jemal Abawajy; Andrei Kelarev; Morshed Chowdhury
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 1, No 2 (2013): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2013.1.2.6

Abstract

This article gives a survey of all results on the power graphs of groups and semigroups obtained in the literature. Various conjectures due to other authors, questions and open problems are also included.
Scheduling Workflow Applications with Makespan and Reliability Constraints Maslina Abdul Aziz; Jemal H. Abawajy; Morshed Chowdhury
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 2: November 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i2.pp482-488

Abstract

In the last few years, workflows are becoming richer and more complex. Workflow scheduling management system to be robust, flexible with multicriteria scheduling algorithms. It needs to satisfy the Quality of Service (QoS) parameters. However, QoS parameters and workflow system objectives are often contradictory. In our analysis, we derived an efficient strategy to minimize the overall processing time for scheduling workflows modelled by using Directed Acyclic Graph (DAG). We studied the problem of workflow scheduling that lead to optimizing makespan and reliability. The proposed algorithm handles unsuccessful job execution or resource failure by dynamically scheduling workflows to available resources. Based on the experiments results, our proposed Failure-Aware Workflow Scheduling (FAWS) Algorithm can significantly optimize the makespan and minimize the reliability by rescheduling the failed task to the unused resources. The effectiveness of the FAWS algorithm was validated based on a simulation-driven analysis based on the workflow application.
Co-Authors Andrei Kelarev Jemal Abawajy Jemal H. Abawajy Maslina Abdul Aziz