Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!uwm.edu!ogicse!emory!hubcap!chi
From: chi@ccng.waterloo.edu (Yipo Chi)
Newsgroups: comp.parallel
Subject: Help wanted
Message-ID: <8217@hubcap.clemson.edu>
Date: 2 Mar 90 21:37:20 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 20
Approved: parallel@hubcap.clemson.edu

Can anybody out there help send me a task graph for partitioning
test. This graph had better have more than 1000 nodes (the more the
better, say, up to 10,000 or 50,000). For instance,
the  graph can be a logic circuit used for distributed simulation.
The specification may be in the form of:

m, k
a, b, w1,
c, d, w2,
........

where m is the number of nodes in the graph (say, process graph)
k is the groups to be partitioned (maybe corresponding to the
number of processors in a multiprocessor),
w1 is the weight (communication) between node a and b.
a, b, c, d ... are node numbers. w1, w2, ... are weights

Thanks in advance.

-- Yipo Chi