版权说明 操作指南
首页 > 成果 > 详情

Research on the RRB plus Tree for Resource Reservation

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文、会议论文
作者:
Wu, Libing*;Dang, Ping;Nei, Lei;Cui, Jianqun;Liu, Bingyi
通讯作者:
Wu, Libing
作者机构:
[Wu, Libing; Nei, Lei; Dang, Ping; Liu, Bingyi] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Peoples R China.
[Wu, Libing; Nei, Lei] Wuhan Univ, State Key Lab Software Engn, Wuhan 430072, Peoples R China.
[Cui, Jianqun] Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.
通讯机构:
[Wu, Libing] W
Wuhan Univ, Sch Comp Sci, Wuhan 430072, Peoples R China.
语种:
英文
关键词:
Data structure;Advance resource reservation;RRB plus tree;Loop time slot array
期刊:
Lecture Notes in Computer Science
ISSN:
0302-9743
年:
2013
卷:
8147
页码:
83-93
会议名称:
10th IFIP International Conference on Network and Parallel Computing (NPC)
会议论文集名称:
Lecture Notes in Computer Science
会议时间:
SEP 19-21, 2013
会议地点:
Guiyang, PEOPLES R CHINA
会议主办单位:
[Wu, Libing;Dang, Ping;Nei, Lei;Liu, Bingyi] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Peoples R China.^[Wu, Libing;Nei, Lei] Wuhan Univ, State Key Lab Software Engn, Wuhan 430072, Peoples R China.^[Cui, Jianqun] Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.
会议赞助商:
IFIP
主编:
Hsu, CH Li, X Shi, X Zheng, R
出版地:
HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者:
SPRINGER-VERLAG BERLIN
ISBN:
978-3-642-40819-9; 978-3-642-40820-5
基金类别:
National Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [61070010, 61170017, 61272212]; Science & Technology Plan of Wuhan city
机构署名:
本校为其他机构
院系归属:
计算机学院
摘要:
The performance of the data structure has a significant impact on the overall performance of the advance resource reservation in the distributed computing. Because the query and update operations of the B+ tree are of high efficiency, so this paper proposes a B+ tree structure suitable for resource reservation the RRB+ tree. Also, we design and implement the corresponding algorithms of query, insertion and deletion. Different with the B+ tree that insert and delete one key word at a time, the RRB+ tree insert one reservation request and delete one tree node every time. The RRB+ tree is of a hi...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com