Some problems of stochastic resource allocation

1972 ◽  
Vol 9 (2) ◽  
pp. 360-369 ◽  
Author(s):  
J. C. Gittins
Keyword(s):  
Resource Allocation ◽  
Hazard Rates ◽  
Processing Unit ◽  
Completion Rates ◽  
Chemical Research ◽  
Scheduling Policy ◽  
Processing Times ◽  
Simultaneous Processing ◽  
Stochastic Resource Allocation ◽  
Optimal Policies

Suppose that a number of jobs are to be carried out by a single processing unit orserver. The server can process any number of jobs at the same time but the time taken to finish all the jobs is the same no matter what scheduling policy is used, provided the server is never left idle. It is, however, possible to minimise the total delays to individual jobs by adopting a suitable policy. Optimal policies are derived here for the situation when the processing times are random variables. If the completion rates (analogous to hazard rates) for every job are increasing it is optimal to process the jobs in sequence. If they are decreasing the optimal policy involves simultaneous processing. These results are applied to a more general resource allocation problem arising in industrial chemical research.

Some problems of stochastic resource allocation

1972 ◽  
Vol 9 (02) ◽  
pp. 360-369 ◽  
Author(s):  
J. C. Gittins
Keyword(s):  
Resource Allocation ◽  
Hazard Rates ◽  
Processing Unit ◽  
Completion Rates ◽  
Chemical Research ◽  
Scheduling Policy ◽  
Processing Times ◽  
Simultaneous Processing ◽  
Stochastic Resource Allocation ◽  
Optimal Policies

Suppose that a number of jobs are to be carried out by a single processing unit orserver. The server can process any number of jobs at the same time but the time taken to finish all the jobs is the same no matter what scheduling policy is used, provided the server is never left idle. It is, however, possible to minimise the total delays to individual jobs by adopting a suitable policy. Optimal policies are derived here for the situation when the processing times are random variables. If the completion rates (analogous to hazard rates) for every job are increasing it is optimal to process the jobs in sequence. If they are decreasing the optimal policy involves simultaneous processing. These results are applied to a more general resource allocation problem arising in industrial chemical research.

Single-machine stochastic scheduling with dependent processing times

1992 ◽  
Vol 24 (03) ◽  
pp. 635-652 ◽  
Author(s):  
K. D. Glazebrook ◽  
Lyn R. Whitaker
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Simple Structure ◽  
Stochastic Scheduling ◽  
Negative Dependence ◽  
Total Reward ◽  
Processing Times ◽  
Optimal Policies ◽  
Positive And Negative Dependence ◽  
Machine Allocation

A single machine is available to process a collection of stochastic jobs preemptively. Rewards are received at job completions. We seek policies for machine allocation which maximize the total reward. Application areas point to the need to study such models for resource allocation when job processing requirements are dependent. To this end, models are developed in which the nature of such dependence is derived from various notions of positive and negative dependence in common usage in reliability. Optimal policies for resource allocation of simple structure are obtained for a variety of such models.

Single-machine stochastic scheduling with dependent processing times

1992 ◽  
Vol 24 (3) ◽  
pp. 635-652 ◽  
Author(s):  
K. D. Glazebrook ◽  
Lyn R. Whitaker
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Simple Structure ◽  
Stochastic Scheduling ◽  
Negative Dependence ◽  
Total Reward ◽  
Processing Times ◽  
Optimal Policies ◽  
Positive And Negative Dependence ◽  
Machine Allocation

A single machine is available to process a collection of stochastic jobs preemptively. Rewards are received at job completions. We seek policies for machine allocation which maximize the total reward. Application areas point to the need to study such models for resource allocation when job processing requirements are dependent. To this end, models are developed in which the nature of such dependence is derived from various notions of positive and negative dependence in common usage in reliability. Optimal policies for resource allocation of simple structure are obtained for a variety of such models.

On the scheduling of alternative stochastic jobs on a single machine

1987 ◽  
Vol 19 (4) ◽  
pp. 955-973 ◽  
Author(s):  
K. D. Glazebrook ◽  
N. A. Fay
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Stochastic Scheduling ◽  
Major Area ◽  
Research Planning ◽  
Stochastic Resource Allocation ◽  
Standard Models ◽  
Set Up ◽  
Area Of Application

Standard models in stochastic resource allocation concern the economic processing of all jobs in some set J. We consider a set up in which tasks in various subsets of J are deemed to be alternative to one another, in that only one member of such a subset of alternative tasks will be completed during the evolution of the process. Existing stochastic scheduling methodology for single-machine problems is developed and extended to this novel class of models. A major area of application is in research planning.

scholarly journals Task Staggering Peak Scheduling Policy for Cloud Mixed Workloads

Information ◽  
2018 ◽  
Vol 9 (12) ◽  
pp. 329
Author(s):  
Zhigang Hu ◽  
Yong Tao ◽  
Meiguang Zheng ◽  
Chenglong Chang
Keyword(s):  
Clustering Algorithm ◽  
Task Characteristics ◽  
Processing Unit ◽  
Central Processing ◽  
Scheduling Policy ◽  
Load Imbalance ◽  
Usage Cost ◽  
Task Types ◽  
Load Size ◽  
Task Sequences

To address the issue of cloud mixed workloads scheduling which might lead to system load imbalance and efficiency degradation in cloud computing, a novel cloud task staggering peak scheduling policy based on the task types and the resource load status is proposed. First, based on different task characteristics, the task sequences submitted by the user are divided into queues of different types by the fuzzy clustering algorithm. Second, the Performance Counters (PMC) mechanism is introduced to dynamically monitor the load status of resource nodes and respectively sort the resources by the metrics of Central Processing Unit (CPU), memory, and input/output (I/O) load size, so as to reduce the candidate resources. Finally, the task sequences of specific type are scheduled for the corresponding light loaded resources, and the resources usage peak is staggered to achieve load balancing. The experimental results show that the proposed policy can balance loads and improve the system efficiency effectively and reduce the resource usage cost when the system is in the presence of mixed workloads.

On the scheduling of alternative stochastic jobs on a single machine

1987 ◽  
Vol 19 (04) ◽  
pp. 955-973 ◽  
Author(s):  
K. D. Glazebrook ◽  
N. A. Fay
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Stochastic Scheduling ◽  
Major Area ◽  
Research Planning ◽  
Stochastic Resource Allocation ◽  
Standard Models ◽  
Set Up ◽  
Area Of Application

Standard models in stochastic resource allocation concern the economic processing of all jobs in some set J. We consider a set up in which tasks in various subsets of J are deemed to be alternative to one another, in that only one member of such a subset of alternative tasks will be completed during the evolution of the process. Existing stochastic scheduling methodology for single-machine problems is developed and extended to this novel class of models. A major area of application is in research planning.

Sign in / Sign up

Export Citation Format

Share Document