scholarly journals Real-time Multiple-Workflow Scheduling in Cloud Environment

2021 ◽  
Author(s):  
Xiaojin Ma ◽  
Huahu Xu ◽  
Honghao Gao ◽  
Minjie Bian
Keyword(s):  
Real Time ◽  
Arrival Time ◽  
State Of The Art ◽  
Minimum Cost ◽  
Workflow Scheduling ◽  
Start Time ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Three Stages ◽  
Deadline Constraints

Abstract With the development of cloud computing, an increasing number of applications in different fields have been deployed to the cloud. In this process, the real-time scheduling of multiple workflows composed of tasks from these different applications must consider various influencing factors which strongly affect scheduling performance. This paper proposes a real-time multiple-workflow scheduling (RMWS) scheme to schedule workflows dynamically with minimum cost under different deadline constraints. Due to the uncertainty of workflow arrival time and specification, RMWS dynamically allocates tasks and divides the scheduling process into three stages. First, when a new workflow arrives, the latest start time and the latest finish time of each task are calculated according to the deadline, and the subdeadline of each task is obtained by probabilistic upward ranking. Then, each ready task is allocated according to its subdeadline and the increased cost of the virtual machine (VM). Meanwhile, only one waiting task can be assigned to each VM to reduce delay fluctuations. Finally, when the task is completed on the assigned VM, all the parameters of the relevant tasks are updated before allocating them to appropriate VMs. The experimental results based on four real-world workflow traces show that the proposed algorithm is superior to two state-of-the-art algorithms in terms of total rental cost, resource utilization, success rate and deadline deviation under different conditions.

A Secured Real Time Scheduling Model for Cloud Hypervisor

2016 ◽  
Vol 6 (4) ◽  
pp. 97-110
Author(s):  
Rekha Kashyap ◽  
Deo Prakash Vidyarthi
Keyword(s):  
Cloud Computing ◽  
Success Rate ◽  
Real Time ◽  
Virtual Machines ◽  
Resource Provisioning ◽  
Real Time Scheduling ◽  
Scheduling Model ◽  
Physical Resources ◽  
Time Scheduling ◽  
Deadline Constraints

Virtualization is critical to cloud computing and is possible through hypervisors, which maps the Virtual machines((VMs) to physical resources but poses security concerns as users relinquish physical possession of their computation and data. Good amount of research is initiated for resource provisioning on hypervisors, still many issues need to be addressed for security demanding and real time VMs. First work SRT-CreditScheduler (Secured and Real-time), maximizes the success rate by dynamically prioritizing the urgency and the workload of VMs but ensures highest security for all. Another work, SA-RT-CreditScheduler (Security-aware and Real-time) is a dual objective scheduler, which maximizes the success rate of VMs in best possible security range as specified by the VM owner. Though the algorithms can be used by any hypervisor, for the current work they have been implemented on Xen hypervisor. Their effectiveness is validated by comparing it with Xen's, Credit and SEDF scheduler, for security demanding tasks with stringent deadline constraints.

A Secured Real Time Scheduling Model for Cloud Hypervisor

2019 ◽  
pp. 507-522
Author(s):  
Rekha Kashyap ◽  
Deo Prakash Vidyarthi
Keyword(s):  
Cloud Computing ◽  
Success Rate ◽  
Real Time ◽  
Virtual Machines ◽  
Resource Provisioning ◽  
Real Time Scheduling ◽  
Scheduling Model ◽  
Physical Resources ◽  
Time Scheduling ◽  
Deadline Constraints

Virtualization is critical to cloud computing and is possible through hypervisors, which maps the Virtual machines((VMs) to physical resources but poses security concerns as users relinquish physical possession of their computation and data. Good amount of research is initiated for resource provisioning on hypervisors, still many issues need to be addressed for security demanding and real time VMs. First work SRT-CreditScheduler (Secured and Real-time), maximizes the success rate by dynamically prioritizing the urgency and the workload of VMs but ensures highest security for all. Another work, SA-RT-CreditScheduler (Security-aware and Real-time) is a dual objective scheduler, which maximizes the success rate of VMs in best possible security range as specified by the VM owner. Though the algorithms can be used by any hypervisor, for the current work they have been implemented on Xen hypervisor. Their effectiveness is validated by comparing it with Xen's, Credit and SEDF scheduler, for security demanding tasks with stringent deadline constraints.

scholarly journals Partially clairvoyant scheduling for aggregate constraints

2005 ◽  
Vol 2005 (4) ◽  
pp. 225-240
Author(s):  
K. Subramani
Keyword(s):  
Real Time ◽  
Performance Metrics ◽  
Model Performance ◽  
Timing Constraints ◽  
Start Time ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Execution Times ◽  
Relative Timing Constraints ◽  
Time Systems

The problem of partially clairvoyant scheduling is concerned with checking whether an ordered set of jobs, having nonconstant execution times and subject to a collection of imposed constraints, has a partially clairvoyant schedule. Variability of execution times of jobs and nontrivial relationships constraining their executions, are typical features of real-time systems. A partially clairvoyant scheduler parameterizes the schedule, in that the start time of a job in a sequence can depend upon the execution times of jobs that precede it, in the sequence. In real-time scheduling, parameterization of the schedule plays an important role in extending the flexibility of the scheduler, particularly in the presence of variable execution times. It has been shown that the existence of partially clairvoyant schedules can be determined in polynomial time, when the constraints are restricted to be “standard,” that is, relative timing constraints. In this paper, we extend the class of constraints for which partially clairvoyant schedules can be determined efficiently, to include aggregate constraints. Aggregate constraints form a strict superset of standard constraints and can be used to model performance metrics.

Effective Real-Time Scheduling Optimization for Multi-Functional Mixed-Criticality Systems

2020 ◽  
Vol 29 (14) ◽  
pp. 2050226
Author(s):  
Nan Gao ◽  
Weiqi Shi ◽  
Xin Peng ◽  
Jing Huang ◽  
Cheng Xu ◽  
...  
Keyword(s):  
Real Time ◽  
State Of The Art ◽  
Distributed Embedded Systems ◽  
Scheduling Optimization ◽  
Real Time Scheduling ◽  
Effective Operation ◽  
Time Scheduling ◽  
Redundant Operation ◽  
System Switching ◽  
Mixed Criticality

The heterogeneous distributed embedded systems integrated of multiple functions with different criticality levels are multi-functional mixed-criticality systems (MMCSs). The state-of-the-art work has studied the real-time scheduling in MMCS; however, it is not well designed in system switching mechanism and operation which may lead to missing the deadlines of high-criticality functions and redundant operation. In this study, we improve and optimize the problem by developing an algorithm called rearrangement-based scheduling for MMCS (RSM). The RSM algorithm optimizes the following two main aspects. The first aspect is optimizing system-criticality switching mechanisms, including system criticality changed up and down. The second aspect is the effective operation in system-criticality switching to reduce redundant operation. Experiments are performed, and results show that the RSM algorithm can achieve lower overall makespan and deadline miss ratios (DMRs) than the existing algorithms.

Workload assignment for global real-time scheduling on unrelated clustered platforms

2021 ◽  
Author(s):  
Antoine Bertout ◽  
Joël Goossens ◽  
Emmanuel Grolleau ◽  
Roy Jamil ◽  
Xavier Poczekajlo
Keyword(s):  
Real Time ◽  
Real Time Scheduling ◽  
Time Scheduling

scholarly journals Research on Multi-Timescale Coordinated Method for Source-Grid-Load with Uncertain Renewable Energy Considering Demand Response

2021 ◽  
Vol 13 (6) ◽  
pp. 3400
Author(s):  
Jia Ning ◽  
Sipeng Hao ◽  
Aidong Zeng ◽  
Bin Chen ◽  
Yi Tang
Keyword(s):  
Renewable Energy ◽  
Real Time ◽  
Demand Response ◽  
System Operation ◽  
Real Time Scheduling ◽  
High Penetration ◽  
Time Scheduling ◽  
Grid Load ◽  
Grid Side ◽  
Scheduling Models

The high penetration of renewable energy brings great challenges to power system operation and scheduling. In this paper, a multi-timescale coordinated method for source-grid-load is proposed. First, the multi-timescale characteristics of wind forecasting power and demand response (DR) resources are described, and the coordinated framework of source-grid-load is presented under multi-timescale. Next, economic scheduling models of source-grid-load based on multi-timescale DR under network constraints are established in the process of day-ahead scheduling, intraday scheduling, and real-time scheduling. The loads are classified into three types in terms of different timescale. The security constraints of grid side and time-varying DR potential are considered. Three-stage stochastic programming is employed to schedule resources of source side and load side in day-ahead, intraday, and real-time markets. The simulations are performed in a modified Institute of Electrical and Electronics Engineers (IEEE) 24-node system, which shows a notable reduction in total cost of source-grid-load scheduling and an increase in wind accommodation, and their results are proposed and discussed against under merely two timescales, which demonstrates the superiority of the proposed multi-timescale models in terms of cost and demand response quantity reduction.

Sign in / Sign up

Export Citation Format

Share Document