Extending SSD Lifespan with Comprehensive Non-Volatile Memory-Based Write Buffers

Journal of Computer Science and Technology - New non-volatile memory (NVM) technologies are expected to replace main memory DRAM (dynamic random access memory) in the near future. NAND flash...     

An accurate and practical buffer allocation model for the buffer cache based on marginal gains

A new dynamic buffer allocation strategy based on the notion of marginal gains is presented for the buffer cache that is used by the operating system to store frequently accessed disk blocks in main memory, and the performance of the proposed strategy is compared with those of previous allocation strategies. In the proposed strategy, marginal gain values are predicted by exploiting functions that approximate the expected number of buffer hits per unit time. Experimental results from both trace-driven simulation and an actual implementation in the FreeBSD operating system show that the proposed strategy accurately predicts the marginal gain values for various workloads resulting in significantly improved buffer hit ratios.     

Experience with Applying Formal Methods to Protocol Specification and System Architecture

In the last three years or so we at Enterprise Platforms Group at Intel Corporation have been applying formal methods to various problems that arose during the process of defining platform architectures for Intel's processor families. In this paper we give an overview of some of the problems we have worked on, the results we have obtained, and the lessons we have learned. The last topic is addressed mainly from the perspective of platform architects.     

旅行商问题中巡回路径的数据结构

旅行商问题中巡回路径的数据结构对局部启发式算法的效率起着非常关键的作用。巡回路径的数据结构必须能够查询一条回路中每个城市的相对顺序,并且能够将一条回路中的部分城市逆序。分析了数组表示法、伸展树表示法和两级树表示法表示巡回路径时各种基本操作的实现过程及时间复杂度。数组表示法能够在常数时间内确定一条回路中每个城市的相对顺序,但是最坏情况下完成逆序操作需要Ω（n）时间,不适用于大规模的旅行商问题。伸展树表示法执行查询和更新操作的平摊时间复杂度是O（logn）,适用于极大规模的旅行商问题。而两级树表示法在最坏情况下每一个更新操作的时间复杂度是O（n^0.5）,适用于大规模的旅行商问题。     

Index-Based Cache Coherence Protocol

A multiprocessor envirorLment may encounter many problems such as deadlock, load balancing and cache coherence. However, the latter is considered the most dangerous if not properly designed, the system works naturally but generates inaccurate results. This occurs if obsolete versions of a memory block are used. Users may not be aware of the presence of such problem. Two main approaches are known to maintain data consistency： namely, snoopy and directory-based protocols. Each approach has its advantages and limitations. This paper proposes a new technique that considers both previously mentioned approaches. The network architecture is slightly updated by adding an index table to each processor. The proposed protocol is expected to reduce the access time, decrease the number of accesses to main memory, maintain data consistency, and assure the usage of the most recent value of a shared variable.     

移动环境下一种缓存管理策略

移动计算环境中带宽具有非对称性,并且移动设备资源有限,传统的缓存管理策略需要占用大量的设备计算资源和网络带宽,有效的缓存管理技术能够极大提高移动计算的性能。对此提出一系列的针对移动计算的缓存管理策略。首先根据用户访问频率建立对应的具有生命周期的数据项缓存,然后使用自适应一致性维护策略维护缓存的一致性。通过实验分析,提出的管理策略能够很好地降低带宽占用,并且有效地减少对移动客户端的资源需求。     

RCC高速缓存一致性协议的带参验证

Godson-T众核处理器的RCC高速缓存一致性协议是一种非常有特色的带参并发系统,对此协议的带参验证是一个很大的挑战。 Cubicle是最近出现的基于SMT求解器的带参模型检测工具。我们使用了Cubicle带参模型检测工具,成功对RCC协议进行了建模和验证。实验结果表明, RCC协议在结点个数为任意规模时均满足协议的各种安全性质。     

动态传感器网络区域受限的移动sink路径选择研究

针对sink区域受限及节点特征参数的问题,如何规划sink路径选择以满足动态传感器网络高效数据收集及低能耗的要求,提出了一种动态传感器网络区域受限的移动sink路径选择方法。该方法在缓存节点辅助通信模式下,建立sink受限区域图模型。针对不同应用情况,分别讨论了sink移动全局路径信息已知和sink移动局部路径信息已知这两种情况下的最优移动路径。在全局路径信息已知时,采用Vornon单元划分的思想求解总传输能耗和节点平均负载;在局部路径信息已知时,采用启发式策略进行路径寻优,并证明其路径寻优的正确性。最后通过仿真实验与理论计算来验证移动sink最佳路径寻优策略的有效性和可行性。     

I386到Alpha动态二进制翻译中的代码缓存管理优化

动态二进制翻译是跨平台软件移植的最重要手段之一,如何对其进行优化,提高翻译效率一直是研究的热点。文章对I386到Alpha平台的动态二进制翻译进行了研究,提出了一种较好的翻译缓存管理策略,在FIFO的基础上将翻译缓存划分为两级进行管理。以QEMU动态二进制翻译器为实验平台进行测试,结果表明,采用此方法可以提升翻译速度约3%。     

Study on Optimal Strategy of Grade Transition in Industrial Fluidized Bed Gas-Phase Polyethylene Production Process

A model of grade transition is presented for a commercialized fluidized bed gas-phase polyethylene production process. The quantity of off-specification product and the time of grade transition can be minimized by the optimization of operating variables, such as polymerization temperature, the ratio of hydrogen to ethylene, the ratio of co-monomer to ethylene, feed rate of catalyst, and bed level. A new performance index, the ratio of melt flow (MFR), is included in the objective function, for restraining the sharp adjustment of operation variables and narrowing the distribution of molecular weight of the resin. It is recommended that catalyst feed rate and bed level are decreased in order to reduce the grade transition time and the quantity of off-specification product. This optimization problem is solved by an algorithm of sequential quadratic programming (SQP) in MATLAB. There is considerable difference between the forward transition and reverse transition of grade with regard to the operating variab