Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!samsung!uunet!ncrlnk!ncrcae!hubcap!byrd
From: byrd@portia.Stanford.EDU (Greg Byrd)
Newsgroups: comp.parallel
Subject: Re: Pairing applications and architectures
Summary: isoefficiency functions
Message-ID: <7040@hubcap.clemson.edu>
Date: 14 Nov 89 20:13:23 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 17
Approved: parallel@hubcap.clemson.edu

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