Results 1 
3 of
3
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 5 (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...
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.
Strategies for Querying Information Agents
 In Cooperative Information Agents
, 1998
"... . In a simple cooperative MAS model where a collection of "querying agents" can send queries to a collection of "information agents", we formalize the problem of designing strategies so that the expected completion time of the queries is minimized, when every querying agent uses ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. In a simple cooperative MAS model where a collection of "querying agents" can send queries to a collection of "information agents", we formalize the problem of designing strategies so that the expected completion time of the queries is minimized, when every querying agent uses the same strategy. We devise a provably optimal strategy for the static case with no query arrivals, and show via simulations that the same strategy performs well when queries arrive with a certain probability. We also consider issues such as whether or not the expected completion time can be reduced by sending multiple copies of queries, or by aborting copies of answered queries. 1 Introduction As the internet grows relentlessly, and multiagent systems (MAS) proliferate, it becomes increasingly important to design algorithms for agents to use limited resources (such as time, memory, bandwidth, etc) efficiently. A badly designed scheme can easily lead to congestion and poor response times. A first step toward...