9,503 research outputs found
Real-time scheduling of parallel tasks in the Linux Kernel
This paper proposes a global multiprocessor scheduling algorithm
for the Linux kernel that combines the global EDF scheduler with
a priority-aware work-stealing load balancing scheme, enabling parallel
real-time tasks to be executed on more than one processor at a given time
instant. We state that some priority inversion may actually be acceptable,
provided it helps reduce contention, communication, synchronisation
and coordination between parallel threads, while still guaranteeing
the expected system’s predictability. Experimental results demonstrate
the low scheduling overhead of the proposed approach comparatively
to an existing real-time deadline-oriented scheduling class for the Linux
kernel
GENETIC ALGORITHM WITH TWO OBJECTIVE FOR REAL-TIME TASK SCHEDULING WITH COMMUNICATION TIME
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
Recommended from our members
Computer-aided programming for multiprocessing systems
As both the number of processors and the complexity of problems to be solved increase, programming multiprocessing systems becomes more difficult and error-prone. This report discusses parallel models of computation and tools for computer-aided programming (CAP). Program development tools are necessary since programmers are not able to develop complex parallel programs efficiently. In particular, a CAP tool, named Hypertool, is described here. It performs scheduling and handles the communication primitive insertion automatically so that many errors are eliminated. It also generates the performance estimates and other program quality measures to help programmers in improving their algorithms and programs. Experiments have shown that up to a 300% performance improvement can be achieved by computer-aided programming
Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system
Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed
- …