Optimal Resource Scheduling and Allocation under Allowable Over-Scheduling

03/31/2022
by   Wei Ren, et al.
0

This paper studies optimal scheduling and resource allocation under allowable over-scheduling. Formulating an optimisation problem where over-scheduling is embedded, we derive an optimal solution that can be implemented by means of a new additive increase multiplicative decrease (AIMD) algorithm. After describing the AIMD-like scheduling mechanism as a switching system, we show convergence of the scheme, based on the joint spectral radius of symmetric matrices, and propose two methods for fitting an optimal AIMD tuning to the optimal solution derived. Finally, we demonstrate the overall optimal design strategy via an illustrative example.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/15/2021

Optimal Resource Scheduling and Allocation in Distributed Computing Systems

The essence of distributed computing systems is how to schedule incoming...
research
04/18/2011

An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor

An optimal solution to the problem of scheduling real-time tasks on a se...
research
10/10/2012

Online Adaptive Fault Tolerant based Feedback Control Scheduling Algorithm for Multiprocessor Embedded Systems

Since some years ago, use of Feedback Control Scheduling Algorithm (FCSA...
research
11/22/2019

On an Optimal Solution to the Film Scheduling and Showtime Staggering Problem

The scheduling of films is a major problem for the movie theatre exhibit...
research
07/01/2018

Asymptotically optimal delay-aware scheduling in wireless networks

In this paper, we investigate a channel allocation problem in networks t...
research
07/26/2020

Resource Augmentation

This chapter introduces resource augmentation, in which the performance ...

Please sign up or login with your details

Forgot password? Click here to reset