Parallel Processing of Robot Dynamics Simulation Using Optimal Multiprocessor Scheduling Algorithms

1988 ◽  
Vol 19 (10) ◽  
pp. 45-54
Author(s):  
Hironori Kasahara ◽  
Masahiko Iwata ◽  
Seinosuke Narita ◽  
Hirofumi Fujii
Keyword(s):  
Parallel Processing ◽  
Scheduling Algorithms ◽  
Multiprocessor Scheduling ◽  
Dynamics Simulation ◽  
Robot Dynamics

scholarly journals Parallel Processing of MENDEL Using Multiprocessor Scheduling Algorithms

1987 ◽  
Vol 107 (2) ◽  
pp. 149-156
Author(s):  
Munenori Kai ◽  
Hironori Kasahara ◽  
Seinosuke Narita ◽  
Shinichi Honiden ◽  
Shinsuke Tamura
Keyword(s):  
Parallel Processing ◽  
Scheduling Algorithms ◽  
Multiprocessor Scheduling

scholarly journals BNP TASK SCHEDULING ALGORITHMS FOR PERFORMANCE EVALUATION IN PARALLEL SYSTEM

2014 ◽  
Vol 12 (8) ◽  
pp. 3768-3777
Author(s):  
Akanksha Garg ◽  
Navdeep S.Sethi ◽  
Nidhi Arora ◽  
Amit Makkar
Keyword(s):  
Time Complexity ◽  
Important Implication ◽  
Directed Acyclic Graph ◽  
Scheduling Algorithms ◽  
Multiprocessor Scheduling ◽  
System Throughput ◽  
Test Case ◽  
Acyclic Graph ◽  
Schedule Length ◽  
Effective Output

Scheduling is the process to minimize the schedule length by proper allocation of the tasks to the processors and arrangement of execution sequencing of the tasks. Multiprocessor Scheduling using Directed Acyclic Graph (DAG) is used in this research.  An important implication of minimization of schedule length is that the system throughput is maximized. The objective of this survey is to describe various scheduling algorithms and their functionalities in a contrasting fashion as well as examine their relative merits in terms of performance and time-complexity. In this research, three BNP Scheduling Algorithms are considered namely HLFET Algorithm, MCP Algorithm and ETF Algorithm to calculate effective output by comparing the algorithms with eight test case scenarios with varying number of nodes and processors.

Sign in / Sign up

Export Citation Format

Share Document