⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 http:^^www.cs.washington.edu^homes^mel^

📁 This data set contains WWW-pages collected from computer science departments of various universities
💻 EDU^HOMES^MEL^
字号:
Date: Thu, 21 Nov 1996 23:00:56 GMTServer: NCSA/1.4.2Content-type: text/htmlLast-modified: Thu, 25 Apr 1996 00:13:58 GMTContent-length: 1915<html><head>	<title>Melanie Fulgham</title></head><body><h1></h1><address>          <!WA0><!WA0><!WA0><!WA0><a href="http://www.cs.washington.edu/">Computer Science & Engineering Department,</a> <br>      <!WA1><!WA1><!WA1><!WA1><a href="http://www.washington.edu/">University of Washington,</a> FR-35, <br>     <!WA2><!WA2><!WA2><!WA2><a href="http://www.cs.washington.edu/area/">Seattle, WA</a> 98195 USA</address><p><hr> <p>I'm an a.b.d. graduate student at the <!WA3><!WA3><!WA3><!WA3><ahref="http://www.washington.edu/">University of Washington</a>. <h2>Research</h2><p>My primary research interest is network routing both in multicomputerand distributed networks.My advisor is <!WA4><!WA4><!WA4><!WA4><a href="http://www.cs.washington.edu/people/faculty/snyder.html" >Larry Snyder.</a>Here's a picture of <!WA5><!WA5><!WA5><!WA5><a href="http://www.cs.washington.edu/homes/mel/larry2.gif"> Larry</a>hard at work.<p><dl><dt><!WA6><!WA6><!WA6><!WA6><a href="http://www.cs.washington.edu/research/projects/lis/chaos/www/chaos.html" >Chaos</a>         <dd> Chaos routing project -- the Chaos router is a deadlock-free,              probabilistically livelock-free, non-minimal,              fully adaptive router.<dt>Triplex routing        <dd> The first non-minimal fully adaptive wormhole algorithm for tori             that uses deadlock-prevention to achieve deadlock-freedom<dt>Simulation        <dd> Simulation of new and existing routing algorithms to learn             the strengths and weaknesses of various classes             of routing algorithms; e.g. non-minimal versus minimal             routing algorithms.<dt>Routing methods and models        <dd> Development of new routing models to help predict             and compare the performance of new routers              in real parallel machines.<dt>Deflection routing        <dd> Upper and lower bounds for practical (e.g. does not require	     sorting) deflection routing             algorithms on the 2D mesh topology.</dl><body><p> <hr><address>  mel@cs.washington.edu <br>  Last modified: Wed Apr 24 17:12:00 PDT 1996<address></html>

⌨️ 快捷键说明

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