Results 1 
8 of
8
ON STOCHASTIC SCHEDULING WITH INTREE PRECEDENCE CONSTRAINTS
, 1987
"... We consider the problem of optimal scheduling of a set of jobs obeying intree precedence constraints, when a number M of processors is available. It is assumed that the service times of different jobs are independent identically distributed random variables. Subject to a minor assumption on the se ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We consider the problem of optimal scheduling of a set of jobs obeying intree precedence constraints, when a number M of processors is available. It is assumed that the service times of different jobs are independent identically distributed random variables. Subject to a minor assumption on the service time distribution, we show that policies of the "Highest Level First" type are optimal asymptotically, as the number of jobs tends to infinity.
Stochastic Scheduling with Variable Profile and Precedence Constraints
 STOCHASTIC SCHEDULING WITH VARIABLE PROFILE 187
, 1991
"... In this paper, we consider the stochastic profile scheduling problem of a partially ordered set of tasks on uniform processors. The set of available processors varies in time. The running times of the tasks are independent random variables with exponential distributions. We obtain a sufficient condi ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
In this paper, we consider the stochastic profile scheduling problem of a partially ordered set of tasks on uniform processors. The set of available processors varies in time. The running times of the tasks are independent random variables with exponential distributions. We obtain a sufficient condition under which a list policy stochastically minimizes the makespan within the class of preemptive policies. This result allows us to obtain a simple optimal policy when the partial order is an interval order, or an inforest, or an outforest. Keywords: Stochastic Scheduling, Profile Scheduling, Makespan, Precedence Constraint, Interval Order, InForest, OutForest, Uniform Processors, Stochastic Ordering. 1 Introduction Consider the following scheduling problem. We are given a set of tasks to be run in a system consisting of uniform processors (i.e., processors having different speeds). The executions of these tasks must satisfy some precedence constraints which are described by a dire...
Exploiting inter task dependencies for dynamic load balancing
 IEEE Int. Symp. HighPerf. Distr. Comp. (HDPC
, 1994
"... ..."
Profile Scheduling by List Algorithms
, 1994
"... The notion of profile scheduling was first introduced by Ullman in 1975 in the complexity analysis of deterministic scheduling algorithms. In such a model, the number of processors available to a set of tasks may vary in time. Since the last decade, this model has been used to deal with systems subj ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The notion of profile scheduling was first introduced by Ullman in 1975 in the complexity analysis of deterministic scheduling algorithms. In such a model, the number of processors available to a set of tasks may vary in time. Since the last decade, this model has been used to deal with systems subject to processor failures, multiprogrammed systems, or dynamically reconfigured systems. The aim of this paper is to overview optimal polynomial solutions for scheduling a set of partially ordered tasks in these systems. Particular attentions are given to a class of algorithms referred to as list scheduling algorithms. The objective of the scheduling problem is to minimize either the maximum lateness or the makespan. Results on preemptive and nonpreemptive deterministic scheduling, and on preemptive stochastic scheduling, are presented.
Scheduling a Sequence of Parallel Programs Containing Loops within a Centralized Parallel Processing System
, 1992
"... We investigate the problem of scheduling a sequence of jobs running in a centralized parallel processing system with identical processors. The jobs represent parallel programs that contain probabilistic loops of tasks that can be simultaneously executed. We show that the Smallest Phase first policy ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate the problem of scheduling a sequence of jobs running in a centralized parallel processing system with identical processors. The jobs represent parallel programs that contain probabilistic loops of tasks that can be simultaneously executed. We show that the Smallest Phase first policy is optimal within the class of nonpreemptive policies when the task processing times are identical and independently distributed random variables with an increasing likelihood ratio distribution. The optimality extends to the class of preemptive policies when the task processing times have an exponential distribution. The optimality is understood to be the stochastic minimization of the process of the numbers of jobs in the system and the minimization of mean response times of the jobs. Stronger optimality results on the minimization of job response time are obtained for a simpler job model.
Makespan Minimization Of Task Graphs With Random Task Running Times
 IN INTERCONNECTION NETWORKS AND MAPPING AND SCHEDULING PARALLEL COMPUTATIONS, D. F. HSU ET AL. (EDS.), AMS, DIMACS SERIES
, 1995
"... The problem of scheduling a set of tasks on two parallel and identical processors is considered. The executions of tasks are constrained by precedence relations. The running times of the tasks are independent random variables with a common exponential distribution. The goal of scheduling is to m ..."
Abstract
 Add to MetaCart
The problem of scheduling a set of tasks on two parallel and identical processors is considered. The executions of tasks are constrained by precedence relations. The running times of the tasks are independent random variables with a common exponential distribution. The goal of scheduling is to minimize the makespan, i.e. the maximum task completion time. A simple optimal preemptive policy is proven to stochastically minimize the makespan when the precedence graph belongs to a class of forestcut graphs.
Majorization and Stochastic Comparison Techniques for Scheduling of Parallel Systems
"... Parallel programs are usually modeled by task graphs which are directed acyclic graphs. Their vertices represent tasks and arcs represent precedence relations between tasks. These tasks are to be executed on parallel processors subject to precedence constraints: a task can start execution only when ..."
Abstract
 Add to MetaCart
(Show Context)
Parallel programs are usually modeled by task graphs which are directed acyclic graphs. Their vertices represent tasks and arcs represent precedence relations between tasks. These tasks are to be executed on parallel processors subject to precedence constraints: a task can start execution only when all its predecessor tasks have completed execution. A parallel program, or simply a job, is said to finish its execution if all its tasks complete executions. This completion time is referred to the job completion time. In a monoprogrammed system, at any time instant only tasks belong to the same job can run simultaneously on different processors, whereas in a multiprogrammed system, a sequence of jobs arrive in the system and tasks belong to different jobs can run simultaneously. For any given set of tasks, the scheduling problem consists in assigning tasks to...
Optimal Scheduling on Parallel Processors under Precedence Constraints and General Costs
, 1996
"... We consider preemptive and nonpreemptive scheduling of partially ordered tasks on parallel processors, where the precedence relations have an interval order, an inforest, or a uniform outforest structure. Processing times of tasks are random variables with an ILR (increasing in likelihood ratio) d ..."
Abstract
 Add to MetaCart
We consider preemptive and nonpreemptive scheduling of partially ordered tasks on parallel processors, where the precedence relations have an interval order, an inforest, or a uniform outforest structure. Processing times of tasks are random variables with an ILR (increasing in likelihood ratio) distribution in the nonpreemptive case and an exponential distribution in the preemptive case. We consider a general cost that is a function of time and of the uncompleted tasks and show that the Most Successors policy (MS) stochastically minimizes the cost function when it satisfies certain agreeability conditions. A consequence is that MS stochastically minimizes makespan, weighted flowtime, and weighted number of late jobs.