Large data-set task node transferrying method based on content and relation separation |
Title: |
Large data-set task node transferrying method based on content and relation separation |
|
Application Number: |
200610012265 |
Application Date: |
2006/06/15 |
Announcement Date: |
2007/01/17 |
Pub. Date: |
|
Publication Number: |
1897570 |
Announcement Number: |
|
Grant Date: |
|
Granted Pub. Date: |
|
ApplicationType: |
Invention |
State/Country: |
11[China|beijing] |
IPC: |
H04L 12/56, H04L 29/02, H04L 12/24, G06F 17/30 |
Applicant(s): |
Tsinghua Univ. |
Inventor(s): |
Xu Ke, Wu Kun, Wang Haiyang |
Key Words: |
task, node transferrying, content and relation, separation |
Abstract: |
The invention features the following points: sequentially building a content data memory pool including routing information and a configuration data memory pool including the relation between routing items; based on the difference between the first addresses of said two memory pools, getting and building the mapping relation of said memories on the store address; separately building the idle memory link table of said each memory pool; when the routing table manages to move to a independent memory area, according to the size of each memory pool a content memory pool and a configuration memory pool are separately built in the new memory area, and a mapping relation in the new memory area and a idle memory link table are rebuilt. The invention is used to control the hollow space of memory occurring at routing maintenance process. |
Claim: |
|
Priority: |
|
PCT: |
|
LegalStatus: |
|