A formal method for scheduling algorithms in multiprocessor architectures is presented. The approach can be used for synthesis of processes in distributed systems and massively parallel architectures with asynchronous or synchronous parallelism. It is assumed that a global virtual job to be performed is ...
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...
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...
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 algorithms in a ...
Multiprocessor scheduling, also called scheduling on parallel identical machines to minimize the makespan, is a classic optimization problem which has been
systemsmuchmorevulnerabletofailures.Inadditionto degradingreliability,thermalhotspotsandhightemperature gradientsbringchallengesforperformance,coolingcosts,and leakagepower.Inthispaper,weproposestaticanddynamic temperature-awareMPSoCschedulingstrategies.Weshowthat ...
Resource-constrained scheduling problems with a fixed number of task types are considered in which, in addition, either the processing times are bounded or the number of processors is fixed. For problems with makespan, (weighted) mean flow time, weighted number of tardy tasks, and sum of tardin...
This assumption leads to a significant simplification of the MPOS which we capitalize on in the definitions and algorithms presented in this paper. The multiprocessor open shop (MPOS) is an extension of two classical problems in scheduling theory, namely the open shop and the parallel shop. The ...
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....
A system-level multiprocessor system-on-chip modeling framework