http:^^www.cs.uoregon.edu^research^distributedcomputing^research.html
来自「This data set contains WWW-pages collect」· HTML 代码 · 共 148 行
HTML
148 行
Date: Tue, 26 Nov 1996 00:57:06 GMT
Server: Apache/1.1.1
Content-type: text/html
Content-length: 5783
Last-modified: Tue, 19 Nov 1996 00:51:02 GMT
<TITLE>Resource Allocation Group</TITLE><BODY><!WA0><A HREF="http://www.cs.uoregon.edu/research/DistributedComputing/gifs/procsimity.gif"> <!WA1><IMG ALIGN=MIDDLE SRC="http://www.cs.uoregon.edu/research/DistributedComputing/gifs/procsimity_small_int.gif"></A><H6>Part of <!WA2><A HREF="http://www.cs.uoregon.edu/research/DistributedComputing/archive.html#Procsimity"> ProcSimity </A>visualization tool.</H6><P><H2>Resource Allocation Group</H2>We are the Resource Allocation group at the <!WA3><A HREF="http://www.uoregon.edu/"> University of Oregon</A><!WA4><A HREF="http://www.cs.uoregon.edu/">Department of Computer and Information Science</A>.<P><B>Keywords: </B>Parallel and distributed computing, resource management,allocation, mapping, task assignment, scheduling, distributedshared memory. <P><H3>Contents</H3><OL><LI> <!WA5><A HREF = "#description"> Research Description </A><LI> <!WA6><A HREF = http://www.cs.uoregon.edu/research/DistributedComputing/archive.html> Project Archives</A> (Technical Reports and Software)<LI> <!WA7><A HREF = "#members"> Group Members </A><LI> <!WA8><A HREF = "#resources"> Other Information Resources</A><LI> <!WA9><A HREF = "http://www.cs.uoregon.edu/research/DistributedComputing/conferences.html">Upcoming Conferences</A></OL><H3>Research Description:</H3><A NAME="description"></A>Resource management is a key area of research in the drive tofully realize the performance potential of parallel and distributedcomputing systems. The complexitiesinvolved in managing both hardware and software resources thatnumber in the hundreds to thousands, under the demands of a diversemulti-user workload, presents a spectrum of challenging problemsfor operating systems designers. <P>Our research group focuses on the managementof processors and processes in systemsranging from message-passing multicomputers to loosely-coupledworkstation-based distributed systems. We have developedalgorithms and software tools for allocation, mapping, placement, schedulingand migration, with extensions to support fault tolerance,heterogeneous environments, and real time constraints.We have also begun to explore issues related toparallel I/O allocation and scheduling.Our approach involves a blend of theoretical, experimental, and systemsdevelopment work. <P>Processor allocation research: this work involves the designof processor allocation algorithmsfor message-passing machines based on the mesh and k-ary n-cubenetwork topologies. Processor allocation involves selection ofa subset of processors for assignment to each incoming job requestwith the goal of maximizing system throughput.A simulation and visualization tool called <!WA10><A HREF="http://www.cs.uoregon.edu/research/DistributedComputing/archive.html#Procsimity"> ProcSimity</A>has been developed to support experimentation and performance analysiswith a wide range of allocation algorithms on a spectrum of machinearchitectures. This work also involves empirical experimentationwith state of the art machines through collaboration with Bill Nitzberg at<!WA11><A HREF="http://www.nas.nasa.gov/home.html"> NASA Ames NAS</A>. <P>The <!WA12><A HREF="http://www.cs.uoregon.edu/research/DistributedComputing/archive.html#OREGAMI">OREGAMI</A> project: involves the development of algorithms and abstractionsfor the mapping of parallel algorithms to message-passing machineswhen both the computation and the interconnection network are regularin structure. In collaboration with Sanjay Rajopadhye of <!WA13><A HREF="http://www.irisa.fr"> IRISA </A>, France, we have developed a formalism for describing both the computationand the target architecture which aids in the development of efficientand effective mapping functions. This approach exploits regularityin both the spatial and temporal communication patterns exhibitedby many parallel applications. <P><H3>Current Group <A NAME="members">Members</A></H3><UL><LI> <!WA14><A HREF="http://www.cs.uoregon.edu/~lo/"> Virginia M. Lo</A> <!WA15><A HREF="mailto:lo@cs.uoregon.edu"> lo@cs.uoregon.edu</A><LI> Bella Bose <!WA16><A HREF="mailto:bose@cs.orst.edu"> bose@cs.orst.edu</A><LI> Sanjay Rajopadhye <!WA17><A HREF="mailto:sanjay@chert.cs.orst.edu"> sanjay@chert.cs.orst.edu</A><LI> Joshua Dyer <!WA18><A HREF="mailto:jdyer@cs.uoregon.edu> jdyer@cs.uoregon.edu</A><LI> <A HREF="http://www.cs.uoregon.edu/~wliu/"> Wanqian Liu </A> <!WA19><A HREF="mailto:wliu@cs.uoregon.edu"> wliu@cs.uoregon.edu</A><LI> <!WA20><A HREF="http://www.cs.uoregon.edu/~jens/"> Jens Mache</A> <!WA21><A HREF="mailto:jens@cs.uoregon.edu"> jens@cs.uoregon.edu</A><LI> Jayne Valenti Miller <!WA22><A HREF="mailto:jayne@cs.uoregon.edu"> jayne@cs.uoregon.edu</A><LI> Bill Nitzberg <!WA23><A HREF="mailto:nitzberg@nas.nasa.gov"> nitzberg@nas.nasa.gov</A><LI> <!WA24><A HREF="http://www.cs.uoregon.edu/~jwang/">Junying Wang</A> <!WA25><A HREF="mailto:jwang@cs.uoregon.edu"> jwang@cs.uoregon.edu</A><LI> Douglas E Westervelt <!WA26><A HREF="mailto:dwesterv@cs.uoregon.edu"> dwesterv@cs.uoregon.edu</A><LI> <!WA27><A HREF="http://www.cs.uoregon.edu/~kurtw/"> Kurt Windisch</A> <!WA28><A HREF="mailto:kurtw@cs.uoregon.edu"> kurtw@cs.uoregon.edu</A></UL><P><H3>Other Information <A NAME="resources">Resources</A>:</H3>Our <!WA29><A HREF="http://www.cs.uoregon.edu/research/DistributedComputing/notes/index.html">Metacomputing</A> notes and links.<P>Ohter Resources:<UL><LI> Other Supercomputing, Parallel Computing, and High-Performance Computer Architecture <!WA30><A HREF="http://www.cs.cmu.edu/~scandal/research-groups.html"> Research Groups</A><LI> <!WA31><A HREF="http://www.cs.dartmouth.edu/pario.html"> Parallel I/O Archive</A> <LI> <!WA32><A HREF="ftp://ftp.cs.umanitoba.ca/pub/bibliographies/index.html"> Collected CS Bibliographies</A> and a search mechanism, <!WA33><A HREF="http://glimpse.cs.arizona.edu:1994/bib/">Glimpse</A>.<LI> <!WA34><A HREF="http://www.cs.indiana.edu/cstr/search"> Unified CS Tech Report Index</A> - Searchable index of Computer Science Technical Report Abstracts<LI> List of Computer Science <!WA35><A HREF="http://www.rdt.monash.edu.au/tr/siteslist.html"> Technical Report Archive Sites</A>.<LI> <!WA36><A HREF="http://white.nosc.mil/parallel.html">High Performance Computing </A> home page from Planet Earth home page.</UL><HR><P><ADDRESS><I>kurtw@cs.uoregon.edu<BR></ADDRESS></BODY>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?