http:^^www.cs.washington.edu^homes^romer^biblio.html

来自「This data set contains WWW-pages collect」· HTML 代码 · 共 46 行

HTML
46
字号
Date: Tue, 10 Dec 1996 21:32:56 GMTServer: NCSA/1.4.2Content-type: text/htmlLast-modified: Tue, 10 Sep 1996 19:14:51 GMTContent-length: 1452<html><head><title>Ted Romer's Bibliography</title></head><h1><!WA0><a href="http://www.cs.washington.edu/homes/romer/index.html">Ted Romer</a></h1><h2>Publications</h2><li><!-- <!WA1><a href="http://www.cs.washington.edu/homes/romer/rocky/InterpreterS+P.submit.ps" -->The Structure and Performance of Interpreters </a>.Romer, Lee, Voelker, Wolman, Wong, Baer, Bershad, and Levy.ASPLOS VII, to appear.<!WA2><a href="http://www.cs.washington.edu/homes/romer/rocky/InterpreterS+P.abstract.html">Abstract</a>,<!WA3><a href="http://www.cs.washington.edu/homes/romer/rocky/InterpreterS+P.ps">postscript</a>.<li><!WA4><a href="ftp://ftp.cs.washington.edu/homes/romer/isca95.paper.ps">Reducing TLB and Memory Overhead Using OnlineSuperpage Promotion</a>.Romer, Ohlrich, Karlin and Bershad.  ISCA '95, pp. 176-187.<li><!WA5><a href="ftp://ftp.cs.washington.edu/homes/romer/scml.paper.ps">Dynamic Page Mapping Policies for Cache Conflict Resolutionon Standard Hardware.</a>Romer, Lee, Bershad, and Chen.  OSDI '94, pp. 255-266.<li><!WA6><a href="http://www.cs.washington.edu/homes/bershad/paper-cml.ps">Avoiding Conflict Misses Dynamically in Large Direct-MappedCaches. </a> Bershad, Lee, Romer, and Chen.  ASPLOS VI, pp. 158-170.<li><!WA7><a href="file://cs.utexas.edu/pub/techreports/tr93-06.ps.Z">Kernel Support forRecoverable-Persistent Virtual Memory.</a>Chew, K., J. Reddy, T. Romer, and A. Silberschatz, USENIX Mach Symposium, 1993, pp. 215-234.<li><!WA8><a href="http://www.cs.washington.edu/homes/romer/lmpaper.ps">An algorithm reminiscent of Euclidean-gcd forcomputing a function related to pinwheel scheduling.</a>T. Romer and L. Rosier,Algorithmica, to appear.</body>

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?