一种面向网格资源预留的索引链表研究  

Index Linked List Suited for Resource Reservation

作　　者：吴黎兵[1,2] 于天水[1] 何炎祥[1,2] 李飞[1] 

机构地区：[1]武汉大学计算机学院,湖北武汉430072 [2]武汉大学软件工程国家重点实验室,湖北武汉430072

出　　处：《武汉理工大学学报（信息与管理工程版）》2011年第6期904-908,共5页Journal of Wuhan University of Technology：Information & Management Engineering

基　　金：国家自然科学基金资助项目(61070010);湖北省自然科学基金资助项目;中央高校基本科研业务费专项资金资助项目

摘　　要：研究了现有的资源预留数据结构,并在此基础上提出了一种新的数据结构,即索引链表。同时,选择了3种经典的现有数据结构(时隙数组、单链表和双链表)作为比较对象,通过编码实现与实际测试,对4种数据结构的内存消耗、请求接纳时间和请求搜索时间这3个方面的性能进行了评估,实验结果表明,所提出的索引链表的综合性能更优。Resource reservation is one of the hot research fields in grid computing. Data structure that stores the reservation information acts as an important role related with resource reservation. The present data structure was analyzed. In order to improve the processing efficiency, a new data structure named index linked list was proposed. Three existing typical data structures, slot array, single linked list and double linked list were chosen as contrast samples. The four data structures were implemented and evaluated. The performance was assessed respectively according to memory consumption, request accepting time and searching time. Experimental results show that the overall performance of the proposed index linked list is better.

关 键 词：网格计算 资源预留 网格资源 数据结构 索引链表 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]