CN105224379A - The image processing method that a kind of many-one based on virtual machine accesses - Google Patents

The image processing method that a kind of many-one based on virtual machine accesses Download PDF

Info

Publication number
CN105224379A
CN105224379A CN201410225466.1A CN201410225466A CN105224379A CN 105224379 A CN105224379 A CN 105224379A CN 201410225466 A CN201410225466 A CN 201410225466A CN 105224379 A CN105224379 A CN 105224379A
Authority
CN
China
Prior art keywords
subgraph
virtual machine
client
uniform service
buffer area
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.)
Granted
Application number
CN201410225466.1A
Other languages
Chinese (zh)
Other versions
CN105224379B (en
Inventor
杨耀敏
曲维杰
易乐天
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Yun Chao Artery Science And Technology Ltd
Original Assignee
Beijing Yun Chao Artery Science And Technology Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Yun Chao Artery Science And Technology Ltd filed Critical Beijing Yun Chao Artery Science And Technology Ltd
Priority to CN201410225466.1A priority Critical patent/CN105224379B/en
Publication of CN105224379A publication Critical patent/CN105224379A/en
Application granted granted Critical
Publication of CN105224379B publication Critical patent/CN105224379B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Information Transfer Between Computers (AREA)

Abstract

The invention provides the image processing method that a kind of many-one based on virtual machine accesses, comprising: on the server, create simulator and virtual machine uniform service distributor, some client access of virtual machine uniform service distributors; Virtual machine uniform service distributor is that the client of each access all sets up buffer zone I, for storing No. ID, the subgraph being issued to corresponding client; Meanwhile, buffer zone h is set up in each client this locality, and for storing the subgraph received, by cache maintenance mechanism, No. ID that stores in guarantee buffer zone I completely corresponding with the subgraph stored in the h of buffer zone; When needs issue subgraph C to client, judge whether in the I of buffer zone, there is No. ID, this figure, as existed, then only need issue No. ID, figure, and not need subgraph C to issue; Client can obtain this figure No. ID corresponding subgraph by searching buffer zone h, and is shown to screen correspondence position, thus saves network traffic flow, improves the speed that subgraph issues.

Description

The image processing method that a kind of many-one based on virtual machine accesses
Technical field
The invention belongs to technical field of the computer network, be specifically related to the image processing method that a kind of many-one based on virtual machine accesses.
Background technology
Along with the popularization of virtual machine application, the demand of multiple client's side link same virtual machine also occurs thereupon, such as: monitoring, playing lantern slides, movie etc.
For playing lantern slides, such as, 5 client's side link are to same virtual machine, if need to play 100 lantern slides in order, its disposal route adopted is: while virtual machine plays the 1st lantern slide, 1st lantern slide is issued to 5 clients respectively by network, then 5 clients show the image of the 1st lantern slide respectively; Then, while virtual machine plays the 2nd lantern slide, the 2nd lantern slide is issued to 5 clients respectively by network, then 5 clients show the image of the 2nd lantern slide respectively; The rest may be inferred, while virtual machine plays the 100th lantern slide, the 100th lantern slide is issued to 5 clients respectively by network, then 5 clients show the image of the 100th lantern slide respectively.As can be seen here, virtual machine needs to issue 100 lantern slides by network respectively to 5 clients, could realize the result of the virtual machine that 5 clients viewing virtual machines are play, and has that volume of transmitted data is large, the network bandwidth takies serious problem; And, because the usual occupied bandwidth of screen picture is comparatively large, also there is the screen picture problem that transmission speed is slower in a network, and then affect the viewing experience of client.
Summary of the invention
For the defect that prior art exists, the invention provides the image processing method that a kind of many-one based on virtual machine accesses, in order to solve the problem.
The technical solution used in the present invention is as follows:
The invention provides the image processing method that a kind of many-one based on virtual machine accesses, comprise the following steps:
S1, on the server, by simulator QEMU virtualizing operating systems, generates a virtual machine;
On described server, also create virtual machine uniform service distributor VueServer, some clients access described virtual machine uniform service distributor;
S2, after initialization, when described simulator receives the 1st screen picture A, screen picture A described in described simulator cutting, obtain several subgraphs C, then by each Zhang Zitu C and each Zhang Zitu C, the coordinate figure on screen all sends to described virtual machine uniform service distributor; In subsequent process, when described simulator receives n-th screen picture Y, described simulator knows the renewal part of n-th screen picture Y relative to (n-1)th screen picture Z, and using described renewal part as subgraph C, then by this subgraph C and this subgraph C, the coordinate figure on screen sends to described virtual machine uniform service distributor; Wherein, n >=2; Described screen picture is the image that whole screen shows;
S3, described virtual machine uniform service distributor generates corresponding No. ID, figure unique with described subgraph C based on preset algorithm; Wherein, No. ID, described figure is relevant to figure attribute;
S4, at server end, for each client all sets up a unique corresponding buffer area; Each client this locality is also configured with a buffer area;
Described virtual machine uniform service distributor processes each buffer area according to the following steps:
S41, for client I, if described virtual machine uniform service distributor sets up the buffer area I corresponding with client I at server end, described client I this locality is also configured with buffer area h;
During initialization, described buffer area h is empty, and described client I uploads total spatial cache value of described buffer area h to described virtual machine uniform service distributor; Described virtual machine uniform service distributor arranges remaining cache space variable K, and makes the initial value of variable K be total spatial cache value of buffer area h;
Described virtual machine uniform service distributor reads described buffer area I, judges whether there be No. ID identical with No. ID, the figure calculated in S3 in described buffer area I, if existed, then performs S42-S43; If there is no, then S44 is performed;
S42, described virtual machine uniform service distributor sends update instruction to described client I, and wherein, this update instruction carries No. ID, the figure needing to upgrade and the coordinate w of figure on screen needing renewal; Meanwhile, described virtual machine uniform service distributor not more new variables K value;
S43, when described client I receives described update instruction, based on the buffer area h that No. ID, described figure searches self configuration, obtains the subgraph C corresponding with No. ID, described figure, and is subgraph C by the screen coordinate w location updating of current display;
S44, described virtual machine uniform service distributor reads variable K value; Then whether judgment variable K value is greater than the byte number of described subgraph C; If be greater than, then perform S45-S46; If be less than, then perform S47;
S45, No. ID, the figure of described subgraph C is stored into described buffer area I by described virtual machine uniform service distributor; Wherein, No. ID, each figure all binds the byte number of corresponding subgraph C; Then, described virtual machine uniform service distributor sends update instruction and cache instruction to described client I; Wherein, this update instruction carries the subgraph C needing to upgrade and the coordinate w of subgraph C on screen needing renewal; Described cache instruction refers to: notify subgraph C described in described client I local cache; Meanwhile, described virtual machine uniform service distributor more new variables K value, the variable K value after renewal deducts the byte number of subgraph C for current variable K value;
S46, when described client I receives described update instruction and cache instruction, is stored into the buffer area h of self configuration, and is subgraph C by the screen coordinate w location updating of current display by described subgraph C;
S47, described virtual machine uniform service distributor judges whether the buffer area h that described client I self configures is dummy status further, if judged result is yes, then sends update instruction to described client I and does not carry out cache instruction; Wherein, this update instruction carries the subgraph C needing to upgrade and the coordinate w of subgraph C on screen needing renewal; The described cache instruction that do not carry out refers to: the local cache h not subgraph C described in buffer memory of described client I; Meanwhile, described virtual machine uniform service distributor not more new variables K value;
When described client I receives described update instruction and do not carry out cache instruction, described subgraph C is not stored into the buffer area h of self configuration; Meanwhile, be subgraph C by the screen coordinate w location updating of current display;
If judged result is no, described virtual machine uniform service distributor reads current No. ID, the most sluggish figure from described buffer area I, then send to described client I and delete subgraph corresponding with No. ID, the most sluggish figure in buffer area h, make described client I discharge the storage space of buffer area h; Meanwhile, described virtual machine uniform service distributor more new variables K value, the variable K value after renewal deducts the byte number of subgraph corresponding to No. ID, the most sluggish figure for current variable K value;
After described client I receives this instruction, delete subgraph corresponding with No. ID, the most sluggish figure in buffer area h;
Described virtual machine uniform service distributor replaces variable K value in S44 with the variable K value after renewal, and circulation performs S44-S47.
Preferably, in S2, when described simulator receives the 1st screen picture A, described simulator, based on screen picture A described in the cutting strategy cutting preset, obtains several subgraphs C; Wherein, byte number shared by each Zhang Zitu C of obtaining for cutting of described cutting strategy is between default maximum value and default minimal value.
Preferably, in S3, described preset algorithm is Message Digest 5 MD5; By using described Message Digest 5, identical subgraph C will generate No. ID identical, figure; And not identical subgraph C will generate No. ID not identical, figure.
Beneficial effect of the present invention is as follows:
The image processing method that many-one based on virtual machine provided by the invention accesses, effectively can improve the downloading speed of screen picture, improves the Experience Degree of client viewing screen picture.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the image processing method that the many-one based on virtual machine provided by the invention accesses.
Embodiment
Below in conjunction with accompanying drawing, the present invention is described in detail:
As shown in Figure 1, the invention provides the image processing method that a kind of many-one based on virtual machine accesses, comprise the following steps:
S1, on the server, by simulator QEMU virtualizing operating systems, generates a virtual machine;
On described server, also create virtual machine uniform service distributor VueServer, some clients access described virtual machine uniform service distributor;
S2, after initialization, when described simulator receives the 1st screen picture A, screen picture A described in described simulator cutting, obtain several subgraphs C, shared by each Zhang Zitu C that cutting strategy obtains for cutting, byte number is between default maximum value and default minimal value.Then by each Zhang Zitu C and each Zhang Zitu C, the coordinate figure on screen all sends to described virtual machine uniform service distributor; In subsequent process, when described simulator receives n-th screen picture Y, described simulator knows the renewal part of n-th screen picture Y relative to (n-1)th screen picture Z, and using described renewal part as subgraph C, then by this subgraph C and this subgraph C, the coordinate figure on screen sends to described virtual machine uniform service distributor; Wherein, n >=2; Described screen picture is the image that whole screen shows;
S3, described virtual machine uniform service distributor generates corresponding No. ID, figure unique with described subgraph C based on preset algorithm; Wherein, No. ID, described figure is relevant to figure attribute; Such as, preset algorithm is Message Digest 5 MD5; By using Message Digest 5, identical subgraph C will generate No. ID identical, figure; And not identical subgraph C will generate No. ID not identical, figure.Thus achieve and identify by No. ID, figure the object whether several subgraphs C is identical.
S4, at server end, for each client all sets up a unique corresponding buffer area; Each client this locality is also configured with a buffer area;
Described virtual machine uniform service distributor processes each buffer area according to the following steps:
S41, for client I, if described virtual machine uniform service distributor sets up the buffer area I corresponding with client I at server end, described client I this locality is also configured with buffer area h;
During initialization, described buffer area h is empty, and described client I uploads total spatial cache value of described buffer area h to described virtual machine uniform service distributor; Described virtual machine uniform service distributor arranges remaining cache space variable K, and makes the initial value of variable K be total spatial cache value of buffer area h;
Described virtual machine uniform service distributor reads described buffer area I, judges whether there be No. ID identical with No. ID, the figure calculated in S3 in described buffer area I, if existed, then performs S42-S43; If there is no, then S44 is performed;
S42, described virtual machine uniform service distributor sends update instruction to described client I, and wherein, this update instruction carries No. ID, the figure needing to upgrade and the coordinate w of figure on screen needing renewal; Meanwhile, described virtual machine uniform service distributor not more new variables K value;
S43, when described client I receives described update instruction, based on the buffer area h that No. ID, described figure searches self configuration, obtains the subgraph C corresponding with No. ID, described figure, and is subgraph C by the screen coordinate w location updating of current display;
S44, described virtual machine uniform service distributor reads variable K value; Then whether judgment variable K value is greater than the byte number of described subgraph C; If be greater than, then perform S45-S46; If be less than, then perform S47;
S45, No. ID, the figure of described subgraph C is stored into described buffer area I by described virtual machine uniform service distributor; Wherein, No. ID, each figure all binds the byte number of corresponding subgraph C; Then, described virtual machine uniform service distributor sends update instruction and cache instruction to described client I; Wherein, this update instruction carries the subgraph C needing to upgrade and the coordinate w of subgraph C on screen needing renewal; Described cache instruction refers to: notify subgraph C described in described client I local cache; Meanwhile, described virtual machine uniform service distributor more new variables K value, the variable K value after renewal deducts the byte number of subgraph C for current variable K value;
S46, when described client I receives described update instruction and cache instruction, is stored into the buffer area h of self configuration, and is subgraph C by the screen coordinate w location updating of current display by described subgraph C;
S47, described virtual machine uniform service distributor judges whether the buffer area h that described client I self configures is dummy status further, if judged result is yes, then sends update instruction to described client I and does not carry out cache instruction; Wherein, this update instruction carries the subgraph C needing to upgrade and the coordinate w of subgraph C on screen needing renewal; The described cache instruction that do not carry out refers to: the local cache h not subgraph C described in buffer memory of described client I; Meanwhile, described virtual machine uniform service distributor not more new variables K value; When described client I receives described update instruction and do not carry out cache instruction, described subgraph C is not stored into the buffer area h of self configuration; Meanwhile, be subgraph C by the screen coordinate w location updating of current display;
If judged result is no, described virtual machine uniform service distributor reads current No. ID, the most sluggish figure from described buffer area I, then send to described client I and delete subgraph corresponding with No. ID, the most sluggish figure in buffer area h, make described client I discharge the storage space of buffer area h; Meanwhile, described virtual machine uniform service distributor more new variables K value, the variable K value after renewal deducts the byte number of subgraph corresponding to No. ID, the most sluggish figure for current variable K value; After described client I receives this instruction, delete subgraph corresponding with No. ID, the most sluggish figure in buffer area h; Described virtual machine uniform service distributor replaces variable K value in S44 with the variable K value after renewal, and circulation performs S44-S47.
The image processing method that many-one based on virtual machine provided by the invention accesses, has the following advantages:
(1) the subgraph C of renewal part is directly sent to virtual machine uniform service distributor by simulator, do not need to arrange buffer memory between simulator and virtual machine uniform service distributor, owing to adopting the machine communication between simulator and virtual machine uniform service distributor, therefore, there is larger data throughout, make virtual machine uniform service distributor can receive the subgraph C of simulator transmission fast;
(2) multiple stage client access of virtual machine uniform service distributor, and, virtual machine uniform service distributor is that the client of each access all sets up independently buffer zone I, safeguards separately these buffer zones, and this buffer zone I is for storing No. ID of the subgraph being issued to corresponding client; Meanwhile, a buffer zone h is also set up in each client this locality, for storing the subgraph received, by cache maintenance mechanism, No. ID that can ensure to store in the I of buffer zone with the subgraph stored in the h of buffer zone complete corresponding on; Therefore, when needs issue subgraph C to client, first by searching buffer zone I, judging whether in the I of buffer zone, there is No. ID, this figure, if existed, then only needing to issue No. ID, figure, and not needing subgraph C to issue; Client can obtain subgraph corresponding to No. ID, this figure by searching buffer zone h, and is shown to screen correspondence position, thus saves network traffic flow, improves the speed that subgraph issues.
(3), in prior art, QEMUServer self configures a spatial cache, and safeguard a caching mechanism, it can only realize accessing one to one, that is: a QEMUServer can only access a client, has the deficiency of the wasting of resources.In the present invention, create a middleware VueServer, being held by QEMUServer by caching mechanism of novelty moves on to VueServer end, and by innovation caching mechanism, that is: for the client of each access all sets up independently buffer zone, realize VueServer and support the effect that multi-client connects.
The above is only the preferred embodiment of the present invention; it should be pointed out that for those skilled in the art, under the premise without departing from the principles of the invention; can also make some improvements and modifications, these improvements and modifications also should look protection scope of the present invention.

Claims (3)

1., based on the image processing method that the many-one of virtual machine accesses, it is characterized in that, comprise the following steps:
S1, on the server, by simulator QEMU virtualizing operating systems, generates a virtual machine;
On described server, also create virtual machine uniform service distributor VueServer, some clients access described virtual machine uniform service distributor;
S2, after initialization, when described simulator receives the 1st screen picture A, screen picture A described in described simulator cutting, obtain several subgraphs C, then by each Zhang Zitu C and each Zhang Zitu C, the coordinate figure on screen all sends to described virtual machine uniform service distributor; In subsequent process, when described simulator receives n-th screen picture Y, described simulator knows the renewal part of n-th screen picture Y relative to (n-1)th screen picture Z, and using described renewal part as subgraph C, then by this subgraph C and this subgraph C, the coordinate figure on screen sends to described virtual machine uniform service distributor; Wherein, n >=2; Described screen picture is the image that whole screen shows;
S3, described virtual machine uniform service distributor generates corresponding No. ID, figure unique with described subgraph C based on preset algorithm; Wherein, No. ID, described figure is relevant to figure attribute;
S4, at server end, for each client all sets up a unique corresponding buffer area; Each client this locality is also configured with a buffer area;
Described virtual machine uniform service distributor processes each buffer area according to the following steps:
S41, for client I, if described virtual machine uniform service distributor sets up the buffer area I corresponding with client I at server end, described client I this locality is also configured with buffer area h;
During initialization, described buffer area h is empty, and described client I uploads total spatial cache value of described buffer area h to described virtual machine uniform service distributor; Described virtual machine uniform service distributor arranges remaining cache space variable K, and makes the initial value of variable K be total spatial cache value of buffer area h;
Described virtual machine uniform service distributor reads described buffer area I, judges whether there be No. ID identical with No. ID, the figure calculated in S3 in described buffer area I, if existed, then performs S42-S43; If there is no, then S44 is performed;
S42, described virtual machine uniform service distributor sends update instruction to described client I, and wherein, this update instruction carries No. ID, the figure needing to upgrade and the coordinate w of figure on screen needing renewal; Meanwhile, described virtual machine uniform service distributor not more new variables K value;
S43, when described client I receives described update instruction, based on the buffer area h that No. ID, described figure searches self configuration, obtains the subgraph C corresponding with No. ID, described figure, and is subgraph C by the screen coordinate w location updating of current display;
S44, described virtual machine uniform service distributor reads variable K value; Then whether judgment variable K value is greater than the byte number of described subgraph C; If be greater than, then perform S45-S46; If be less than, then perform S47;
S45, No. ID, the figure of described subgraph C is stored into described buffer area I by described virtual machine uniform service distributor; Wherein, No. ID, each figure all binds the byte number of corresponding subgraph C; Then, described virtual machine uniform service distributor sends update instruction and cache instruction to described client I; Wherein, this update instruction carries the subgraph C needing to upgrade and the coordinate w of subgraph C on screen needing renewal; Described cache instruction refers to: notify subgraph C described in described client I local cache; Meanwhile, described virtual machine uniform service distributor more new variables K value, the variable K value after renewal deducts the byte number of subgraph C for current variable K value;
S46, when described client I receives described update instruction and cache instruction, is stored into the buffer area h of self configuration, and is subgraph C by the screen coordinate w location updating of current display by described subgraph C;
S47, described virtual machine uniform service distributor judges whether the buffer area h that described client I self configures is dummy status further, if judged result is yes, then sends update instruction to described client I and does not carry out cache instruction; Wherein, this update instruction carries the subgraph C needing to upgrade and the coordinate w of subgraph C on screen needing renewal; The described cache instruction that do not carry out refers to: the local cache h not subgraph C described in buffer memory of described client I; Meanwhile, described virtual machine uniform service distributor not more new variables K value; When described client I receives described update instruction and do not carry out cache instruction, described subgraph C is not stored into the buffer area h of self configuration; Meanwhile, be subgraph C by the screen coordinate w location updating of current display;
If judged result is no, described virtual machine uniform service distributor reads current No. ID, the most sluggish figure from described buffer area I, then send to described client I and delete subgraph corresponding with No. ID, the most sluggish figure in buffer area h, make described client I discharge the storage space of buffer area h; Meanwhile, described virtual machine uniform service distributor more new variables K value, the variable K value after renewal deducts the byte number of subgraph corresponding to No. ID, the most sluggish figure for current variable K value; After described client I receives this instruction, delete subgraph corresponding with No. ID, the most sluggish figure in buffer area h; Described virtual machine uniform service distributor replaces variable K value in S44 with the variable K value after renewal, and circulation performs S44-S47.
2. the image processing method that accesses of the many-one based on virtual machine according to claim 1, it is characterized in that, in S2, when described simulator receives the 1st screen picture A, described simulator, based on screen picture A described in the cutting strategy cutting preset, obtains several subgraphs C; Wherein, byte number shared by each Zhang Zitu C of obtaining for cutting of described cutting strategy is between default maximum value and default minimal value.
3. the image processing method that accesses of the many-one based on virtual machine according to claim 1, it is characterized in that, in S3, described preset algorithm is Message Digest 5 MD5; By using described Message Digest 5, identical subgraph C will generate No. ID identical, figure; And not identical subgraph C will generate No. ID not identical, figure.
CN201410225466.1A 2014-05-26 2014-05-26 A kind of image processing method of the many-one access based on virtual machine Expired - Fee Related CN105224379B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410225466.1A CN105224379B (en) 2014-05-26 2014-05-26 A kind of image processing method of the many-one access based on virtual machine

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410225466.1A CN105224379B (en) 2014-05-26 2014-05-26 A kind of image processing method of the many-one access based on virtual machine

Publications (2)

Publication Number Publication Date
CN105224379A true CN105224379A (en) 2016-01-06
CN105224379B CN105224379B (en) 2018-05-18

Family

ID=54993371

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410225466.1A Expired - Fee Related CN105224379B (en) 2014-05-26 2014-05-26 A kind of image processing method of the many-one access based on virtual machine

Country Status (1)

Country Link
CN (1) CN105224379B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113971070A (en) * 2021-10-28 2022-01-25 上海交通大学 Method and system suitable for multi-virtual machine one-screen display
WO2023179348A1 (en) * 2022-03-23 2023-09-28 中兴通讯股份有限公司 Data transmission method, cloud desktop virtual machine, cloud terminal, and readable storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102713848A (en) * 2009-11-25 2012-10-03 弗雷姆霍克公司 Methods for interfacing with a virtualized computing service over a network using a lightweight client
CN103810021A (en) * 2014-02-19 2014-05-21 福建升腾资讯有限公司 Virtual desktop displaying method based on host machine under VDI and system thereof

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102713848A (en) * 2009-11-25 2012-10-03 弗雷姆霍克公司 Methods for interfacing with a virtualized computing service over a network using a lightweight client
CN103810021A (en) * 2014-02-19 2014-05-21 福建升腾资讯有限公司 Virtual desktop displaying method based on host machine under VDI and system thereof

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113971070A (en) * 2021-10-28 2022-01-25 上海交通大学 Method and system suitable for multi-virtual machine one-screen display
CN113971070B (en) * 2021-10-28 2024-05-28 上海交通大学 Method and system suitable for multi-virtual machine on-screen display
WO2023179348A1 (en) * 2022-03-23 2023-09-28 中兴通讯股份有限公司 Data transmission method, cloud desktop virtual machine, cloud terminal, and readable storage medium

Also Published As

Publication number Publication date
CN105224379B (en) 2018-05-18

Similar Documents

Publication Publication Date Title
US20240001230A1 (en) Memory management in gaming rendering
CN109981493B (en) Method and device for configuring virtual machine network
CN107346307A (en) Distributed cache system and method
JP6274584B2 (en) Advertisement processing method and apparatus
US10546038B2 (en) Intelligent browser-based display tiling
CN105635196A (en) Method and system of file data obtaining, and application server
CN102739720A (en) Distributed cache server system and application method thereof, cache clients and cache server terminals
US20140025723A1 (en) Cloud storage system and data storage and sharing method based on the system
CN107197359B (en) Video file caching method and device
US9819985B2 (en) System and method to manage switching between devices
US10430304B2 (en) Communication continuation during content node failover
US20140189035A1 (en) Virtual Desktop Infrastructure (VDI) Login Acceleration
CN108055322A (en) Request message processing method and processing device
CN115794139B (en) Mirror image data processing method, device, equipment and medium
CN107864384A (en) Redirect the method and device that internet video plays on cloud desktop
US10798457B2 (en) Start-up performance improvement for remote video gaming
CN110895515A (en) Memory cache management method, multimedia server and computer storage medium
CN105530221B (en) A kind of the caching accelerated method and system of network data transmission
CN105224379A (en) The image processing method that a kind of many-one based on virtual machine accesses
CN106991057A (en) The call method and virtual platform of internal memory in a kind of shared video card virtualization
CN104881444A (en) Method and system for updating caching server in website
CN102547393B (en) Mobile internet video content interactive system and method thereof
US9535837B2 (en) Decentralized online cache management for digital content conveyed over shared network connections based on cache fullness and cache eviction policies
CN104750614B (en) Method and apparatus for managing memory
CN102917036A (en) Memcached-based distributed cache data synchronization realization method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20180518

Termination date: 20190526

CF01 Termination of patent right due to non-payment of annual fee