CN1324025A - Method of saving resource and running several downloaded application programs simultaneously - Google Patents
Method of saving resource and running several downloaded application programs simultaneously Download PDFInfo
- Publication number
- CN1324025A CN1324025A CN00115656A CN00115656A CN1324025A CN 1324025 A CN1324025 A CN 1324025A CN 00115656 A CN00115656 A CN 00115656A CN 00115656 A CN00115656 A CN 00115656A CN 1324025 A CN1324025 A CN 1324025A
- Authority
- CN
- China
- Prior art keywords
- application program
- block
- client
- down load
- application programs
- 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
Links
Images
Landscapes
- Information Transfer Between Computers (AREA)
- Stored Programmes (AREA)
Abstract
A method to operate several downloading application programs simultaneously in resource saving is to divide the space preserved by the client computer in the Flash and RAM into several Blocks. The size of the blocks in the Flash and RAM can be different but the total number is the same. Each block has its starting place which can match each block according to fixed address mapping mode. To send anyone of application program to the servicer, the executive code with no need of positioning and fixed address mapping will be formed so that the downloaded application program can be directly executed without repositioning. The perent invention not only can fully utilize the limited space of the storage at client computer but also can operate several downloaded application programs simultaneously.
Description
The present invention relates to a kind of method of saving resource and moving a plurality of down load application programs simultaneously, and be particularly related to a kind of during from server end (Server) down load application program, need not reorientate, get final product mutual connection is carried out this application program in client (Client) method.
Down load application program (Downloaded Application), be meant that client connects server end by certain Wiring device after, client is downloaded the general name of the executable application programs that gets off from server end.Usually, the down load application program is made up of procedure code, must have dynamic storage space and static storage space to cooperatively interact during execution.Wherein, dynamic storage space is for the usefulness of the procedure code that stores executive routine, and static storage space then is used for storing the global variable of executive routine.
In network service, client terminal device refers to that PC, notebook computer, palmtop computer or personal digital assistant device etc. have the equipment of data-transformation facility, it is minimum is made up of CPU (central processing unit) (CPU), random access memory (Random Access Memory is hereinafter to be referred as RAM), flash memory (Flash) and connector (Connector): server end then can be the machine that can provide download (Download) to serve arbitrarily.
At present, client T carries and carries out the down load application program, and following two kinds of implementation methods are arranged:
1. one kind is that the down load application program all exists among RAM or the FIash, to be downloaded get off after, Kinematic Positioning just can be moved then again.The defective of this method is to need to download extra dynamic alignment data, needs to consume extra RAM, and needs special instrument to generate dynamic alignment data, has increased the exploitation operation.
2. another kind is that the down load application program is existed among the Flash, client is told server the position of depositing the down load application program, immediately connect the executable code that (Linking) generates needs by server, give client, owing to will leave the down load application program in advance, the ram space that the whole city parameter is used is reserved and is fixed, by all down load application program sharings.It is all uncertain that such shortcoming is that each client is deposited the position of down load application program, server needs instant the connection, when having a plurality of clients connect same station server requirement simultaneously to download data, will increase load of server, serious may cause long wait, in addition, all down load application program sharing one block RAM spaces can only have a down load application program to move simultaneously.
In view of this, purpose of the present invention is for providing a kind of during from server end down load application program, can be fast mutually conflict ground in the method for this application program of client executing.
Purpose according to the invention described above, disclose a kind of method of saving resource and moving a plurality of down load application programs simultaneously, be to keep for the flash memory of application program and random access memory space to be cut into a plurality of blocks (Block) client, wherein, the size of the size of each block of Flash and each block of RAM can be different, but the block number between them is identical, and with man-to-man pattern, above-mentioned block is carried out the mapping of fixed address, because each block all has fixing reference position, therefore can be according to corresponding each block of fixing map addresses pattern, generating one for any one down load application program need not Kinematic Positioning and the fixing executable code of map addresses; Because all executable program sign indicating numbers all generate and are stored in server end, therefore in advance, after a plurality of application programs are downloaded, just need not reorientate and directly to move, not only make full use of the limited storage space of client, and a plurality of down load application programs can be moved simultaneously.
It is the microcomputer that hardware resource is simplified that the present invention is particularly useful for client.As palmtop computer (Hand=held Personal ComPuter, HPC) or personal digital assistant device (PDA).
For above-mentioned and other purposes, feature and advantage of the present invention can be become apparent, a preferred embodiment cited below particularly, and conjunction with figs. are described in detail below:
Fig. 1 shows the client minimal hardware and forms synoptic diagram;
Fig. 2 shows the piecemeal synoptic diagram of FIash and RAM in the embodiment of the invention: and
Fig. 3 shows the memory configurations synoptic diagram of enumerating example.
Please refer to Fig. 1, the figure shows the client terminal device in the inventive method, it is made up of CPU (central processing unit) (CPU) 20, random-access memory (ram) 30, flash memory (FIash) 10 and 50 of connectors (Connector) at least; CPU (central processing unit) 20 wherein is the control and the computing center of whole client terminal device, its by connector 50 (for example modulator-demodular unit or network card) with network on server end reach and be connected, and with flash memory 10 and random access memory 30 as the platform that stores with the processing data.
Generally can reserve fixing flash memory 10 spaces,, and can reserve fixing random access memory 30 spaces, use for the whole city parameter of down load application program with the executable program sign indicating number of storage down load application program in client.The inventive method with above-mentioned flash memory 10 branches such as grade be cut into the block 110 (Block) that a plurality of amount of capacity equate, and the equal block 310 of a plurality of amount of capacity equally also is cut in the space of random access memory 30 five equilibrium; As shown in Figure 2, wherein block 110 sizes of flash memory 10 can be in different size with the block 310 of random access memory 30, but its other block sum is identical, for example all be cut into n block, and respectively numbering identical flash memory block 110 and random access memory block 310, be combined as an available block group 40, therefore have n available block group 40 altogether.
Because flash memory 10 spaces of reserving and the address in random access memory 30 spaces are fixed, and again it is cut into n fixed-size block respectively, so each block is all to there being fixing start address.We are in advance according to fixing map addresses pattern, corresponding each block, give any one application program of server end generate one need not Kinematic Positioning, the fixing executable program sign indicating number of map addresses, if corresponding so respectively n block carried out start address as procedure code, because the start address of n block is different, the map addresses of each version is just different.Therefore, any one down load application program implementation procedure code just has n version.
We leave the n of each down load application program version executable program sign indicating number in server device end (Server), when the user end to server end requires the down load application program, suppose to carry out this down load application program and need m continuous flash memory block 110 and random access memory block 310, wherein m≤n just needs m available block group 40.If client is to have time from continuous y the block that block x begins, and y 〉=m, then client just requires the application program executable program sign indicating number of x version to server end, so, after application program is downloaded, owing to be the procedure code version of reserving in advance, therefore also just need not reorientate, just can directly carry out; But, if y＜m represents that then present client does not have enough storage space to carry out this application program, so on screen the display-memory deficiency, and do not do the action of download.
Because in the inventive method, the flash memory 10 that different down load application programs takies is separate with random access memory 30 blocks, do not have the situation generation that the address covers each other, therefore, can carry out several down load application programs simultaneously.
Though deposit the down load application procedure code of a plurality of versions at server end, can take certain storage area, but often the resource of server end (as PC or workstation Work Station etc.) than client (be as convenient, for carrying the microcomputer of usefulness, PDA or HPC etc.) aboundresources many, therefore take the problem that point space can't cause system more.
Below just enumerate concrete example explanation:
Please refer to Fig. 3, suppose that flash memory 10 has 128KB, random access memory 30 has 16KB, we are divided into 8 blocks with flash memory and random access memory, thus, each flash memory block has 16KB, and each random access memory block is 2KB.And each numbering identical flash memory block 110 and 310 combinations of random access memory block are called an available block group 40, so in this example, one have 8 available block groups 40.
If the reference position of flash memory 10 is 0 * 100000, then the reference position of its block 0 also together, because each flash memory block 110 takies the space of 16KB, therefore, the reference position of its block 1 is 0 * 104000, the reference position of block 2 is 0 * 108000, and all the other by that analogy; In like manner, if the reference position of random access memory 30 is 0 * 200000, because each random access memory block 310 takies the space of 2KB, therefore, the reference position of its block 1 is 0 * 200800, the reference position of block 2 is 0 * 201000, and all the other by that analogy.
Determined the start address after above each memory block disposes, we just can produce the information that corresponding procedure code connects to be needed, with the starting point that each block is downloaded as application program, then can produce the executable program of 8 kinds of different editions to same application.
Suppose to have an applet " Mine ", it is a trivial games that digs land mine, if the procedure code size of " Mine " is 30KB, therefore " Mine " need take 2 flash memory blocks 110, as shown in Figure 3, relatively, client also can dispose 2 random access memory blocks 310 and give it, and just it has taken 2 available block groups 40.If, client wants to download it, and its flash memory block 110 and random access memory block 310, it is idle that two continuous available block groups 40 (being numbered 4 and 5) are arranged, therefore, we just download " Mine " trivial games from server end, are put into to be numbered in 4 and 5 the available block group 40.Because the executable program sign indicating number that " Mine " trivial games is downloaded is stipulated according to the flash memory block 110 and the start address of random access memory block 310 of the 4th group of client, so need not reorientate after downloading, can directly carry out.
Similarly, be numbered l, 2,3 available block group 40 if there is another one snipsnapsnorum " FreeCell " to take client, because the address space between " FreeCell " and " Mine " is independently, therefore also just can carry out simultaneously without interfering with each other.
Though the present invention discloses as above with a preferred embodiment; right its is not in order to limiting the present invention, anyly has the knack of present technique field person, without departing from the spirit and scope of the present invention; when can doing a little change and retouching, so protection scope of the present invention is as the criterion when looking accompanying patent claim.
Effect of the present invention is as follows:
Nationality of the present invention is cut into a plurality of (n for example by the flash memory that will reserve and random access memory space Individual) equal-sized block, wherein the size of each block of flash memory can and random access memory Block is in different size, but their block number must be identical. Because each block has solid Therefore fixed original position can according to fixing address each block of mapped mode correspondence, give any one Individual down load application program generates one need not Kinematic Positioning and the fixing executable code of address mapping, therefore, The present invention just need not reorientate and can directly move after allowing a plurality of down load application programs download, and not only fills Divide and to have utilized the storage space of the limited reservation of client, and make a plurality of down load application programs can be simultaneously Operation.
Claims (5)
1, a kind of method of saving resource and moving a plurality of down load application programs simultaneously can make client terminal device can carry out the application program of downloading from server end apace, and it includes the following step:
Random access memory and flash memory with client are divided into a plurality of blocks respectively, and its block sum is mutually the same;
Adopt man-to-man pattern, described a plurality of random access memory block and described a plurality of flash memory storage device block are carried out the mapping of fixed address, making becomes a plurality of fixedly block groups of start address that have;
Make the fixedly start address of described a plurality of block groups, the memory starting address when carrying out for the application program of server end, and in view of the above described application program is generated a plurality of same executable program sign indicating numbers;
The storer behaviour in service present according to client in a plurality of executable program sign indicating numbers by described application program, selected an executable program sign indicating number that is fit to; And
Chosen executable program sign indicating number is downloaded to client from server end, and carries out this application program.
2, saving resource as claimed in claim 1 and move the method for a plurality of down load application programs simultaneously is characterized in that, deposits global variable when the random access memory of described client keeps for application program to carry out.
3, saving resource as claimed in claim 1 and move the method for a plurality of down load application programs simultaneously is characterized in that, deposits the executable program sign indicating number when flash memory of described client keeps for application program to carry out.
4, saving resource as claimed in claim 1 and move the method for a plurality of down load application programs simultaneously is characterized in that the fixing executable program sign indicating number of described a plurality of map addresses is deposited in server end.
5, saving resource as claimed in claim 1 and move the method for a plurality of down load application programs simultaneously, it is characterized in that, when the present storer behaviour in service of described client is not enough to carry out this application program, the information of display-memory deficiency on the screen of client.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN00115656A CN1116640C (en) | 2000-05-11 | 2000-05-11 | Method of saving resource and running several downloaded application programs simultaneously |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN00115656A CN1116640C (en) | 2000-05-11 | 2000-05-11 | Method of saving resource and running several downloaded application programs simultaneously |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1324025A true CN1324025A (en) | 2001-11-28 |
| CN1116640C CN1116640C (en) | 2003-07-30 |
Family
ID=4585100
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN00115656A Expired - Fee Related CN1116640C (en) | 2000-05-11 | 2000-05-11 | Method of saving resource and running several downloaded application programs simultaneously |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1116640C (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1311366C (en) * | 2003-05-22 | 2007-04-18 | 群联电子股份有限公司 | Parallel double-track using method for quick flashing storage |
| CN100389407C (en) * | 2002-07-25 | 2008-05-21 | 联想(北京)有限公司 | Method for storing system and application rpogramme in hand-held information device |
| CN101170675B (en) * | 2007-11-21 | 2011-03-23 | 中兴通讯股份有限公司 | Method and system for managing J2ME application in network TV system |
| CN103841194A (en) * | 2014-03-07 | 2014-06-04 | 汉柏科技有限公司 | Auxiliary device and method for APP download |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP6702681B2 (en) | 2015-10-01 | 2020-06-03 | キヤノン株式会社 | Information processing apparatus, information processing method, and program |
-
2000
- 2000-05-11 CN CN00115656A patent/CN1116640C/en not_active Expired - Fee Related
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100389407C (en) * | 2002-07-25 | 2008-05-21 | 联想(北京)有限公司 | Method for storing system and application rpogramme in hand-held information device |
| CN1311366C (en) * | 2003-05-22 | 2007-04-18 | 群联电子股份有限公司 | Parallel double-track using method for quick flashing storage |
| CN101170675B (en) * | 2007-11-21 | 2011-03-23 | 中兴通讯股份有限公司 | Method and system for managing J2ME application in network TV system |
| CN103841194A (en) * | 2014-03-07 | 2014-06-04 | 汉柏科技有限公司 | Auxiliary device and method for APP download |
| CN103841194B (en) * | 2014-03-07 | 2017-01-25 | 汉柏科技有限公司 | Auxiliary device and method for APP download |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1116640C (en) | 2003-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Karypis et al. | Parmetis: Parallel graph partitioning and sparse matrix ordering library | |
| US6370565B1 (en) | Method of sharing computation load within a distributed virtual environment system | |
| US20020065870A1 (en) | Method and apparatus for heterogeneous distributed computation | |
| US20040215917A1 (en) | Address translation manager and method for a logically partitioned computer system | |
| JPH06266564A (en) | Method and apparatus for generation and storage of composite data structure | |
| CA2539460A1 (en) | System and method for dynamic version management of applications | |
| Preis et al. | The PARTY Partitioning-library: User Guide; Version 1.1 | |
| Behrens et al. | Parallelizing an unstructured grid generator with a space-filling curve approach | |
| Bruce | The treatment of state in optimistic systems | |
| CN1116640C (en) | Method of saving resource and running several downloaded application programs simultaneously | |
| US5873092A (en) | Information handling system, method, and article of manufacture including persistent, distributed object name services including shared properties | |
| CN111459463A (en) | Algorithm module generation method and linear symbol drawing method | |
| CN112445623A (en) | Multi-cluster management method and device, electronic equipment and storage medium | |
| CN109669644A (en) | A kind of method and apparatus of data storage | |
| CN112948330A (en) | Data merging method, device, electronic equipment, storage medium and program product | |
| Bilardi et al. | On the effectiveness of D-BSP as a bridging model of parallel computation | |
| Koenig et al. | Optimizing distributed application performance using dynamic grid topology-aware load balancing | |
| Van Nieuwpoort et al. | Adaptive load balancing for divide-and-conquer grid applications | |
| Veiga et al. | Incremental replication for mobility support in OBIWAN | |
| Burton et al. | Distributed random number generation | |
| US20020054043A1 (en) | Method and system for displaying images | |
| CN112905354A (en) | Service processing method and system for shared memory | |
| US6795968B1 (en) | Dynamic object behavior for object-oriented-computing environments | |
| CN114225385B (en) | Cloud game data processing method, device, equipment and storage medium | |
| CN1155694A (en) | Method and apparatus for subclassing system object model classes in dynamic languages |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C06 | Publication | ||
| PB01 | Publication | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: YINGHUADA(NAN JING) TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: YINGYEDA GROUP(NANJING) ELECTRONIC TECHNOLOGY CO.,LTD Effective date: 20041112 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20041112 Address after: 210000 Pai Road, Jiangning economic and Technological Development Zone, Nanjing, Jiangsu Patentee after: Inventec (Nanjing) Technology Co., Ltd. Address before: Nanjing City, Jiangsu province 210006 Crane Street No. 100 Patentee before: Yingyeda Group (Nanjing) Electronic Technology Co., Ltd. |
|
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1076102 Country of ref document: HK |
|
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20030730 Termination date: 20100511 |