首页 | 本学科首页   官方微博 | 高级检索  
     

一种高效的磁盘队列I/O机制
引用本文:魏青松,卢显良,任立勇,周旭.一种高效的磁盘队列I/O机制[J].电子科技大学学报(自然科学版),2003,32(6):687-691.
作者姓名:魏青松  卢显良  任立勇  周旭
作者单位:1.电子科技大学计算机科学与工程学院 成都 610054
基金项目:信息产业部电子工业生产发展基金,[2000]1277,
摘    要:分析了传统磁盘队列的存储管理开销和读写性能,针对磁盘队列I/O已成为影响消息服务器性能的首要瓶颈,提出了一种高效磁盘队列I/O机制-FlashQ。FlashQ采用物理上连续的磁盘块作为磁盘队列,以紧凑方式组织数据,采用延迟写策略和预先读策略提高读写性能。实验表明,FlashQ的性能比传统磁盘队列好。

关 键 词:消息服务器    磁盘队列    延迟写    预先读
收稿时间:2003-03-21

An Efficient Disk Queue I/O Mechanism
Abstract.An Efficient Disk Queue I/O Mechanism[J].Journal of University of Electronic Science and Technology of China,2003,32(6):687-691.
Authors:Abstract
Affiliation:1.School of Computer Science and Engineering,UEST of China Chengdu 610054
Abstract:The storage management overload and read-write performance of traditional disk queue are analyzed. To solve the problem that disk queue I/O is the primary performance bottleneck in messaging server, an efficient disk queue I/O mechanism called FlashQ is proposed. FlashQ utilizes preassigned continuous disk blocks to act as disk queue and organizes data in compact layout and adopts the Lazy Write and the Ahead Read polices to elevate the performance of read-write. Experiment shows that performance of the FlashQ is much better than that of traditional disk queue.
Keywords:messaging server  disk queue  lazy write  ahead read
本文献已被 维普 等数据库收录!
点击此处可从《电子科技大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《电子科技大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号