一种门户环境下的缓存模型和算法  

Novel cache model and algorithm in portal system

作　　者：王帅[1] 宋靖宇[1] 

机构地区：[1]中国科学院软件研究所软件工程技术中心,北京100080

出　　处：《计算机应用研究》2007年第8期60-63,共4页Application Research of Computers

基　　金：国家"863"计划资助项目(2004AA112010;2005AA112030);国家"973"计划资助项目(2002CB312005)

摘　　要：提出的门户环境下的缓存模型和算法的基本思想是把门户页面分解为I序列、布局块和内容块。用户请求页面时,门户系统只生成和传递发生改变的块,再由客户端根据这些块和I序列组装成完整的页面。实验结果表明,该算法可以提高网络带宽的利用率,缩短响应时间。This paper presented a novel cache model and algorithm in portal system, which divided a portal page into I-sequence, layout-fragments and content-fragments. When a user submited a request, the portal server only createed and delivered the changed fragments, and then the user got the full page composed of the fragments according to the I-sequence. Experimental result shows that this algorithm yields a significant reduction in both bandwidth usage and response time.

关 键 词：门户 缓存 块 PORTLET 

分 类 号：TP302[自动化与计算机技术—计算机系统结构]