Scheduling algorithms for a multiprocessor DSP platformHai Li
A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C =2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the...
Multiprocessor scheduling is the process of assigning tasks to multiple processors in a parallel fashion such that the time required for completion of all the processes is minimized. In this paper, various parallel scheduling strategies and scheduling algorithms has been studied. The task duplication ...
Section 6.3.2 studies scheduling analysis and algorithms for multiprocessors. Section 6.3.3 considers scheduling in the face of dynamically created tasks. 6.3.1 Role of the operating system An embedded multiprocessor may or may not have a true multiprocessor operating system. In many cases, the ...
Using dual approximation algorithms for scheduling problems theoretical and practical results The problem of scheduling a set of n jobs on m identical machines so as to minimize the makespan time is perhaps the most well-studied problem in the theor... DS Hochbaum,DB Shmoys - Symposium on Foun...
The existing on-line scheduling algorithms EDA (Earliest Deadline Algorithm) and LLA (Least Laxity Algorithm) are not sufficient for scheduling real-time sporadic tasks in multiprocessor systems. EDA has low context switching overhead but suffers from multiple processor anomalies. LLA has good scheduli...
Gerasoulis, “PYRROS: States scheduling and code generation for message passing multiprocessors,” Proc. of 6th ACM Int. Conf. on Supercomputing, 1992. P. Wang, W. Korfhage, “Process Scheduling Using Genetic Algorithms,” IEEE Symp. on Parallel andDistributed Processing, 638–641, 1995. T....
Arnold,Stadler,PF - 《Algorithms for Molecular Biology》 被引量: 8发表: 2010年 General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time We study the problem of scheduling n independent tasks on a set of m parallel processors, where the execution time of a task is a function...
The aim of this paper is to propose heuristic algorithms for a two-stage flow-shop scheduling problem with multiprocessor tasks to minimize the makespan. The heuristic algorithms are constructive in nature. They schedule the tasks one at a time from a given sequence. The rules considered for seq...
Gaudiot, “Some scheduling techniques for numerical algorithms in a simulated Data-Flow multiprocessor,” in Proceedings of the Parallel Computing 89 , Elsevier Science Publishers B.V., August 1989.P. Evripidou and J.-L. Gaudiot, "Some scheduling techniques for numerical algo rithms in a ...