A Dynamic Partitioning Strategy for Computing Tasks

A technology of dynamic partitioning and computing tasks, which is applied in the Internet field, can solve problems such as the impossibility of computing partition task uploads, and achieve the effect of low time complexity and optimal scheduling time

Active Publication Date: 2021-03-16
TSINGHUA UNIV
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This means that it is impossible to upload all computing partition tasks to the service device for computing

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
  • A Dynamic Partitioning Strategy for Computing Tasks
  • A Dynamic Partitioning Strategy for Computing Tasks
  • A Dynamic Partitioning Strategy for Computing Tasks

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0034] The present invention first carries out modeling, is called M2CP, and its system architecture is as follows figure 1 shown. Then the CP algorithm and the EFS2 algorithm are proposed for two special partition task structures - chain structure and parallel structure. Finally, the DPA algorithm is proposed for the task of general undirected and acyclic structure. This algorithm dynamically divides the tasks to form a chain structure and parallel structure, and call their respective algorithms to complete the task calculation.

[0035] 1. M2CP modeling

[0036] Assume that all tasks form a directed acyclic graph G=(V,A), where V is defined as a node set, and A is defined as a task relationship arc. Each node i ∈ V. Each i ∈ V represents a computing partition task whose demand is defined as p i ,i∈V. An arc a=({a|i,j∈V,a∈A}) represents a...

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 invention relates to a computing task dynamic partition strategy, and belongs to the technical field of Internet. For mobile augmented reality, in the environment of the coordination of surrounding equipment, computing partition is dynamically determined according to a realistic network situation and a resource utilization situation of the equipment at the two ends, part tasks are uploaded tothe surrounding equipment with limited resources to be processed, whether or not data is transmitted via a network is determined on the basis of processing results according to all positions of subsequent tasks, finally all the results return to a mobile equipment end to be displayed, and accordingly time delay of a mobile application MAR is effectively reduced. According to the computing task dynamic partition strategy, a method dynamically determining the computing partition is formalized to be an M2CP problem, a polynomial time CP algorithm and an EFS2 algorithm are adopted respectively tosolve tasks of a chain data structure and a parallel data structure, a polynomial time DPA algorithm is adopted for data of a normal structure, the tasks are dynamically divided into a chain structureand a parallel structure, and then the final dynamic partition is completed by calling the CP algorithm and the EFS2 algorithm respectively.

Description

technical field [0001] The invention belongs to the technical field of the Internet, is particularly suitable for new system architecture environments such as mobile phone enhanced applications, and specifically relates to a dynamic partitioning strategy for computing tasks. Background technique [0002] Mobile augmented reality (Mobile Augmented Reality, referred to as MAR) has attracted more and more attention, and has become one of the important technologies of smart phones and wearable application devices in recent years. However, mobile AR applications face enormous challenges. On the one hand, these applications are time sensitive. Some virtual objects are context-sensitive. Long modeling times and the time required to render virtual objects make time-sensitive augmented reality applications unusable. On the other hand, algorithms such as machine learning are often used to build virtual objects. Since these algorithms need to extract and mine large amounts of infor...

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): G06F9/50
CPCG06F9/5027
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