New self-organized task scheduling topology structure in p2p computing——K+tree
A new self-organized task scheduling topology structure—K+ tree—was provided. A K+ tree was composed of a L-tier K-ary tree and a （L?1）-tier K-ary tree. The basic function unit of a K+ tree was comprised of a coordinator peer, a backup coordinator peer, and K worker peers. Key technologies were expa...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2005-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/thesisDetails?columnId=74670254&Fpath=home&index=0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850213721746440192 |
|---|---|
| author | CHEN Hong-wei1 WANG Ru-chuan1 |
| author_facet | CHEN Hong-wei1 WANG Ru-chuan1 |
| author_sort | CHEN Hong-wei1 |
| collection | DOAJ |
| description | A new self-organized task scheduling topology structure—K+ tree—was provided. A K+ tree was composed of a L-tier K-ary tree and a （L?1）-tier K-ary tree. The basic function unit of a K+ tree was comprised of a coordinator peer, a backup coordinator peer, and K worker peers. Key technologies were expatiated on which include how a non-organized graph changes into a self-organized K+ tree, how a coordinator selects worker peers and a backup coordinator peer, and how a K+ tree realizes balancing load among peers. K+ tree had high reliability and scalability, and it can lower the average running time of tasks effectively in certain conditions via analysis and simulation. |
| format | Article |
| id | doaj-art-6f5193f3a1b044e99feea02c5e6f9574 |
| institution | OA Journals |
| issn | 1000-436X |
| language | zho |
| publishDate | 2005-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-6f5193f3a1b044e99feea02c5e6f95742025-08-20T02:09:05ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2005-01-01243074670254New self-organized task scheduling topology structure in p2p computing——K+treeCHEN Hong-wei1WANG Ru-chuan1A new self-organized task scheduling topology structure—K+ tree—was provided. A K+ tree was composed of a L-tier K-ary tree and a （L?1）-tier K-ary tree. The basic function unit of a K+ tree was comprised of a coordinator peer, a backup coordinator peer, and K worker peers. Key technologies were expatiated on which include how a non-organized graph changes into a self-organized K+ tree, how a coordinator selects worker peers and a backup coordinator peer, and how a K+ tree realizes balancing load among peers. K+ tree had high reliability and scalability, and it can lower the average running time of tasks effectively in certain conditions via analysis and simulation.http://www.joconline.com.cn/thesisDetails?columnId=74670254&Fpath=home&index=0K+ tree;peer-to-peer;task scheduling |
| spellingShingle | CHEN Hong-wei1 WANG Ru-chuan1 New self-organized task scheduling topology structure in p2p computing——K+tree Tongxin xuebao K+ tree;peer-to-peer;task scheduling |
| title | New self-organized task scheduling topology structure in p2p computing——K+tree |
| title_full | New self-organized task scheduling topology structure in p2p computing——K+tree |
| title_fullStr | New self-organized task scheduling topology structure in p2p computing——K+tree |
| title_full_unstemmed | New self-organized task scheduling topology structure in p2p computing——K+tree |
| title_short | New self-organized task scheduling topology structure in p2p computing——K+tree |
| title_sort | new self organized task scheduling topology structure in p2p computing k tree |
| topic | K+ tree;peer-to-peer;task scheduling |
| url | http://www.joconline.com.cn/thesisDetails?columnId=74670254&Fpath=home&index=0 |
| work_keys_str_mv | AT chenhongwei1 newselforganizedtaskschedulingtopologystructureinp2pcomputingktree AT wangruchuan1 newselforganizedtaskschedulingtopologystructureinp2pcomputingktree |