Task scheduling method considered the communication time by critical path: Application to various kinds of network topology

2003 ◽  
Vol 87 (1) ◽  
pp. 63-75
Author(s):  
Nobukazu Iijima ◽  
Kazunori Suwa ◽  
Mototaka Sone
Keyword(s):  
Task Scheduling ◽  
Network Topology ◽  
Critical Path ◽  
Communication Time ◽  
Scheduling Method

An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication

2011 ◽  
Vol 3 (1) ◽  
pp. 89-97 ◽  
Author(s):  
Amrit Agrawal ◽  
Pranay Chaudhuri
Keyword(s):  
Task Scheduling ◽  
Execution Time ◽  
High Speed ◽  
Critical Path ◽  
Task Assignment ◽  
Directed Acyclic Graphs ◽  
Parallel Tasks ◽  
Schedule Length ◽  
Task Duplication ◽  
Heterogeneous Distributed Systems

Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directed-acyclic graphs (DAGs). Scheduling refers to the assignment of these parallel tasks on a set of bounded heterogeneous processors connected by high speed networks. Since task assignment is an NP-complete problem, instead of finding an exact solution, scheduling algorithms are developed based on heuristics, with the primary goal of minimizing the overall execution time of the application or schedule length. In this paper, the overall execution time (schedule length) of the tasks is reduced using task duplication on top of the Critical-Path-On-a-Processor (CPOP) algorithm.

scholarly journals A Multi-Objective Task Scheduling Method for Fog Computing in Cyber-Physical-Social Services

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 65085-65095
Author(s):  
Ming Yang ◽  
Hao Ma ◽  
Shuang Wei ◽  
You Zeng ◽  
Yefeng Chen ◽  
...  
Keyword(s):  
Social Services ◽  
Task Scheduling ◽  
Fog Computing ◽  
Multi Objective ◽  
Scheduling Method

GENETIC ALGORITHM WITH TWO OBJECTIVE FOR REAL-TIME TASK SCHEDULING WITH COMMUNICATION TIME

2018 ◽  
Vol 6 (1) ◽  
pp. 14-17
Author(s):  
Myungryun Yoo ◽  
Takanori Yokoyama
Keyword(s):  
Real Time ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Multiprocessor System ◽  
Time Task ◽  
Communication Time ◽  
Adaptive Weight ◽  
Np Hard Problem ◽  
Heuristics Algorithm ◽  
Execution Order

Purpose of the study:The real-time task scheduling on multiprocessor system is known as an NP-hard problem. This paper proposes a new real-time task scheduling algorithmwhich considers the communication time between processors and the execution order between tasks. Methodology:Genetic Algorithm (GA)with Adaptive Weight Approach (AWA) is used in our approach. Main Findings:Our approach has two objectives. The first objective is to minimize the total amount of deadline-miss. And the second objective is to minimize the total number of processors used. Applications of this study:For two objectives,the range of each objective is readjusted through Adaptive Weight Approach (AWA) and more useful result is obtained. Novelty/Originality of this study:This study never been done before.This study also wasprovided current information about scheduling algorithm and heuristics algorithm.

Sign in / Sign up

Export Citation Format

Share Document