期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
菜鸟练招(3)
1
《山西档案》 北大核心 2004年第1期58-58,共1页
关键词 WIN98 操作系统安装 重启 计算机配置 备份 拷贝储存 虚拟内存 产品序列号
下载PDF
Design and implementation of a new special storage server
2
作者 韩德志 谢长生 +1 位作者 傅湘林 刘春 《Journal of Southeast University(English Edition)》 EI CAS 2004年第1期36-42,共7页
To improve I/O speed and system performance of network storage devices, a special storage server that is an iSCSI-based network-attached storage server (iSCSI-based network-attached storage server, for short iNAS) is ... To improve I/O speed and system performance of network storage devices, a special storage server that is an iSCSI-based network-attached storage server (iSCSI-based network-attached storage server, for short iNAS) is designed. The iNAS can provide both the file I/O and the block I/O services by an iSCSI module, and it converges with the NAS and the SAN (storage area network). The iNAS improves the I/O speed by the direct data access (zero copy) between the RAID (redundant array of inexpensive disks) controller and the user-level memory. The iNAS integrates the multi-RAID for a single storage pool by a multi-stage stripping device driver, and it implements the storage virtualization. In the experiments, the iNAS has ultra-high-throughput for both the file I/O requests and the block I/O requests. 展开更多
关键词 Input output programs INTERNET UNIX
下载PDF
Efficient hardware-based private information retrieval using partial reshuffle
3
作者 Lan Tian Qin Zhiguang 《High Technology Letters》 EI CAS 2010年第3期263-267,共5页
The paper proposes a novel hardware-based private information retrieval (HWPIR) protocol. By partially reshuffling previously accessed items in each round, instead of frequently reshuffling the whole database, the s... The paper proposes a novel hardware-based private information retrieval (HWPIR) protocol. By partially reshuffling previously accessed items in each round, instead of frequently reshuffling the whole database, the scheme makes better use of shuffled data copies and achieves the computation overhead at O(/N/K),where N and k are the sizes of the database and secure storage respectively. For securestorage with moderate size, e.g. k = O(/N), the overhead is 0(4/N). The result is much better than the state-of-art schemes (as compared to e.g. O(log2N)). Without increasing response time and communication cost, the proposed protocol is truly practicable regardless of the database size. The security and preformance of the protocol is formally analyzed. 展开更多
关键词 private information retrieval (PIR) trusted hardware reshuffle security PRACTICALITY
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部