微信服务号

微信订阅号

2025年3月24日 18:04 星期一
首页 > 过刊浏览>2006年第17卷第11期 >2234-2244
PDF HTML阅读 XML下载 导出引用 引用提醒
一种内存网格的数据预取算法
作者:
基金项目:

Supported by the National Natural Science Foundation of China under Grant Nos.60573135, 60673167, 90412011 (国家自然科学基金); the National Grand Fundamental Research 973 Program of China under Grant Nos.2003CB317008, 2005CB321801 (国家重点基础研究发展规划(973))

  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [26]
    • |
  • 相似文献 [20]
    • | | |
  • 文章评论
    摘要:

    内存网格(RAM(random access memory) grid)是一种面向广域网上内存资源共享的新型网格系统.它的主要目标是在物理内存不足的情况下,提高内存密集型应用或IO密集型应用的系统性能.内存网格的应用效果取决于网络通信开销.在减少或隐藏网络通信开销的情况下,其性能可以进一步提高.通过对内存网格的分析,设计了一种基于"推"数据的内存网格预取机制.借助数据挖掘领域中序列模式挖掘的方法,提出了相应的预取算法.通过基于真实运行状态的模拟,对预取算法进行了评估和验证.

    Abstract:

    RAM(random access memory)Grid is a new grid system aiming at memory resources sharing in wide-area network;it can improve the performance of memory intensive or IO intensive applications when lack of physical memory.Reducing or hiding the network overhead can improve the performance of RAM Grid,which lies on the overhead of network communication.In this paper,through the analysis of RAM Grid,a “push” based prefetching mechanism is proposed for it.The corresponding prefetching algorithm,which comes from the sequential pattern mining method in data mining area,is also raised.The prefetching algorithm is evaluated and proved by trace driven simulation.

    参考文献
    [1]Foster I,Kesselman C,Tuecke S.The anatomy of the grid:Enabling scalable virtual organizations.Int'l Journal of High Performance Computing Applications,2001,15(3):200-222.
    [2]Frey J,Tannenbaum T,Livny M,Foster I,Tuecke S.Condor-G:A computation management agent for multi-institutional grids.In:Proc.of the 10th IEEE Int'l Symp.on High Performance Distributed Computing.San Francisco:IEEE Computer Society,2001.http://csdl2.computer.org/persagen/DLAbsToc.jsp-resourcePath=/dl/proceedings/&toc=comp/proceedings/hpdc/2001/1296/00/ 1296toc.xml&DOI=10.1109/HPDC.2001.945176
    [3]Baru C,Moore R,Rajasekar A,Wan M.The SDSC storage resource broker.In:Proc.of the CASCON'98 Conf.IBM Press,1998.http://citeseer.ist.psu.edu/64825.html
    [4]Foster I,Kesselman C.The Grid 2:Blueprint for a New Computing Infrastructure.2nd ed.,Morgan Kaufmann Publishers Inc.,2003.
    [5]Chu R,Xiao N,Zhuang Y,Liu Y,Lu X.A distributed paging RAM grid system for wide-area memory sharing.In:Proc.of the 20th Int'l Parallel and Distributed Processing Symp.Toronto:X-CD Technologies Inc.,2006.
    [6]Feeley MJ,Morgan WE,Pighin FH,Karlin AR,Levy HM,Thekkath CA.Implementing global memory management in a workstation cluster.In:Proc.of the Symp.on Operating Systems Principles.New York:ACM Press,1995.201-212.
    [7]Markatos EP,Dramitinos G.Implementation of a reliable remote memory pager.In:Proc.of the USENIX Annual Technical Conf.1996.177-190.http://www.usenix.org/publications/library/proceedings/sd96/
    [8]Acharya A,Setia S,The utility of exploiting idle memory for data-intensive computations.Technical Report,TRCS98-02,Santa Barbara:University of California at Santa Barbara,1998.
    [9]Foster I.Service-Oriented science.Science,2005,308(5723):814-817.
    [10]Patterson DA.Latency lags bandwith.Communications of the ACM,2004,47(10):71-75.
    [11]Chilimbi TM,Hirzel M.Dynamic hot data stream prefetching for general-purpose programs.In:Proc.of the ACM SIGPLAN 2002 Conf.on Programming Language Design and Implementation.New York:ACM Press,2002.199-209.
    [12]Wenisch TF,Somogyi S,Hardavellas N,Kim J,Ailamaki A,Falsafi B.Temporal streaming of shared memory.In:Proc.of the 32nd Annual Int'l Symp.on Computer Architecture.Los Alamitos:IEEE Computer Society,2005.222-233.
    [13]Shi X,Yang Z,Peir JK,Peng L,Chen YK,Lee V,Liang B.Coterminous locality and coterminous group data prefetching on chip-multiprocessors.In:Proc.of the 20th Int'l Parallel and Distributed Processing Symp.Toronto:X-CD Technologies Inc.,2006.
    [14]Swaminathan N,Raghavan SV.Intelligent prefetch in WWW using client behavior characterization.In:Proc.of the 8th Int'l Symp.on Modeling,Analysis and Simulation of Computer and Telecommunication Systems.Los Alamitos:IEEE Computer Society,2000.
    [15]Yu SZ,Kobayashi H.A new prefetch cache scheme.In:Proc.of the IEEE Global Telecommunications Conf.2002.350-355.http://ieeexplore.ieee.org/xpl/freeabs_all.jsp-arnumber=892028
    [16]Agrawal R,Srikant R.Mining sequential patterns.In:Proc.of the 11th Int'l Conf.on Data Engineering.Los Alamitos:IEEE Computer Society.1995.
    [17]Dahlin MD,Wang RY,Anderson TE,Patterson DA.Cooperative caching:Using remote client memory to improve file system performance.In:Proc.of the 1st Symp.on Operating Systems Design and Implementation.1994.267-280.http://citeseer.ist.psu.edu/26547.html
    [18]Anderson TE,Dahlin MD,Neefe JM,Patterson DA,Roselli DS,Wang RY.Serverless network file systems.ACM SIGOPS Operating Systems Review,1995,29(5):109-126.
    [19]Flouris MD,Markatos EP.The network RamDisk:Using remote memory on heterogeneous NOWs.Cluster Computing,1999,2(4):281-293.
    [20]Oleszkiewicz J,Xiao L,Liu Y.Parallel network RAM:Effectively utilizing global cluster memory for large data-intensive parallel programs.In:Proc.of the 2004 Int'l Conf.on Parallel Processing.Los Alamitos:IEEE Computer Society,2004.353-360.
    [21]Voelker GM,Anderson EJ,Kimbrel T,Feeley MJ,Chase JS,Karlin AR,Levy HM.Implementing cooperative prefetching and caching in a globally-managed memory system.In:Proc.of the Joint Int'l Conf.on Measurement and Modeling of Computer Systems.New York:ACM Press,1998.33-43.
    [22]Yang CL,Lebeck AR,Tseng HW,Lee CH.Tolerating memory latency through push prefetching for pointer-intensive applications.ACM Trans.on Architecture and Code Optimization,2004,1(4):445-475.
    [23]Agrawal R,Srikant R.Mining sequential patterns:Generalizations and performance improvements.In:Apers PMG,Bouzeghoub M,Gardarin G.Proc.of the 5th Int'l Conf.on Extending Database Technology:Advances in Database Technology.London:Springer-Verlag,1996.3-17.
    [24]Ayres J,Flannick J,Gehrke J,Yiu T.Sequential pattern mining using a bitmap representation.In:Proc.of the 8th ACM SIGKDD Int'l Conf.on Knowledge Discovery and Data Mining.New York:ACM Press,2002.429-435.
    [25]Pei J,Han J,Mortazavi-Asl B,Pinto H.PrefixSpan:Mining sequential patterns efficiently by prefix-projected pattern growth.In:Proc.of the IEEE 17th Int'l Conf.on Data Engineering.2001.215-226.
    [26]Nevill-Manning CG,Witten IH.Linear-Time,incremental hierarchy inference for compression.In:Proc.of the Conf.on Data Compression.Los Alamitos:IEEE Computer Society,1997.
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

褚瑞,卢锡城,肖侬.一种内存网格的数据预取算法.软件学报,2006,17(11):2234-2244

复制
分享
文章指标
  • 点击次数:7603
  • 下载次数: 7394
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2006-06-10
  • 最后修改日期:2006-08-07
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19728461位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号