CN106155798A - The online image conversion programing system calculated based on moving distributing - Google Patents
The online image conversion programing system calculated based on moving distributing Download PDFInfo
- Publication number
- CN106155798A CN106155798A CN201610626218.7A CN201610626218A CN106155798A CN 106155798 A CN106155798 A CN 106155798A CN 201610626218 A CN201610626218 A CN 201610626218A CN 106155798 A CN106155798 A CN 106155798A
- Authority
- CN
- China
- Prior art keywords
- mobile phone
- task
- calculating
- processing unit
- micro
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
- G06F9/5088—Techniques for rebalancing the load in a distributed system involving task migration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5017—Task decomposition
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of online image conversion programing system calculated based on moving distributing, including being arranged on graphics edition unit, processing unit and the communication unit of mobile terminal and being arranged on the data processing unit of remote server；Described graphics edition unit includes that graphics edition region and storage represent the graphics element base of the graph block of certain logic statement；During work, pulling described graph block and form graph block sequence to the combination of graphics edition area arrangement from described pictorial element storehouse, described graph block sequence has specific code implication；The code implication that graph block sequence described in processing unit collection represents, sends the data processing unit to remote server by described communication unit by implication.
Description
Technical field
The present invention relates to a kind of online image conversion programing system calculated based on moving distributing.Relate to Patent classificating number
The transmission of H04 electrical communication technology H04L digital information, such as telegraph communication H04L29/00H04L 1/00 to H04L 27/00 is single
Device, equipment, circuit and the system H04L29/02 Control on Communication not comprised in individual group；Communication process H04L29/06 with agreement is
The H04L29/08 transmission control procedure of feature, such as data link level control procedure.
Background technology
Relative to the almost sluggish slow development in recent years of domestic desktop level processor, at the reduced instruction set computer of mobile terminal
The disposal ability of reason device has had the gap of the disposal ability of significant progress, simple Floating-point Computation ability and desktop processor
Through foreshortening to 2-3.
Remove outside the great-leap-forward development of processor and graphic process unit, the such as internal memory, memory space of intelligent terminal with
And the performance such as power supply, heat-sinking capability has caught up with and has exceeded desktop system, and systems soft ware is exerted manufacturer is insistent
Under power, the requirement to system is also constantly reducing.The performance of cell phone system software is needed by the development speed of hardware generally
Ask, define performance redundancy.
Summary of the invention
The problem existed according to prior art, the invention discloses a kind of online image conversion calculated based on moving distributing
Programing system, including being arranged on graphics edition unit, processing unit and the communication unit of mobile terminal and being arranged on remotely clothes
The data processing unit of business device；
Described graphics edition unit includes that graphics edition region and storage represent the figure of the graph block of certain logic statement
Shape element database；
During work, from described pictorial element storehouse, pull described graph block formed to the combination of graphics edition area arrangement
Graph block sequence, described graph block sequence has specific code implication；
The code implication that graph block sequence described in processing unit collection represents, is sent out implication by described communication unit
Deliver to the data processing unit in remote server；
The described code implication described in data processing unit analysis, decomposes the processor active task of code, sends extremely
The specific mobile terminal of particular range, is carried out the calculating of task resolution by mobile terminal and result of calculation is back to described remote
The data processing unit of journey server, data processing unit, after collecting, generate final operation result, and computing is also tied by storage
Fruit sends the mobile terminal to editing graph, completes image conversion and becomes.
As preferred embodiment, described data processing unit uses Distributed Queuing Service method Real-time Collection system
The calculating mission bit stream that the configuration information of the non-programmed task mobile phone registered in system and programmed tasks mobile phone are uploaded: the position to mobile phone
Put stream data and be sampled the historical act region of storage formation mobile phone；
The type of the calculating task of Task-decomposing and the delivery condition of system mobile phone are to mobile phone and the task of calculating as required
Information is screened: by the configuration information of same type and concentrate arrangement respectively, simultaneously to the calculating mission bit stream of type
The mobile phone arranged and calculating mission bit stream is concentrated to carry out real-time update；
Each mobile phone task type data set is carried out micro-cluster: in the time window set, use clustering algorithm pair
Each mobile phone task type data set above-mentioned is clustered by distance, makes each mobile phone task type data set produce multiple
Micro-bunch；
Calculate matching scheme for each micro-bunch: in the time window pre-set, micro-bunch of described employing is evolved
Algorithm carries out mobile phone task supply-demand mode Combinatorial Optimization to it, forms mobile phone task matching scheme and preserves.
Further, each mobile phone task type data set is carried out micro-cluster concrete in the following way: initial
Change micro-bunch
At initial time, for each VCtypeIt is individual the most micro-that data set uses clustering algorithm based on distance to form q
Bunch, q is to specify during clustering algorithm initialization, and
Q=μ * | VCtype|
Wherein 0 ＜ μ ＜ 0.25, | VCtype| for mobile phone task type data set VCtypeScale, use M1...MqRepresent
Whole q in a certain moment micro-bunch；
Further, matching scheme is calculated for each micro-bunch, the most in the following way: set up mobile phone task
Join model: if certain micro-bunch of MpIn have K (k=1,2,3 ... .K) individual mobile phone and I (i=1,2 ..., I) individual calculating task data, by institute
There is coupling xkiOne that matrix V CM is mobile phone task matching problem solution of composition.
The matching scheme of each row vector of VCM each mobile phone corresponding, each calculating corresponding of each column vector is appointed
The matching scheme of business decomposition demand, wherein
Mobile phone task coupling Combinatorial Optimization mathematical model is
Max Z=w1R+w2(C+1)-1 (2)
Meet following constraints simultaneously:
Limit each calculating Task-decomposing demand and at most have MIIndividual coupling
Mobile phone；
Limit each mobile phone and at most mate MKIndividual calculating Task-decomposing demand；
Require all of calculating Task-decomposing demand that each mobile phone mates
Total computational task weight be less than gbk；
To the calculating task weight in each scheme that each mobile phone is recommended both less than
The load-carrying of Task-decomposing mobile phone；
Wherein i=1,2 ..., I, k=1,2 ..., K
The Task-decomposing ability of the most each mobile phone is bk, each calculating mission requirements are di, w1And w2For information resources profit
With rate R and the preference of overall matching cost C two indices, and w1+w2=1, wherein the calculating of information resources utilization rate R is public
Formula is:
C is overall matching cost, and under conditions of only considering distance costs, the computing formula of C is
By using technique scheme, a kind of online image conversion calculated based on moving distributing disclosed by the invention is compiled
Journey system, by by but the multiplexed transport that creates of mobile phone decompose to server, system the task after decomposing is sent out
Deliver to the mobile phone in the range of specific region and carry out Distributed Calculation, greatly improve the utilization ratio of idle mobile phone, for extension
The operational performance of mobile phone opens new path.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present application or technical scheme of the prior art, below will be to embodiment or existing
In having technology to describe, the required accompanying drawing used is briefly described, it should be apparent that, the accompanying drawing in describing below is only this
Some embodiments described in application, for those of ordinary skill in the art, on the premise of not paying creative work,
Other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the system module figure of the present invention
Detailed description of the invention
For making technical scheme and advantage clearer, below in conjunction with the accompanying drawing in the embodiment of the present invention, to this
Technical scheme in inventive embodiments carries out the most complete description:
Embodiment:
A kind of online image conversion programing system calculated based on moving distributing as shown in Figure 1, including being arranged on movement
Graphics edition unit, processing unit and the communication unit of terminal and be arranged on the data processing unit of remote server；
Described graphics edition unit includes that graphics edition region and storage represent the figure of the graph block of certain logic statement
Shape element database；
During work, from described pictorial element storehouse, pull described graph block formed to the combination of graphics edition area arrangement
Graph block sequence, described graph block sequence has specific code implication；
Rely on the hardware handles software translating task of self in view of mobile phone, substantial amounts of handset capability can be taken, cause hands
Machine probably due to processor stuck causing cannot normally use, as preferred embodiment,
The code implication that graph block sequence described in processing unit collection represents, is sent out implication by described communication unit
Deliver to the data processing unit in remote server.
The described code implication described in data processing unit analysis, decomposes the processor active task of code, sends extremely
The specific mobile terminal of particular range, is carried out the calculating of task resolution by mobile terminal and result of calculation is back to described remote
The data processing unit of journey server, data processing unit, after collecting, generate final operation result, and computing is also tied by storage
Fruit sends the mobile terminal to editing graph, completes image conversion and becomes.
The non-programmed that described data processing unit is registered in using Distributed Queuing Service method real-time acquisition system is appointed
The calculating mission bit stream that the configuration information of business mobile phone and programmed tasks mobile phone are uploaded: the position stream data of mobile phone is sampled
Storage forms the historical act region of mobile phone；
The type of the calculating task of Task-decomposing and the delivery condition of system mobile phone are to mobile phone and the task of calculating as required
Information is screened: by the configuration information of same type and concentrate arrangement respectively, simultaneously to the calculating mission bit stream of type
The mobile phone arranged and calculating mission bit stream is concentrated to carry out real-time update；
Each mobile phone task type data set is carried out micro-cluster: in the time window set, use clustering algorithm pair
Each mobile phone task type data set above-mentioned is clustered by distance, makes each mobile phone task type data set produce multiple
Micro-bunch；
Calculate matching scheme for each micro-bunch: in the time window pre-set, micro-bunch of described employing is evolved
Algorithm carries out mobile phone task supply-demand mode Combinatorial Optimization to it, forms mobile phone task matching scheme and preserves.
Further, each mobile phone task type data set is carried out micro-cluster concrete in the following way: initial
Change micro-bunch
At initial time, for each VCtypeIt is individual the most micro-that data set uses clustering algorithm based on distance to form q
Bunch, q is to specify during clustering algorithm initialization, and
Q=μ * | VCtype|
Wherein 0 ＜ μ ＜ 0.25, | VCtype| for mobile phone task type data set VCtypeScale, use M1...MqRepresent
Whole q in a certain moment micro-bunch；
As preferred embodiment, calculate matching scheme for each micro-bunch, the most in the following way: set up hands
Machine task Matching Model: if certain micro-bunch of MpIn have K (k=1,2,3 ... .K) individual mobile phone and I (i=1,2 ..., I) individual calculating task
Data, by all coupling xkiOne that matrix V CM is mobile phone task matching problem solution of composition.
The matching scheme of each row vector of VCM each mobile phone corresponding, each calculating corresponding of each column vector is appointed
The matching scheme of business decomposition demand, wherein
Mobile phone task coupling Combinatorial Optimization mathematical model is
Max Z=w1R+w2(C+1)-1 (2)
Meet following constraints simultaneously:
Limit each calculating Task-decomposing demand and at most have MIIndividual
Tennis partner's machine；
Limit each mobile phone and at most mate MKIndividual calculating Task-decomposing demand；
Require all of calculating Task-decomposing demand that each mobile phone mates
Total computational task weight be less than gbk；
To the calculating task weight in each scheme that each mobile phone is recommended both less than
The load-carrying of Task-decomposing mobile phone；
Wherein i=1,2 ..., I, k=1,2 ..., K
The Task-decomposing ability of the most each mobile phone is bk, each calculating mission requirements are di, w1And w2For information resources profit
With rate R and the preference of overall matching cost C two indices, and w1+w2=1, wherein the calculating of information resources utilization rate R is public
Formula is:
C is overall matching cost, and under conditions of only considering distance costs, the computing formula of C is.
The above, the only present invention preferably detailed description of the invention, but protection scope of the present invention is not limited thereto,
Any those familiar with the art in the technical scope that the invention discloses, according to technical scheme and
Inventive concept equivalent or change in addition, all should contain within protection scope of the present invention.
Claims (4)
1. the online image conversion programing system calculated based on moving distributing, it is characterised in that include being arranged on mobile terminal
Graphics edition unit, processing unit and communication unit and be arranged on the data processing unit of remote server；
Described graphics edition unit includes that graphics edition region and storage represent the pattern primitive of the graph block of certain logic statement
Element storehouse；
During work, from described pictorial element storehouse, pull described graph block form figure to the combination of graphics edition area arrangement
Block sequence, described graph block sequence has specific code implication；
The code implication that graph block sequence described in processing unit collection represents, is sent implication extremely by described communication unit
Data processing unit in remote server；
The described code implication described in data processing unit analysis, decomposes the processor active task of code, sends to the most specific
The specific mobile terminal of scope, is carried out the calculating of task resolution by mobile terminal and result of calculation is back to described long-range clothes
The data processing unit of business device, data processing unit, after collecting, generate final operation result, and operation result is also sent out by storage
Deliver to the mobile terminal of editing graph, complete image conversion and become.
The online image conversion programing system calculated based on moving distributing the most according to claim 1, is further characterized in that
The non-programmed task mobile phone that described data processing unit is registered in using Distributed Queuing Service method real-time acquisition system
The calculating mission bit stream that configuration information and programmed tasks mobile phone are uploaded: the position stream data of mobile phone is sampled storage formation
The historical act region of mobile phone；
The type of the calculating task of Task-decomposing and the delivery condition of system mobile phone to mobile phone and calculate mission bit stream as required
Screen: by the configuration information of same type and concentrate arrangement respectively, simultaneously to having concentrated with the calculating mission bit stream of type
The mobile phone and the calculating mission bit stream that arrange carry out real-time update；
Each mobile phone task type data set is carried out micro-cluster: use clustering algorithm to above-mentioned in the time window set
Each mobile phone task type data set is clustered by distance, makes each mobile phone task type data set produce multiple micro-
Bunch；
Matching scheme is calculated: in the time window pre-set, to micro-bunch of described employing evolution algorithm for each micro-bunch
It is carried out mobile phone task supply-demand mode Combinatorial Optimization, forms mobile phone task matching scheme and preserve.
The online image conversion programing system calculated based on moving distributing the most according to claim 2, is further characterized in that:
Each mobile phone task type data set is carried out micro-cluster concrete in the following way: initialize micro-bunch
At initial time, for each VCtypeData set uses clustering algorithm based on distance to form q the most micro-bunch, and q is
Specify when clustering algorithm initializes, and
Q=μ * | VCtype|
Wherein 0 ＜ μ ＜ 0.25, | VCtype| for mobile phone task type data set VCtypeScale, use M1...MqRepresent that certain is for the moment
Whole q micro-bunch carved.
The online image conversion programing system calculated based on moving distributing the most according to claim 3, is further characterized in that:
Matching scheme is calculated, the most in the following way: set up mobile phone task Matching Model for each micro-bunch: if certain micro-bunch of MpIn
Have K (k=1,2,3 ... .K) individual mobile phone and I (i=1,2 ..., I) individual calculating task data, by all coupling xkiThe matrix of composition
VCM is a solution of mobile phone task matching problem.
The matching scheme of each row vector of VCM each mobile phone corresponding, each column vector each calculating task corresponding is divided
The matching scheme of solution demand, wherein
Mobile phone task coupling Combinatorial Optimization mathematical model is
Max Z=w1R+w2(C+1)-1 (2)
Meet following constraints simultaneously:
Limit each calculating Task-decomposing demand and at most have MIIndividual coupling hands
Machine；
Limit each mobile phone and at most mate MKIndividual calculating Task-decomposing demand；
Require the overall of all of calculating Task-decomposing demand that each mobile phone mates
Calculating task weight is less than gbk；
It is both less than task to the calculating task weight in each scheme that each mobile phone is recommended
Decompose the load-carrying of mobile phone；
Wherein i=1,2 ..., I, k=1,2 ..., K
The Task-decomposing ability of the most each mobile phone is bk, each calculating mission requirements are di, w1And w2For information resources utilization rate R
With the preference of overall matching cost C two indices, and w1+w2=1, wherein the computing formula of information resources utilization rate R is:
C is overall matching cost, and under conditions of only considering distance costs, the computing formula of C is.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610626218.7A CN106155798A (en) | 2016-08-02 | 2016-08-02 | The online image conversion programing system calculated based on moving distributing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610626218.7A CN106155798A (en) | 2016-08-02 | 2016-08-02 | The online image conversion programing system calculated based on moving distributing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106155798A true CN106155798A (en) | 2016-11-23 |
Family
ID=57328558
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610626218.7A Pending CN106155798A (en) | 2016-08-02 | 2016-08-02 | The online image conversion programing system calculated based on moving distributing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106155798A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101505481A (en) * | 2008-02-05 | 2009-08-12 | 天宝导航有限公司 | Resource scheduling apparatus and method |
| CN103164287A (en) * | 2013-03-22 | 2013-06-19 | 河海大学 | Distributed-type parallel computing platform system based on Web dynamic participation |
| CN103473121A (en) * | 2013-08-20 | 2013-12-25 | 西安电子科技大学 | Mass image parallel processing method based on cloud computing platform |
| CN105205169A (en) * | 2015-10-12 | 2015-12-30 | 中国电子科技集团公司第二十八研究所 | Distributed image index and retrieval method |
| CN105511860A (en) * | 2015-11-30 | 2016-04-20 | 大连文森特软件科技有限公司 | On-line graphical programming system |
| CN105786600A (en) * | 2016-02-02 | 2016-07-20 | 北京京东尚科信息技术有限公司 | Task scheduling method and device |
-
2016
- 2016-08-02 CN CN201610626218.7A patent/CN106155798A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101505481A (en) * | 2008-02-05 | 2009-08-12 | 天宝导航有限公司 | Resource scheduling apparatus and method |
| CN103164287A (en) * | 2013-03-22 | 2013-06-19 | 河海大学 | Distributed-type parallel computing platform system based on Web dynamic participation |
| CN103473121A (en) * | 2013-08-20 | 2013-12-25 | 西安电子科技大学 | Mass image parallel processing method based on cloud computing platform |
| CN105205169A (en) * | 2015-10-12 | 2015-12-30 | 中国电子科技集团公司第二十八研究所 | Distributed image index and retrieval method |
| CN105511860A (en) * | 2015-11-30 | 2016-04-20 | 大连文森特软件科技有限公司 | On-line graphical programming system |
| CN105786600A (en) * | 2016-02-02 | 2016-07-20 | 北京京东尚科信息技术有限公司 | Task scheduling method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101973031B (en) | Cloud robot system and implementation method | |
| CN110046865B (en) | Distributed inventory scheduling method | |
| CN107879206B (en) | Elevator scheduling method, device, equipment and storage medium | |
| CN113505882B (en) | Data processing method based on federal neural network model, related equipment and medium | |
| Ghavamzadeh et al. | Learning to communicate and act using hierarchical reinforcement learning | |
| CN109165741A (en) | Processing method, device, storage medium and the electronic device of quantum wire | |
| CN106062786A (en) | Computing system for training neural networks | |
| CN102300012A (en) | One-to-one matching in contact center | |
| CN109408500A (en) | Artificial intelligence operation platform | |
| CN110058934A (en) | A method of it is calculated in extensive cloud and mist and formulates OPTIMAL TASK unloading decision in environment | |
| CN107809490A (en) | The data transmission method of intelligent ship and its information management and control system, device | |
| CN108259078A (en) | A kind of resource allocation methods and system for Integrated Electronic System on star | |
| CN104536831B (en) | A kind of multinuclear SoC software image methods based on multiple-objection optimization | |
| CN117040594A (en) | Internet remote sensing satellite real-time service system oriented to mobile terminal user | |
| CN116362327A (en) | Model training method and system and electronic equipment | |
| CN106407001A (en) | Graphical editing system based on region matching algorithm | |
| CN108009089A (en) | A kind of increment machine learning method and system based on lucidification disposal | |
| CN106302657A (en) | Inline graphics game making system based on Distributed Calculation | |
| CN106155798A (en) | The online image conversion programing system calculated based on moving distributing | |
| CN105446203A (en) | Robot power control method and system | |
| Zhou | Uncapacitated facility layout problem with stochastic demands | |
| Zhang et al. | A hybrid discrete particle swarm optimization for satellite scheduling problem | |
| CN106254454A (en) | The inline graphics online literature editing system calculated based on moving distributing | |
| CN103324251B (en) | The task scheduling optimization method of satellite-borne data transmission system | |
| CN113742778B (en) | Distributed machine learning method and system based on federal learning and ALQ compression |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20161123 |