检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:阮晓龙[1] 于冠军 RUAN Xiao-Long;YU Guan-Jun(School of Information Technology,Henan University of Chinese Medicine,Zhengzhou 450026,China;QISHI Corporation,Zhengzhou 450008,China)
机构地区:[1]河南中医药大学信息技术学院,郑州450046 [2]郑州祺石信息技术有限公司,郑州450008
出 处:《计算机系统应用》2020年第1期231-235,共5页Computer Systems & Applications
摘 要:随着数字资源不断发展,面对大容量的数字资源校验时,现有的文件校验方法相比于传统文件校验在执行效率、服务器资源利用率方面已有极大的提高,但仍存在不灵活、服务器资源浪费、文件校验存在限制等特性.本文提出一种基于服务器资源弹性并发处理的文件校验算法模型,利用多并发和分块读取的方式,在保证文件Hash计算理论复杂度不变的情况下,合理利用服务器资源利用率,提升文件校验效率.With the continuous development of digital resources, facing large-capacity digital resource verification, the existing file verification methods have greatly improved compared with the traditional file verification in terms of execution efficiency and utilization of server resources, but there are still some characteristics such as inflexibility, waste of server resources, limitations of file verification, etc. Therefore, this study proposes a new method based on server resource flexibility and concurrency. By using multi-concurrent and block-reading methods, we can rationally utilize the resource utilization of servers to improve the efficiency of file verification under the condition that the theoretical complexity of file Hash calculation remains unchanged.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.127