Newsgroups: comp.parallel.pvm
Path: ukc!uknet!pipex!howland.reston.ans.net!gatech!swrinde!sgiblab!cs.uoregon.edu!reuter.cse.ogi.edu!netnews.nwnet.net!serval!raghu!tlee
From: tlee@raghu.eecs.wsu.edu (Tong-yee Lee - EECS (CPTS541))
Subject: Re: FAQ, pvm
Message-ID: <1994May10.150137.27656@serval.net.wsu.edu>
Sender: news@serval.net.wsu.edu (USENET News System)
Organization: ^
References: <CpJAKy.26I@cnn.nas.nasa.gov>
Date: Tue, 10 May 94 15:01:37 GMT
Lines: 25

Hi:

  I like to find some benchmark applications appearing in many previous
  papers. If these application was writeen in PVM or other parallel
  languages, it is great.

  1. component label problem:  Divide and conquer solution for the
     "component labeling problem".
  2. N_queens: A program to find all n*n chess boards on which n queens 
     are put, so that no two queens hold each other in check.
  3. Wang:  Wang's algorithm for solving a tri-diagonal system of linear
     equations.
  4. Schedule: A program to find the optimal schedule of a set of jobs
     on a number of processors. Implemented as a parallel tree search
     algoorithm.
 

  Please tell me where to find them and contact me at <tlee@eecs.wsu.edu>
  Your great help will be very appreciated.

  Best Regards,

  Tony



