CN110855646B - Approach loading system for network computer and application method - Google Patents
Approach loading system for network computer and application method Download PDFInfo
- Publication number
- CN110855646B CN110855646B CN201911063271.0A CN201911063271A CN110855646B CN 110855646 B CN110855646 B CN 110855646B CN 201911063271 A CN201911063271 A CN 201911063271A CN 110855646 B CN110855646 B CN 110855646B
- Authority
- CN
- China
- Prior art keywords
- application program
- target application
- target
- server
- processed
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/133—Protocols for remote procedure calls [RPC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention relates to a near loading system and an application method for a network computer, which adopt a brand-new control strategy and design a period control execution method, introduce application time and node hop number of a server which is accessed to the server at a distance as analysis factors for an application program arranged on a network server, realize the scheduling of the application program among the servers on the network, and dynamically change the scheduling step length of the application program among the servers on the network based on the comparison among continuous period node operations, thereby realizing the dynamic scheduling among the servers on the network based on the state factor of the application program and effectively improving the application efficiency of the network computer to the application program.
Description
Technical Field
The invention relates to a proximity loading system and an application method for a network computer, belonging to the technical field of network computer application.
Background
The network computer is an interactive information equipment under the mode of customer's computing, it is a computer used in network, but it has no traditional hard disk and floppy disk, etc. parts, and belongs to thin PC, and the server on the network provides program or storage. The network computer has own processing capacity, but other software except the core software needs to be downloaded from the network server, so that frequent software upgrading and maintenance are saved, and the cost is also reduced. Therefore, the network computer is based on network communication and application programs distributed on the network server in the application process, and is completely based on the network communication in the application process, wherein the network distance between the application program and the network computer and the calling time of each network computer are all factors for limiting the calling of each application program, so that the actual application of the conventional network computer is deeply influenced by the network factors.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a close loading system and an application method for a network computer, which adopt a brand-new control strategy to periodically execute, and can effectively improve the application efficiency of the network computer to each application program.
The invention adopts the following technical scheme for solving the technical problems: the invention has designed a close loading system and application method used for network computer, connect the Internet through its correspondent cut-in server, call the course of the application program on every server of the distributed Internet to the network computer, realize the close loading control of every application program; each access server executes the following steps according to a preset period duration and a preset period respectively:
step A, defining a cycle duration period with a forward current time as a target period; defining each network computer connected with the Internet by the access server in a target time period as each target network computer; b, each target network computer is connected with the Internet and each server on the called distributed Internet through the access server in a target time interval to be defined as each target application program, and then the step B is carried out;
b, respectively aiming at each target application program, obtaining the total calling time length of each target network computer to the target application program in a target time interval as the total calling time length corresponding to the target application program; simultaneously, obtaining the node hop count of the server where the target application program is located and accessing the server at a distance, and taking the node hop count as the current node hop count corresponding to the target application program; obtaining the total calling time t and the current node hop count a respectively corresponding to each target application program, and then entering the step C;
step C, aiming at each target application program, obtaining the product of the total calling time t corresponding to the target application program and the hop count a of the current node as the working cost A corresponding to the target application program, and then entering the step D;
d, sorting the target application programs from high to low according to the working cost A corresponding to each target application program, selecting the target application programs with the number being preset in proportion in the sorting as each emergency target application program, and entering the step E;
step E, respectively executing the following steps E1 to E5 aiming at each emergency target application program to perform scheduling operation;
step E1, taking the emergency target application program as a target application program to be processed, judging whether a server where the target application program to be processed is located is the access server, and if so, not performing any processing on the target application program to be processed; otherwise go to step E2;
step E2, judging whether the target application programs to be processed are all emergency target application programs in the adjacent loading control respectively corresponding to the forward continuous preset number of the period nodes from the current period node, and if so, entering the step E4; otherwise go to step E3;
step E3., moving the target application program to be processed to a server in the direction of the access server, updating the server where the target application program to be processed is located, and finishing the scheduling of the target application program to be processed;
step E4., determining whether the current node hop count a corresponding to the target application program to be processed is greater than 1, if yes, entering step E5, otherwise, returning to step E3;
step E5. is to move the target application program to be processed to the access server, update the server where the target application program is located, and finish the scheduling of the target application program to be processed.
As a preferred technical scheme of the invention: in the step D, aiming at the sorting, the front in the sorting is selected
A target application as each emergency target application; wherein N represents the number of target applications, λ represents a preset ratio value,
indicating a rounding down calculation.
As a preferred technical scheme of the invention: said lambda is equal to 10%.
As a preferred technical scheme of the invention: in step E2, it is determined whether the target application programs to be processed are all emergency target application programs in the adjacent loading control corresponding to each of the preceding 5 consecutive period nodes from the current period node.
Compared with the prior art, the approach loading system for the network computer and the application method have the following technical effects by adopting the technical scheme:
the invention designs a near loading system and an application method for a network computer, adopts a brand-new control strategy, designs a period control execution method, introduces application time and node hop number of a server which is accessed to the server at a distance from the server aiming at an application program arranged on a network server, and processes the application time and the node hop number as analysis factors to realize the scheduling of the application program among the servers on the network.
Drawings
FIG. 1 is a flow chart of a method for loading a network computer in a near field and an application method thereof.
Detailed Description
The following description will explain embodiments of the present invention in further detail with reference to the accompanying drawings.
The invention has designed a close loading system and application method used for network computer, connect the Internet through its correspondent cut-in server, call the course of the application program on every server of the distributed Internet to the network computer, realize the close loading control of every application program; in practical application, as shown in fig. 1, each access server executes the following steps a to E according to a preset period duration and period, respectively.
Step A, defining a cycle duration period with a forward current time as a target period; defining each network computer connected with the Internet by the access server in a target time period as each target network computer; and defining each target network computer to be connected with the Internet and each server on the called distributed Internet through the access server in a target time period as each target application program, and then entering the step B.
B, respectively aiming at each target application program, obtaining the total calling time length of each target network computer to the target application program in a target time interval as the total calling time length corresponding to the target application program; simultaneously, obtaining the node hop count of the server where the target application program is located and accessing the server at a distance, and taking the node hop count as the current node hop count corresponding to the target application program; and obtaining the total calling time t and the current node hop count a respectively corresponding to each target application program, and then entering the step C.
And C, respectively aiming at each target application program, obtaining the product of the total calling time t corresponding to the target application program and the hop count a of the current node as the working cost A corresponding to the target application program, and then entering the step D.
And D, sorting the target application programs from high to low according to the working cost A corresponding to each target application program, selecting the target application programs with the number being preset in proportion in the sorting as the emergency target application programs, and entering the step E.
In practical application, in the step D, the top in the sequence is selected
A target application as each emergency target application; wherein N represents the number of target applications, λ represents a preset ratio value,
represents a round-down calculation; such as specifically design λ equal to 10%.
And E, respectively executing the following steps E1 to E5 for each emergency target application program to perform scheduling operation.
Step E1, taking the emergency target application program as a target application program to be processed, judging whether a server where the target application program to be processed is located is the access server, and if so, not performing any processing on the target application program to be processed; otherwise step E2 is entered.
Step E2, judging whether the target application programs to be processed are all emergency target application programs in the adjacent loading control respectively corresponding to the forward continuous preset number of the period nodes from the current period node, and if so, entering the step E4; otherwise step E3 is entered.
In practical applications, in step E2, for example, the specific design determines whether all the target applications to be processed are emergency target applications in the adjacent loading control corresponding to each of the preceding 5 cycle nodes from the current cycle node.
Step E3. is to move the target application program to be processed to a server in the direction of the access server, update the server where the target application program to be processed is located, and finish the scheduling of the target application program to be processed.
Step E4. determines whether the current node hop count a corresponding to the target application program to be processed is greater than 1, if yes, step E5 is performed, otherwise, step E3 is performed.
Step E5. is to move the target application program to be processed to the access server, update the server where the target application program is located, and finish the scheduling of the target application program to be processed.
The technical scheme is that a near loading system and an application method for a network computer are designed, a brand-new control strategy is adopted, a period control execution method is designed, application time and node hop number of a server which is located at a distance from the server to be accessed to the server are introduced to the application program arranged on a network server and are used as analysis factors to be processed, scheduling of the application program among the servers on the network is achieved, meanwhile, the scheduling step length of the application program among the servers on the network is dynamically changed based on comparison among continuous period node operations, therefore, dynamic scheduling among the servers on the network is achieved based on state factors of the application program, and application efficiency of the network computer to the application program can be effectively improved.
The embodiments of the present invention have been described in detail with reference to the drawings, but the present invention is not limited to the above embodiments, and various changes can be made within the knowledge of those skilled in the art without departing from the gist of the present invention.
Claims (4)
1. A close loading system and application method for network computer, aiming at the process that the network computer connects the internet through the corresponding access server and calls the application program on each server of the distributed internet, realizing the close loading control of each application program; the method is characterized in that each access server respectively executes the following steps according to preset cycle duration and cycle:
step A, defining a cycle duration period with a forward current time as a target period; defining each network computer connected with the Internet by the access server in a target time period as each target network computer; b, each target network computer is connected with the Internet and each server on the called distributed Internet through the access server in a target time interval to be defined as each target application program, and then the step B is carried out;
b, respectively aiming at each target application program, obtaining the total calling time length of each target network computer to the target application program in a target time interval as the total calling time length corresponding to the target application program; simultaneously, obtaining the node hop count of the server where the target application program is located and accessing the server at a distance, and taking the node hop count as the current node hop count corresponding to the target application program; obtaining the total calling time t and the current node hop count a respectively corresponding to each target application program, and then entering the step C;
step C, aiming at each target application program, obtaining the product of the total calling time t corresponding to the target application program and the hop count a of the current node as the working cost A corresponding to the target application program, and then entering the step D;
d, sorting the target application programs from high to low according to the working cost A corresponding to each target application program, selecting the target application programs with the number being preset in proportion in the sorting as each emergency target application program, and entering the step E;
step E, respectively executing the following steps E1 to E5 aiming at each emergency target application program to perform scheduling operation;
step E1, taking the emergency target application program as a target application program to be processed, judging whether a server where the target application program to be processed is located is the access server, and if so, not performing any processing on the target application program to be processed; otherwise go to step E2;
step E2, judging whether the target application programs to be processed are all emergency target application programs in the adjacent loading control respectively corresponding to the forward continuous preset number of the period nodes from the current period node, and if so, entering the step E4; otherwise go to step E3;
step E3., moving the target application program to be processed to a server in the direction of the access server, updating the server where the target application program to be processed is located, and finishing the scheduling of the target application program to be processed;
step E4., determining whether the current node hop count a corresponding to the target application program to be processed is greater than 1, if yes, entering step E5, otherwise, returning to step E3;
step E5. is to move the target application program to be processed to the access server, update the server where the target application program is located, and finish the scheduling of the target application program to be processed.
2. The system of claim 1, wherein the system comprises: in the step D, aiming at the sorting, the front in the sorting is selected
A target application as each emergency target application; wherein N represents the number of target applications, λ represents a preset ratio value,
indicating a rounding down calculation.
3. The system of claim 2, wherein the system comprises: said lambda is equal to 10%.
4. The system of claim 1, wherein the system comprises: in step E2, it is determined whether the target application programs to be processed are all emergency target application programs in the adjacent loading control corresponding to each of the preceding 5 consecutive period nodes from the current period node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911063271.0A CN110855646B (en) | 2019-10-31 | 2019-10-31 | Approach loading system for network computer and application method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911063271.0A CN110855646B (en) | 2019-10-31 | 2019-10-31 | Approach loading system for network computer and application method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110855646A CN110855646A (en) | 2020-02-28 |
| CN110855646B true CN110855646B (en) | 2021-08-06 |
Family
ID=69599717
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911063271.0A Active CN110855646B (en) | 2019-10-31 | 2019-10-31 | Approach loading system for network computer and application method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110855646B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1606301A (en) * | 2004-07-09 | 2005-04-13 | 清华大学 | A resource access shared scheduling and controlling method and apparatus |
| US7818410B1 (en) * | 2005-09-27 | 2010-10-19 | Sprint Communications Company L.P. | System and method of implementing major application migration |
| CN102195890A (en) * | 2011-06-03 | 2011-09-21 | 北京大学 | Internet application dispatching method based on cloud computing |
| CN103841136A (en) * | 2012-11-22 | 2014-06-04 | 腾讯科技（深圳）有限公司 | Acceleration method and system of application program |
| US9794144B1 (en) * | 2011-02-15 | 2017-10-17 | Google Inc. | Correlating status information generated in a computer network |
| CN109274584A (en) * | 2018-09-28 | 2019-01-25 | 乐蜜有限公司 | Cut-in method, device, client device and the storage medium of access server |
| CN110365787A (en) * | 2019-07-19 | 2019-10-22 | 南京工业大学 | Edge calculation optimization layout method based on micro-service framework and applied to container |
-
2019
- 2019-10-31 CN CN201911063271.0A patent/CN110855646B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1606301A (en) * | 2004-07-09 | 2005-04-13 | 清华大学 | A resource access shared scheduling and controlling method and apparatus |
| US7818410B1 (en) * | 2005-09-27 | 2010-10-19 | Sprint Communications Company L.P. | System and method of implementing major application migration |
| US9794144B1 (en) * | 2011-02-15 | 2017-10-17 | Google Inc. | Correlating status information generated in a computer network |
| CN102195890A (en) * | 2011-06-03 | 2011-09-21 | 北京大学 | Internet application dispatching method based on cloud computing |
| CN103841136A (en) * | 2012-11-22 | 2014-06-04 | 腾讯科技（深圳）有限公司 | Acceleration method and system of application program |
| CN109274584A (en) * | 2018-09-28 | 2019-01-25 | 乐蜜有限公司 | Cut-in method, device, client device and the storage medium of access server |
| CN110365787A (en) * | 2019-07-19 | 2019-10-22 | 南京工业大学 | Edge calculation optimization layout method based on micro-service framework and applied to container |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110855646A (en) | 2020-02-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108509335B (en) | Software test data generation method based on genetic algorithm optimization | |
| CN109101816B (en) | Malicious code homology analysis method based on system call control flow graph | |
| CN108229101B (en) | NGS-based targeted sequencing data simulation method and device | |
| US20130042229A1 (en) | Method of updating list of software-as-a-service and system for the same | |
| WO2007082814B1 (en) | Method for modeling a free pool of resources | |
| CN106371924B (en) | A kind of method for scheduling task minimizing MapReduce cluster energy consumption | |
| CN113821972A (en) | Multi-robot collaborative assembly line balancing method considering energy efficiency | |
| CN111984414A (en) | Data processing method, system, equipment and readable storage medium | |
| CN110855646B (en) | Approach loading system for network computer and application method | |
| CN111782396B (en) | Concurrency elastic control method based on distributed database | |
| CN105988855B (en) | Just-In-Time parameter optimization method and device | |
| CN107169138B (en) | Data distribution method for distributed memory database query engine | |
| US11372379B2 (en) | Computer system and control method | |
| CN109522102B (en) | Multitask external memory mode graph processing method based on I/O scheduling | |
| CN108427773B (en) | Distributed knowledge graph embedding method | |
| CN105589896B (en) | Data digging method and device | |
| CN115619200A (en) | Production scheduling and multi-functional scheduling combined optimization method and device for split type Seru | |
| CN113407336A (en) | Full-comparison data distribution method based on tabu search optimization algorithm | |
| CN107656810B (en) | Method for ensuring service quality of delay sensitive program under data center environment | |
| US20160104066A1 (en) | Optimization method for a computer system | |
| US5933348A (en) | Method for biasing designs of experiments | |
| CN110795251A (en) | Method and equipment for determining terminal operation parameters | |
| CN110648067A (en) | JSP (Java Server Page) method and device based on improved group intelligent optimization algorithm | |
| CN109408235A (en) | A kind of data processing method and device, a kind of calculating equipment and storage medium | |
| CN104573077A (en) | Method and device for displaying data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |