并行文件系统中适度贪婪的Cache预取一体化算法

传统文件系统中的Ｃａｃｈｅ和预取技术是两种降低访问延迟的有效方法。在并行科学计算应用的Ｉ／Ｏ访问模式下,简单的Ｃａｃｈｅ和预取技术已无法提供较高的Ｃａｃｈｅ命中率,该文在分析该Ｉ／Ｏ模式的基础上提出了适度贪婪的Ｃａｃｈｅ和预取一体化算法（ＰＧＩ）,该算法充分利用了并行文件系统环境的特点,采用了适度贪婪的动态滑模技术,可以有铲地消除预取时的抖动,降低系统处理开锁,并同时采用了Ｃａｃｈｅ和预取一体化的     

改善磁盘阵列性能的方法

磁盘阵列是解决计算机Ｉ／Ｏ瓶颈问题的有效方法之一，通过对现有磁盘阵列结构的研究，提出了４种改善磁盘阵列性能的方法，即良分利用磁盘带宽，平衡多盘的负载，减少奇偶检验数据存取时间和磁盘阵列Ｃａｃｈｅ技术等，分析结果表明：在事务处理应用领域，利用Ｃａｃｈｅ来把小写转化为大写可大大改善目前一般情况下，以一道数据大小来作为磁盘的基本存取大小是合适的选择，磁盘阵列负载平衡设计不足是指正常模式下系统请求在多盘间     

中央Cache磁盘阵列排队模型的建立

本文建立了中央Ｃａｃｈｅ磁盘阵列结构的排队模型，在一定假设条件下，推导出了系统Ｉ／Ｏ请求平均响应时间公式和系统可服务的最大Ｉ／Ｐ率公式，并总结了影响中央Ｃａｃｈｅ磁盘阵列结构性能的主要因素。     

廉价冗余磁盘阵列（RAID）Cache浅析

廉介冗余磁盘陈列技术已掀起研究开发热潮，磁盘Ｃａｃｈｅ技术的研究早在七十年代就已广泛展开，但是关于磁盘阵列Ｃａｃｈｅ技术的专门性研究文献在国内外并不多见。本文论述了磁盘阵列中引入高速缓存Ｃａｃｈｅ的必要性，综述了磁盘阵列Ｃａｃｈｅ技术的国内外技术动态，提出了磁盘阵列Ｃａｃｈｅ研究中的几个关键问题，并阐述了作者的观点。     

PCI协议对Cache的支持

论述了Ｃａｃｈｅ在高性能计算机系统中的作用和访问Ｃａｃｈｅ的过程，以及Ｃａｃｈｅ数据一致性问题和解决的方法，介绍和分析了ＰＣＩ协议对Ｃａｃｈｅ的支持。     

面向对象高性能存储器管理

高性能面向对象（ｏｂｊｅｃｔｏｒｉｅｎｔｅｄ）存储器管理方法运用专用控制器ＡＳＩＣ对两级高速缓存器ｃａｃｈｅ进行管理，将中央处理机ＣＰＵ从对象地址转换和活跃对象管理的负担中解除出来．这一设计适用于高性能工作站和其他ＯＯＰ（ＯｂｊｅｃｔＯｒｉｅｎｔｅｄＰｒｏｇｒａｍｍｉｎｇ）环境．在两级高速缓冲存储器ｃａｃｈｅ和动态随机存取存储器ＤＲＡＭ的配置下，硬件能以低于２０ｎｓ的存取周期存取对象数据（包括上下限检查和保护检查）．由硬件实现伙伴算法的情况下，对象能以低于５００ｎｓ的存取周期被分配或释放．     

一种基于二叉树的Cache一致性目录方法

本文提出了一种高度并发的Ｃａｃｈｅ一致性方法，着重描述了它的并发性，并且通过和ＩＥＥＥＳＣＩ协议的性能比较，表明这种Ｃａｃｈｅ一致性方法具有较好的伸缩能力，适于Ｓ２ＭＰ结构。     

分布式计算环境下的并行体绘制算法

分布式计算环境中基于消息传递机制的分布式共享缓冲区中，Ｃａｃｈｅ效率是算法性能的“瓶颈”。本文在分布式共享缓冲区上实现了一个并行体绘制算法。在数据空间，八叉树快速分类改善了Ｃａｃｈｅ的空间相关性；在图象空间。Ｈｉｂｅｒｔ象素遍历方式改善了Ｃａｃｈｅ的时间相关性，在曙光１０００和ＳＧＩ工作站网络上的实验结果都表明，算法的网络数据传送量大大减少，Ｃａｃｈｅ效率明显提高，绘制时间大大缩短。     

如何读取隐藏扇区

本文通过磁盘Ｉ／Ｏ参数表，讨论了磁盘内引导记录扇区与保留扇区、隐藏扇区的关系；并分析硬盘的布局，提出读取硬盘中隐藏扇区（含主引导用区）的方法，附注源程序．     

多处理机I／O性能的研究

计算机系统的Ｉ／Ｏ子系统可以分为隐式Ｉ／Ｏ和显式Ｉ／Ｏ两类。隐式Ｉ／Ｏ也称为页面调度，是指在虚拟存储器中页面内的Ｉ／Ｏ服务；显式Ｉ／Ｏ是指程序通过读／写命令所产生的明显的磁盘存取。本文对大型科学计算应用系统在多处理机环境下并行运行时影响Ｉ／Ｏ性能的因素进行了详细讨论。通过对大量测试数据的研究发现，在设计应用系统时，隐式Ｉ／Ｏ的问题并不是主要的，而随着计算速度的提高和处理能力的增强，解决显式Ｉ／Ｏ的问题则显得日益重要。     

基于RAID50的存储系统高速缓存设计

设计了一种多个控制卡分条的RAID50模型和主机虚拟卷地址到所属高级别阵列、低级别阵列分条的二级地址映射模式，以提高I/O访问的并发性。定义多个连续I/O块为扩展块并等同于Cache页大小，且作为RAID50传输粒度，进一步改善内存与存储设备之间的传输效率。设计了基于Cache描述符控制块的哈希链式查找算法和基于Cache页访问频率计数的二次机会置换算法，实现了一种主机数据接收与RAID50存储设备预读并发进行的策略。结果表明，该设计有效地提高了存储系统的I/O性能。     

网络磁盘阵列中基于任务排队的多用户请求动态调度策略

在存储系统中,底层I/O调度策略十分重要,它决定了整个存储系统的效率.一个良好的调度策略可以有效地提高系统的性能.结合网络磁盘阵列的工作特点,提出了一种基于任务排队的动态调度算法,其基本思想是充分利用多个网络用户的请求数据在网络磁盘阵列上的空间连续性,最大限度地减小磁头寻道延迟和旋转延迟,从而降低系统的响应时间.     

面向视频流数据实时存储的RAID写策略

本文针对实际应用，介绍了常规磁盘阵列（RAID）I／O过程，在分析常规RAID写回策略的基础上提出了一种流水写回式策略，这种策略充分利用了系统现有资源，扩大并行性，提高了数传率，缩短了I／O平均响应的时间。     

阵列矩阵RAID50研究——容量聚合与全并发策略

提出了一种跨多阵列通道的海量存储RAID50模型,通过采取多阵列卡的RAID0分条和阵列卡上多磁盘RAID5分条和校验的二级并发的数据组织与分块方式,以扩展块（大小等于阵列卡上的一个RAID5校验组）作为Cache和阵列之间数据交换的单位,实现了将阵列矩阵中所有磁盘的容量聚合及全并发访问。设计了该模型逻辑卷管理的最佳适配算法及二级地址映射算法。理论分析与实验结果表明：该策略将I/O响应时间降到了最低,且获得了与阵列通道数线性相关的逻辑卷容量和I/O性能。     

面向虚拟机的远程磁盘缓存

在虚拟机(virtual machine)系统中,随着虚拟机数量和应用程序需求的不断增长,内存容量已经成为应用程序性能的主要瓶颈。为了提升内存密集型和I/O密集型程序的页面交换性能,提出了虚拟机的远程磁盘缓存机制REMOCA,它允许运行在一台物理主机上的虚拟机将其他物理主机的内存作为其二级磁盘缓存。由于网络传输延迟远远小于磁盘访问,用网络传输代替磁盘访问就能够有效地降低虚拟机的平均磁盘访问延迟。REMOCA的目标就要尽可能地减少磁盘访问。REMOCA运行在虚拟机管理器中,其基本工作原理是截获并处理虚拟机的页面淘汰、磁盘访问等事件。REMOCA能够与现有的虚拟机内存管理机制(如气球技术、影子缓存)相结合,从而提供更加灵活的内存资源管理策略。实验数据表明,REMOCA能有效地降低页面抖动对虚拟机性能的影响,并在很大程度上提升虚拟机中I/O密集型应用的性能。     

Energy-aware disk scheduling for soft real-time I/O requests

In this work, we develop energy-aware disk scheduling algorithm for soft real-time I/O. Energy consumption is one of the major factors which bar the adoption of hard disk in mobile environment. Heat dissipation of large scale storage system also calls for an energy-aware scheduling technique to further increase the storage density. The basic idea in this work is to properly determine the I/O burst size so that device can be in standby mode between consecutive I/O bursts and that it can satisfy the soft real-time requirement. We develop an elaborate model which incorporates the energy consumption characteristics, overhead of mode transition in determining the appropriate I/O burst size and the respective disk operating schedule. Efficacy of energy-aware disk scheduling algorithm greatly relies on not only disk scheduling algorithm itself but also various operating system and device firmware related concerns. It is crucial that the various operating system level and device level features need to be properly addressed within disk scheduling framework. Our energy-aware disk scheduling algorithm successfully addresses a number of outstanding issues. First, we examine the effect of OS and hard disk firmware level prefetch policy and incorporate its effect in our disk scheduling framework. Second, our energy aware scheduling framework can allocate a certain fraction of disk bandwidth to handle sporadically arriving non real-time I/O’s. Third, we examine the relationship between lock granularity of the buffer management and energy consumption. We develop a prototype software with energy-aware scheduling algorithm. In our experiment, proposed algorithm can reduce the energy consumption to one fourth if we use energy-aware disk scheduling algorithm. However, energy-aware disk scheduling algorithm increases buffer requirement significantly, e.g., from 4 to 140 KByte. We carefully argue that the buffer overhead is still justifiable given the cost of DRAM chip and importance of energy management in modern mobile devices. The result of our work not only provides the energy efficient scheduling algorithm but also provides an important guideline in capacity planning of future energy efficient mobile devices. This paper is funded by KOSEF through Statistical Research Paper for Complex System at Seoul National University.     

高强度I/O的应用对并行存储系统的挑战和解决方法研究

具有高I/O密集特性的高性能计算应用对高性能计算机存储系统综合性能的要求越来越高.以石油地震勘探数据处理为代表的一类重要应用表现出I/O数据量巨大、I/O访问密度大,对单个磁盘阵列存储部件的读写带宽要求高的特征.在Lustre文件系统中,充当对象存储服务功能的磁盘阵列设备输出带宽的不足将成为阻碍存储系统整体性能发挥的重要因素.针对此类问题,提出了一种缓存管理方法,分别在客户端添加VDISK模块,在OST端添加Cache模块,二者协同提高并行文件系统I/O的输出带宽的使用效率;另外,充分利用客户端空闲内存以及客户端之间的通信带宽,降低应用程序对磁盘阵列设备输出带宽的要求.通过大规模并行模型的验证表明,VDISK提高了实际可用的输出带宽,提高了外部存储系统的I/O效率.     

Optimization of I/O systems by cache disks and file migration: A summary

The file system, and the components of the computer system associated with it (disks, drums, channels, mass storage tapes and tape drives, controllers, I/O drivers, etc.) comprise a very substantial fraction of most computer systems; substantial in several aspects, including amount of operating system code, expense for components, physical size and effect on performance. In a comparison paper, we surveyed the traditional methods for optimizing the I/O system. We then examined disk and I/O system architecture in IBM type systems, and indicated shortcomings and future directions. In this paper we go one step further and summarize research by the author on two topics: cache disks and file migration. Cache disks are disks which have an associated cache which buffers recently used tracks of data. The case for cache disks is presented, and some of the issues are discussed. Parameter values for some aspects of the cache design are suggested. The second part of this paper summarizes the author's work on file migration, by which files are migrated between disk and mass storage as needed in order to effectively maintain on-line a much larger amount of information than the disks can hold. Some of the algorithms investigated are discussed, and the basic results are presented.     

Optimization of I/O systems by cache disks and file migration: A summary

The file system, and the components of the computer system associated with it (disks, drums, channels, mass storage, tapes and tape drives, controllers, I/O drivers, etc.) comprise a very substantial fraction of most computer systems; substantial in several aspects, including amount of operating system code, expense for components, physical size and effect on performance. In a companion paper, we surveyed the traditional methods for optimizing the I/O system. We then examined disk and I/O system architecture in IBM type systems, and indicated shortcomings and future directions. In this paper we go one step further and summarize research by the author on two topics: cache disks and file migration. Cache disks are disks which have an associated cache which buffers recently used tracks of data. The case for cache disks is presented, and some of the issues are discussed. Parameter values for some aspects of the cache design are suggested. The second part of this paper summarizes the author's work on file migration, by which files are migrated between disk and mass storage as needed in order to effectively maintain on-line a much larger amount of information than the disks can hold. Some of the algorithms investigated are discussed, and the basic results are presented.