http:^^www.cs.utexas.edu^users^svkakkad^papers.html
来自「This data set contains WWW-pages collect」· HTML 代码 · 共 83 行
HTML
83 行
MIME-Version: 1.0
Server: CERN/3.0
Date: Monday, 06-Jan-97 21:26:18 GMT
Content-Type: text/html
Content-Length: 2415
Last-Modified: Wednesday, 31-Jan-96 16:51:33 GMT
<HTML><head><title>Sheetal V. Kakkad - Publications</title></head><body><h1>Sheetal V. Kakkad - Publications</h1><h2>The Texas Persistent Store</h2>Texas is an easy-to-use persistent storage system for C++. It supportslarge addresses efficiently on standard hardware, using a techniquecalled <i>pointer swizzling at page fault time</i>.<ol><li> Vivek Singhal, Sheetal Kakkad, and Paul R. Wilson. <b> Texas: AnEfficient, Portable Persistent Store</b>. In <cite> Persistent ObjectSystems: Proceedings of the Fifth International Workshop on PersistentObject Systems</cite>, San Miniato, Italy, September 1992, pages11-33.Springer-Verlag Workshops in Computing.<p>This paper provides a detailed description of Texas, its motivations,and its algorithms.<!WA0><!WA0><a href="http://www.cs.utexas.edu/users/oops/papers.html#texas"><!WA1><!WA1><img align=top src="http://www.cs.utexas.edu/users/svkakkad/icons/more.xbm" alt="more..."></a> <p><li> Paul R. Wilson and Sheetal V. Kakkad. <b> Pointer Swizzling at PageFault Time: Efficiently and Compatibly Supporting Huge Addresses onStandard Hardware</b>. In <cite> International Workshop on ObjectOrientation in Operating Systems</cite>, Paris, France, September1992, pages 364-377. IEEE Press.<p>This paper provides a detailed description of the pointer swizzlingtechnique.<!WA2><!WA2><a href="http://www.cs.utexas.edu/users/oops/papers.html#swizz"><!WA3><!WA3><img align=top src="http://www.cs.utexas.edu/users/svkakkad/icons/more.xbm" alt="more..."></a> <p><li> Vivek Singhal, Sheetal Kakkad, and Paul Wilson. <b> Texas: Good,Fast, Cheap Persistence for C++</b>. In <cite> OOPSLA '92 Addendum tothe Proceedings, OOPS Messenger</cite>, 4(2):145-147, April 1993. <p>A shorter description of the Texas paper. This summarizes our poster atOOPSLA '92. <p></ol><h2> Memory Hierarchy Studies </h2><ol><li> Paul R. Wilson, Sheetal V. Kakkad and Shubhendu Mukherjee.<b> Anomalies and Adaptation in the Analysis and Development of Prefetching Policies</b>. <cite> Journal of Systems and Software</cite>,27(2):147-153, November 1994. Technical communication.</a> <p><!WA4><!WA4><a href="http://www.cs.utexas.edu/users/oops/papers.html#prefetchsim"><!WA5><!WA5><img align=top src="http://www.cs.utexas.edu/users/svkakkad/icons/more.xbm" alt="more..."></a> <p></ol><hr><address>January 29, 1996 <br><!WA6><!WA6><a href = "http://www.cs.utexas.edu/users/svkakkad"> Sheetal V. Kakkad</a> <br><!WA7><!WA7><a href = "http://www.cs.utexas.edu/users/svkakkad//">Department of Computer Sciences</a>, <!WA8><!WA8><a href = http://www.utexas.edu/>The University of Texas at Austin</a> <br><!WA9><!WA9><a href = "mailto:svkakkad@cs.utexas.edu">svkakkad@cs.utexas.edu</a> </address></body></HTML>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?