📄 http:^^www.cs.utexas.edu^users^rdb^cs195t^
字号:
MIME-Version: 1.0
Server: CERN/3.0
Date: Monday, 06-Jan-97 20:30:22 GMT
Content-Type: text/html
Content-Length: 19230
Last-Modified: Friday, 15-Nov-96 15:47:58 GMT
<HTML><HEAD><TITLE>CS195T: Introduction to Graduate Computer Science</TITLE><LINK REV="made" HREF="mailto:rdb@cs.utexas.edu"></HEAD><BODY><!-- ====================================================================== --><h1 align=center>CS195T:<br>Introduction to Graduate Computer Science</h1><h2 align=center>Fall 1996 (47865)</h2><ul><li> Lecture: Monday, 12:00 - 1:00, in TAY 2.106.<li> Instructor: <!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><a href="http://www.cs.utexas.edu/users/rdb">Robert Blumofe</a><ul><li> Office: Taylor 4.118<li> Phone: 471-9557<li> Email: <!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><a href="mailto:rdb@cs.utexas.edu"><kbd>rdb@cs.utexas.edu</kbd></a><li> Office hours: Thursday 1:30 - 3:30,but feel free to stop by any time.</ul></ul><!-- ====================================================================== --><hr><!-- Put any announcements here. --><p>This is a one-semester seminar course that can only be taken on apass/fail basis. For graduate students, the course is <em>CS 195T:Introduction to Graduate Computer Science</em>. For undergraduates,the course is <em>CS 178: Undergraduate Topics in Computer Science(Honors)</em> (47730). To receive credit for the course, a student must beregistered for the course, and attend at least 11 of the 13 lectures.</p><p><table border><caption><h2>Schedule</h2></caption><tr><th align=right></th><th>Speaker</th><th>Title</th></tr><tr><th align=right>September 9</th><td><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><a href="http://www.cs.utexas.edu/users/miranker">Dan Miranker</a></td><td><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><a href="#miranker">Alamo: The Net as a Data Warehouse</a></td></tr><tr><th align=right>September 16</th><td><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><a href="http://www.cs.utexas.edu/users/kuipers">Ben Kuipers</a></td><td><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><a href="#kuipers">The Spatial Semantic Hierarchy for Humanand Robot Cognitive Maps</a></td></tr><tr><th align=right>September 23</th><td><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><a href="http://www.cs.utexas.edu/users/rdb">Robert Blumofe</a></td><td><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><a href="#blumofe">Cilk and Cilk-NOW: Adaptive and ReliableParallel Computing on Networks of Workstations</a></td></tr><tr><th align=right>September 30</th><td><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><a href="http://www.cs.utexas.edu/users/risto">Risto Miikkulainen</a></td><td><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><a href="#risto">Learning Sequential Decision Tasks ThroughSymbiotic Evolution of Neural Networks</a></td></tr><tr><th align=right>October 7</th><td><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><a href="http://www.cs.utexas.edu/users/vl">Vladimir Lifschitz</a></td><td><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><a href="#vl">Mathematical Principles of Logic Programming</a></td></tr><tr><th align=right>October 14</th><td><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><a href="http://www.cs.utexas.edu/users/wilson">Paul Wilson</a></td><td><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><a href="#wilson">Extensible Languages, Open Compilers,and Reflection</a></td></tr><tr><th align=right>October 21</th><td><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><a href="http://www.cs.utexas.edu/users/mooney">Ray Mooney</a></td><td><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><a href="#mooney">Learning to Process Natural Language UsingInductive Logic Programming</a></td></tr><tr><th align=right>October 28</th><td><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><a href="http://www.cs.utexas.edu/users/dahlin">Mike Dahlin</a></td><td><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><a href="#dahlin">Distributed I/O: from Clusters to Internets</a></td></tr><tr><th align=right>November 4</th><td><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><a href="http://www.cs.utexas.edu/users/novak">Gordon Novak</a></td><td><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><a href="#novak">Software Reuse by Specialization of GenericProcedures through Views</a></td></tr><tr><th align=right>November 11</th><td><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><a href="http://www.cs.utexas.edu/users/vlr">Vijaya Ramachandran</a></td><td><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><a href="#vlr">The Design and Evaluation of ParallelAlgorithms</a></td></tr><tr><th align=right>November 18</th><td><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><a href="http://www.cs.utexas.edu/users/lorenzo">Lorenzo Alvisi</a></td><td><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><a href="#lorenzo">Lighweight fault-tolerance</a></td></tr><tr><th align=right>November 25</th><td><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><a href="http://www.cs.utexas.edu/users/lin">Calvin Lin</a></td><td><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><a href="#lin">Adaptive Libraries and High Level Optimization</a></td></tr><tr><th align=right>December 2</th><td><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><a href="http://www.cs.utexas.edu/users/UTCS/report/1995/profiles/plaxton.html">Greg Plaxton</a></td><td><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><a href="#plaxton">Analysis of Algorithms</a></td></tr></table></p><!-- ====================================================================== --><hr><h2 align=center><a name="lorenzo">Lighweight fault-tolerance</a></h2><h2 align=center><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><a href="http://www.cs.utexas.edu/users/lorenzo">Lorenzo Alvisi</a></h2><p>Distributed systems have moved beyond the confines of academia andresearch labs and are revolutionizing the way in which businesses,governmental organizations, and simple citizens are processing andcollecting information. Current technological trends promise todramatically increase the pace of this revolution by enabling thedesign of highly cooperative distributed applications that go beyondthe client-server paradigm to harness the computational power ofdistributed systems.</p><p>In this new environment, the scope and emphasis of fault-toleranttechniques are about to undergo dramatic changes. Fault-tolerance willcease to be an expensive feature required by a handful of applicationsto tolerate exotic failures. To the users of a highly distributedinformation infrastructure, fault-tolerance will translate to acompetitive advantage, guaranteeing reliable access to criticalinformation.</p><p>In this talk we will explore a new way to design and engineerfault-tolerant solutions, which we call lightweight fault-tolerance.The goals of lightweight fault-tolerance are:<ul><li>To require few dedicated resources and have a negligibleimpact on performance during failure-free executions.</li><li>To scale its cost depending on the severity and number offailures that need to be tolerated.</li><li>To integrate with applications in a way transparent to theapplication programmer.</li><li>To enable and support emerging applications that will communicatethrough messages as well as files.</li><li>To address software-generated faults effectively.</li></ul></p><!-- ====================================================================== --><hr><h2 align=center><a name="blumofe">Cilk and Cilk-NOW: Adaptive and Reliable Parallel Computing onNetworks of Workstations</a></h2><h2 align=center><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><a href="http://www.cs.utexas.edu/users/rdb">Robert Blumofe</a></h2><p>This presentation overviews <dfn>Cilk</dfn> (pronounced"silk"), an algorithmic parallel multithreaded language, and<dfn>Cilk-NOW</dfn>, a runtime system that supports a functionalsubset of Cilk on networks of workstations. Cilk-NOW provides"adaptive parallelism" and fault tolerance tranparently touser programs. <dfn>Adaptive parallelism</dfn> means that the set ofworkstations on which a Cilk program runs can grow and shrinkdynamically depending on the availability of idle workstations and onthe amount of parallelism within the program. In addition, a Cilkprogram can continue execution even if one or more of its workstationscrashes, because the Cilk-NOW runtime system automatically detects andrecovers from such failures. The presentation includes a livedemonstration.</p><!-- ====================================================================== --><hr><h2 align=center><a name="dahlin">Distributed I/O: from Clusters to Internets</a></h2><h2 align=center><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><a href="http://www.cs.utexas.edu/users/dahlin">Mike Dahlin</a></h2><p>This presentation gives an overview of current issues indistributed file system I/O. Technology trends and new applicationsmotivate more aggressive cluster and wide area network I/O systems. Inclusters, fast networks allow machines to cooperate closely to serviceI/O requests. The xFS file system uses close cooperation among nodesto provide better performance and availability than a single centralserver. In wide area networks, the challenge is to provide goodperformance, availability, and consistency despite limited networkperformance and node or network failures. The wFS file system projectwill explore these issues.</p><!-- ====================================================================== --><hr><h2 align=center><a name="kuipers">The Spatial Semantic Hierarchy for Human and Robot Cognitive Maps</a></h2><h2 align=center><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><a href="http://www.cs.utexas.edu/users/kuipers">Benjamin Kuipers</a></h2>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -