Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Scheduling method and server based on co-direction flow

A scheduling method and co-directional flow technology, applied in co-directional flow-based scheduling and server fields, can solve problems such as performance impact and network flow error identification.

Active Publication Date: 2019-10-29
GUANGZHOU HKUST FOK YING TUNG RES INST
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Since 17% of the large unidirectional flow generates 99% of the network traffic, the network flow in the 83% of the small unidirectional flow is easily misidentified as the large unidirectional flow, thereby affecting performance

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
  • Scheduling method and server based on co-direction flow
  • Scheduling method and server based on co-direction flow
  • Scheduling method and server based on co-direction flow

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0060] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings.

[0061] like image 3 Shown is an embodiment of the present invention. In this embodiment, a network flow-based scheduling method of the present invention includes:

[0062] S1: Extend each co-direction flow according to a predetermined condition to obtain a corresponding extended co-direction flow, where at least two of the extended co-direction flows contain the same network flow;

[0063] S3: performing priority sorting on the extended co-direction flow;

[0064] S4: Execute scheduling in the order of the sorted extended co-directed flows, wherein the network flows included in the multiple extended co-directed flows are not scheduled after being scheduled with the extended co-directed flow with the highest priority among the multiple extended co-directed flows...

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

An embodiment of the invention discloses a scheduling method based on a co-current flow. The method comprises the steps of 1, expanding each co-current flow according to a preset condition, and obtaining corresponding expanded co-current flows, wherein at least two expanded co-current flows in the expanded co-current flows comprise same network flows; 2, performing priority sequencing on the network flows in the expanded co-current flow; 3, performing priority sequencing on the expanded co-current flows; and 4, performing scheduling according to the sequence of the expanded co-current flows after sequencing, wherein the network flow which is included in a plurality of expanded co-current flows is not scheduled along with other expanded co-current flows in the plurality of expanded co-current flows after being scheduled along with the expanded co-current flow with highest priority in the plurality of expanded co-current flows. Correspondingly, the embodiment of the invention further discloses a server. Through application of the scheduling method and the server, an effect caused by an identification error in a co-current flow clustering process can be reduced.

Description

technical field [0001] The invention relates to the communication field, in particular to a scheduling method based on codirectional flow and a server. Background technique [0002] Unlike traditional flow abstractions, coflow (coflow) captures the collection of network flows between two sets of machines in successive stages of computation, where the communication stage ends when all flows are complete. Coflow can also be simply defined as network traffic generated by the same computing task. A growing body of literature demonstrates that exploiting application-level requirements using coflow (coflow) can significantly improve application-level communication in parallel data clusters. [0003] Annotation or identification of co-flows cannot guarantee 100% accuracy, and the process of annotating / identifying co-flows sometimes mistakenly identifies the co-flow that a network flow should belong to as another co-flow. However, the existing co-flow scheduling algorithms are ext...

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
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/863H04L12/801
CPCH04L47/10H04L47/52H04L47/622
Inventor 陈凯张弘陈力
Owner GUANGZHOU HKUST FOK YING TUNG RES INST
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com