http:^^www.cis.ufl.edu^~ranka^
来自「This data set contains WWW-pages collect」· EDU^~RANKA^ 代码 · 共 483 行 · 第 1/2 页
EDU^~RANKA^
483 行
Date: Thu, 21 Nov 1996 20:19:30 GMT
Server: Stronghold/1.3.2 Ben-SSL/1.3 Apache/1.1.1
Content-type: text/html
Set-Cookie: Apache=gs3521511848607570696; path=/
<HEAD><TITLE>The Sanjay Ranka Home Page</TITLE></HEAD><BODY><P><P><!WA0><img SRC="http://www.cis.ufl.edu/~ranka/ranka.gif" ALT="my photo"><P><!WA1><A href="http://www.cis.ufl.edu/~ranka/aboutme.html"><b>Sanjay Ranka</b></A>,Associate Professor, Department of CISE, University of Florida <P><!WA2><A HREF="http://www.cis.ufl.edu/~ranka/COT/index.html"> COT 6930 - Parallel Computing</A><P>This page has been visited <!WA3><IMGSRC="http://www.cise.ufl.edu/cgi-bin/cgiwrap/~toli/cot5405_count.pl?OTHERS/ranka">times since 10/15/96.<p><b>Research Interests</b>Compilers and Software Environments for Parallel Machines, Design and Analysis of Parallel Algorithms, Models of Parallel Computation, High Performance Computing, Neural Networks.<p><b>First Workshop on Solving Irregular Problemson Distributed Memory Machines</b><!WA4><A href="http://www.cis.ufl.edu/~ranka/ipps.html"> Proceedings</A><p><b>Second Workshop on Solving Irregular Problemson Distributed Memory Machines</b><!WA5><A href="http://www.cis.ufl.edu/~ranka/ipps2.html"> Proceedings</A><p><b>Recent Talks</b><!WA6><A href="http://www.cis.ufl.edu/~ranka/hpf.ps">Scalable Runtime Support for HPF-1 and HPF-2</A>,HPFF Meeting, Houston, Jan 30, 1995.<p><b>Recent Professional Activities</b><OL><LI> 1993--present, Member, Editorial Board, Journal of Parallel and Distributed Computing,(Subject Area Editor: Algorithms and Scientific Computing)<LI>1993--present, Member, Message Passing Interface (MPI) standard<LI>1993, Workshop Organizer, ARPA Runtime Support Group, SyracuseUniversity, May 1993<LI>1993, Member, Program Committee, Symposium on High PerformanceDistributed Computing<LI>1993, Workshop Organizer, Runtime Support for Parallel Compilers,Supercomputing 93<LI>1994, Member, Program Committee, International Conference onPattern Recognition, Subconference on Parallel Computing<LI>1994, Member, Program Committee, Scalable High-Performance ComputingConference<LI>1994, Session Chair, Scalable High-Performance ComputingConference<LI>1995,Program Committee, Frontiers of Massively Parallel Computation<LI> 1995, Session Chair, Frontiers of Massively Parallel Computation<LI>1995, Tutorials Chair, Frontiers of Massively Parallel Computation<LI>1995, Workshop Organizer, International Parallel Processing Symposium, Solving Irregular Problems on Distributed MemoryMachines<LI>1995, Program Committee, International Parallel Processing Symposium<LI>1995, Session Chair, International Parallel Processing Symposium<LI>1995, Program Committee, Irregular 1995<LI>1995, Program Committee, International Conference on ParallelProcessing<LI>1995, Program Committee, International Conference on High PerformanceComputing</OL><hr><b>Recent reports</b>The following are some of the reports which have been recently submittedto journals/conferences. <OL><LI>Ibraheem Al-furiah, Srinivas Aluru, Sanjay Goil andSanjay Ranka, <!WA7><a href="ftp://ftp.cise.ufl.edu/pub/faculty/ranka/tree.ps">Parallel Construction of Multidimensional Binary Search Trees</a><LI>Ibraheem Al-furiah, Srinivas Aluru, Sanjay Goil andSanjay Ranka <!WA8><a href="ftp://ftp.cise.ufl.edu/pub/faculty/ranka/selection.ps">Practical Algorithms for Selectionon Coarse-Grained Parallel Computers</a><LI>J. Lee, S. Ranka, R. Shankar,<!WA9><a href="ftp://ftp.cise.ufl.edu/pub/faculty/ranka/ExternalRedistribution.ps.Z">Communication-Efficient and Memory-bounded External Redistribution </a>,technical report, Computer Science Department, Syracuse University.<LI>M. Kaddoura and S. Ranka,Runtime Support for Data Parallel Applications forAdaptive and Non-Uniform Computational Environments<LI>C. T. Chiu, K. Mehrotra, C. K. Mohan, and S. Ranka.Fault Tolerance of Neural Networks.</OL><hr><p><b></b><hr><b>SPRINT</b></A>: Scalable graph Partitioning, Refinement and INcremental graph partitioning Techniques for computational grids <P>The goal of this project is to develop fast as well asparallel graph partitioners and incremental graph partitioners for solving unstrucutured and adaptive applications on parallel machinesand a cluster of workstations (which represents an adaptiveand non-uniform computational environment).<p><OL><LI>C. W. Ou and S. Ranka, SPRINT Software Verstion 1.0, under preparation.<LI>C. W. Ou and S. Ranka,Parallel Incremental Graph Partitioning,<i>IEEE Transactions on Parallel and DistributedSystems</i>, to appear (a preliminary version appeared in Proceedingsof Supercomputing 94).<LI>C. W. Ou and S. Ranka.Parallel Remapping Algorithms for Adaptive Problems, <i>Frontiers' 95 </i>.<LI>Chao-Wei Ou, S. Ranka, and G. Fox.<!WA10><a href="ftp://ftp.cise.ufl.edu/pub/faculty/ranka/Mapping.ps.Z">Fast and Parallel Mapping Algorithms for Irregular and Adaptive Problems</a>, <i> Journal of Supercomputing</i>(a preliminary version appeared in<!WA11><a href="ftp://ftp.cise.ufl.edu/pub/faculty/ranka/icpads.ps.Z"><i>Proceedings of International Conference on Paralleland Distributed Systems</i></a>, <LI>H. S. Maini, K. G. Mehrotra, C. K. Mohan, and S. Ranka.Genetic Algorithms for Graph Partitioning and IncrementalGraph Partitioning, <i>Supercomputing '94</i>. November 1994. <LI>M. Kaddoura, C. W. Ou, and S. Ranka.Mapping Unstructured Computational Graphs for Adaptive andNon-Uniform Computational Environments, <i> IEEE PDT </i>, September 1995.<LI>Chao-Wei Ou, Manoj Gunwani, and Sanjay Ranka,<!WA12><a href="ftp://ftp.cise.ufl.edu/pub/faculty/ranka/ArchitectureIndependent.ps.Z">Architecture-Independent Locality-Improving Transformations ofComputational Graphs </a>,<i>Proceedings of ICS'95 </i>.</OL><hr><b>SCARAB</b></A>: Scalable Algorithms for Random Accesses in Bulk Word SCARAB (SKAR'uhb) n.<p>Definition --n. 1. A scarabaeid beetle, esp. Scarabaeus sacer,regarded as sacred by the ancient Egyptians. 2. A representation of aSCARAB beetle, as a ceramic or stone sculpture, used in ancientEgypt as a talisman and a symbol of the soul.<p>We are developing scalable algorithms and software for the basic communication anddata access primitives for Parallelization of Unstructured, Adaptive and Hierarchical Applications </A> and Runtime support for data parallel languages suchas High Performance Fortran.<OL><LI>S. Bae and S. Ranka.A Comparison of Different Message-Passing Paradigmsfor the Parallelization of Two Irregular Applications,{\it Journal of Supercomputing}, to appear.( A prelimary version appeared as <!WA13><a href="ftp://ftp.cise.ufl.edu/pub/faculty/ranka/Frontiers95.ps.Z"> Experimental Evaluation of Different Message Paradigms on the CM-5 for Irregular Problems</a>, <i>Frontiers '95</i>)<LI> S. Ranka, J. C. Wang, and M. Kumar. Personalized Communication Avoiding Node Contention on DistributedMemory Systems,<i>International Conference on Parallel Processing</i>, August 1993,vol. 1, pp. 241-244.i (a revised version <a Irregular PErsonalized Communication on Distributed Memory Machineshref="ftp://ftp.cise.ufl.edu/pub/faculty/ranka/IrregularPersonalized_JPDC.ps.Z"></a>,appeared in <i>Journal of Parallel and Distributed Computing</i>.<LI>S. Ranka, J. C. Wang, and G. C. Fox.Static and Runtime Scheduling of All-to-ManyPersonalized Communication on Permutation Networks,<i>Proceedings of 1992 International Conference on Parallel and Distributed Systems</i>, pp. 211-218. ( a revised version<a"ftp://ftp.cise.ufl.edu/pub/faculty/ranka/UnstructuredCommunicationIEEE.ps.Z">Static and Runtime Scheduling of All-to-ManyPersonalized Communication on Permutation Networks</a>,<i>IEEE Transactions on Parallel and Distributed Systems</i>, Novemeber1994).<LI>J. C. Wang, T. H. Lin, and S. Ranka.Distributed Scheduling of Unstructured Communication,{\it Parallel Processing Letters. (Special Issue on Partitioning andScheduling)}, December 1995, to appear (A prelimary version appearedasDistributed Scheduling of Unstructured Communication on the CM-5,<i>Proceedings of HICSS</i>, 1993).<LI>Ravi V. Shankar and Sanjay Ranka.<!WA14><a href="ftp://ftp.cise.ufl.edu/pub/faculty/ranka/RandomDataAccess1.ps.Z">Random Data Accesses on a Coarse-grained Parallel MachineI. One-to-one Mappings </a>.submitted to <i> Journal of Parallel and Distributed Computing </i>.(an earlier version appears as R. V. Shankar and S. Ranka.Performing Dynamic Permutations on a Coarse-Grained Parallel Machine,<i>First International Workshop on Parallel Processing</i>, Bangalore,India, December 1994.) <LI>Ravi V. Shankar and Sanjay Ranka.<!WA15><a href="ftp://ftp.cise.ufl.edu/pub/faculty/ranka/RandomDataAccess2.ps.Z">Random Data Accesses on a Coarse-grained Parallel MachineII. One-to-many and Many-to-one Mappings </a>.submitted to <i> Journal of Parallel and Distributed Computing </i>(an earlier version appears as R. V. Shankar and S. Ranka.Performing Dynamic Permutations on a Coarse-Grained Parallel Machine,<i>Proceedings of Symposium of Parallel and Distributed Processing </i>)⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?