Memory-Aware Task Scheduling with Communication Overhead Minimization for Streaming Applications on Bus-Based Multiprocessor System-on-Chips

2014 ◽  
Vol 25 (7) ◽  
pp. 1797-1807 ◽  
Author(s):  
Yi Wang ◽  
Zili Shao ◽  
Henry C. B. Chan ◽  
Duo Liu ◽  
Yong Guan
Keyword(s):  
Task Scheduling ◽  
Multiprocessor System ◽  
Communication Overhead ◽  
Streaming Applications

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.

Task Scheduling on a Multiprocessor System with Independent Memories

1977 ◽  
Vol 6 (1) ◽  
pp. 167-187 ◽  
Author(s):  
D. G. Kafura ◽  
V. Y. Shen
Keyword(s):  
Task Scheduling ◽  
Multiprocessor System

Task Allocation In A Multiprocessor System Using Fuzzy Logic

1996 ◽  
pp. 69-79 ◽  
Author(s):  
Shaharuddin Salleh
Keyword(s):  
Fuzzy Logic ◽  
Task Scheduling ◽  
Task Allocation ◽  
Multiprocessor System ◽  
Interprocessor Communication ◽  
Optimal Solutions ◽  
Optimum Load ◽  
Job Sequencing ◽  
Priority Order ◽  
Draw Conclusion

Task scheduling for multiprocessors is a job-sequencing problem generally classified as NP-complete or NP-hard. Optimal solutions to the problem using some well-known algorithms can only be obtained in some restricted cases. In most cases,however, this is not possible. Therefore, near-optimal solutions to the problem have been developed using heuristics. This paper proposes a new heuristic using fuzzy logic to achieve near optimum load balancing for the task allocation problem in a multiprocessor system. Task allocation is a restricted case of task scheduling where the tasks have no precedence relations with others and the priority order of execution is ignored. The tasks are assumed to be non-preemptable, have no execution deadlines and have no interprocessor communication. It is possible to·apply the fuzzy concepts since the problems involved are difficult to model mathematically. Much of its power of fuzzy logic is derived from its ability to draw conclusion and generate responses based on incomplete and imprecise informations.

Sign in / Sign up

Export Citation Format

Share Document