Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!uakari.primate.wisc.edu!brutus.cs.uiuc.edu!apple!excelan!unix!hplabs!hp-sdd!ncr-sd!ncrcae!hubcap!kumar
From: kumar@umn-cs.CS.UMN.EDU (Vipin Kumar)
Newsgroups: comp.parallel
Subject: Re: Pairing applications and architectures
Summary: isoefficiency functions
Message-ID: <7237@hubcap.clemson.edu>
Date: 29 Nov 89 18:09:59 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 43
Approved: parallel@hubcap.clemson.edu

In article <7040@hubcap.clemson.edu>, byrd@portia.Stanford.EDU (Greg Byrd) writes:
> In article <7020@hubcap.clemson.edu> watmath!alberta!chang@uunet.uu.net writes:
> >
> >Does anyone know of work done in pairing applications and
> >parallel architectures ?  More precisely, I'm looking for
> >methodologies to characterize applications and architectures,
> >and identifying good matches between the two sets. 
> 
> 
> Vipin Kumar's "isoefficiency functions" might be useful. See:
> 
> V. Kumar and V. N. Rao, "Parallel Depth First Search: Part II --
>    Analysis," _International_Journal_of_Parallel_Programming_,
>    Vol. 16, No. 6, December 1987, pp. 501-519.
> 
> 
> 
> ...Greg


For a revised version of the above paper, see:

       AUTHOR = "Vipin Kumar and V. N. Rao",
       TITLE = "Scalable Parallel Formulations of Depth-First Search",
       EDITOR = "Vipin Kumar and P. S. Gopalakrishnan and Laveen Kanal",
       BOOKTITLE = "Parallel Algorithms for Machine Intelligence and Vision",
       PUBLISHER = "Springer-Verlag",
       ADDRESS = "New York",
       YEAR = "February, 1990 (to apear)"
       }

For other reports/papers on isoefficiency analysis, write/send mail to:


US Mail: Dr. Vipin Kumar
         Associate Professor
         Computer science Department
         University of Minnesota
         Minneapolis, MN 55455

Tel: 612-624-8023
Arpanet: kumar@umn-cs.cs.umn.edu
FAX:612-625-4583


Brought to you by Super Global Mega Corp .com