Multiple-resource partial order scheduling policy

A scheduling strategy and multi-resource technology, applied in the Internet field, can solve problems such as increasing the difficulty of scheduling algorithms and failure of critical path methods

Active Publication Date: 2016-03-09
TSINGHUA UNIV
View PDF3 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The limitation of multiple resources will lead to the failure of traditional solution methods, such as the critical path method (CPM for short), whic

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multiple-resource partial order scheduling policy
  • Multiple-resource partial order scheduling policy
  • Multiple-resource partial order scheduling policy

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The implementation of the present invention will be described in detail below in conjunction with the drawings and examples.

[0046] Aiming at the above multi-resource partial order task scheduling problem, the present invention proposes a strategy based on master control resource priority (DRP for short).

[0047] 1. Multi-resource POTS model

[0048] Assuming that T is the set of all tasks, each task i∈T can be decomposed into a series of subtasks (i, j). Consider a finite set R of resource types, let c r is the capacity of resource r∈R. For a subtask (i, j), its resource requirements can be defined as If satisfied then the resource Called the master resource of subtask (i,j). Accordingly, define and Respectively, the capacity of the main control resource of the subtask (i, j) and the demand for the main control resource. For a subtask (i, j), its predecessor set and successor set are defined as and

[0049] For a subtask (i, j), the task start tim...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention provides a multi-resource partial order scheduling policy. A large number of tasks with a multi-resource demand and a complicated structure exist in NFV, and in actual task scheduling, task scheduling completion time affects user experience; traditional scheduling mostly focuses on stream scheduling study, and is incapable of considering a task structure, however, when a task has a partial order structure, the stream scheduling cannot ensure task scheduling time to be optimized; according to the multi-resource partial order scheduling policy provided by the present invention, in an NFV network architecture, a multi-resource task scheduling problem based on a partial order structure is formalized into a model of the multi-resource task scheduling problem based on the partial order structure; and a policy of simultaneously optimizing average and tail scheduling time is provided, and according to the policy, a task scheduling order is determined in a dominant resource priority (DRP) based mode, and resources are allocated with a maximum utilization allocation (MUA) method; and the DRP policy involved in the present invention has polynomial time complexity, a resource utilization rate close to 100%, and excellent fairness.

Description

technical field [0001] The invention relates to the technical field of the Internet, is particularly suitable for new architecture environments such as NFV (including SDN), and relates to a multi-resource partial order scheduling strategy. Background technique [0002] Whether it is NFV, SDN, cloud computing, or data center, tasks play a very important role. The so-called task refers to the smallest application unit from the user sending a request to the final response, which is equivalent to an application instance response. For example, in an NFV network, the NFV infrastructure (referred to as NFVI) abstracts hardware into a series of virtual resources, and the virtual network function (referred to as VNF) forms a service chain according to different task requirements. As an NFV orchestrator with a global perspective, it will manage these services in a unified manner, and optimize each task that needs to be scheduled by making full use of these virtual resources as much a...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F9/48G06F9/50
CPCG06F9/4881G06F9/5038G06F2209/504
Inventor 崔勇张朝昆吴建平鄂金龙
Owner TSINGHUA UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap