Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site wateng.UUCP
Path: utzoo!watmath!wateng!ksbszabo
From: ksbszabo@wateng.UUCP (Kevin Szabo)
Newsgroups: net.lsi,wat.vlsi
Subject: Re: I need a reference for the `Picket Fence Algorithm'
Message-ID: <2216@wateng.UUCP>
Date: Wed, 27-Mar-85 20:43:14 EST
Article-I.D.: wateng.2216
Posted: Wed Mar 27 20:43:14 1985
Date-Received: Thu, 28-Mar-85 01:50:32 EST
References: <2199@wateng.UUCP>
Distribution: net
Organization: VLSI Group, U of Waterloo
Lines: 21
Xref: watmath net.lsi:98 wat.vlsi:91

> Some time ago I read a paper on a compaction algorithm.
> The algorithm was known as `picket fence', and it was
> utilitized in the compaction of virtual grid symbolic layouts.
> I believe the paper was describing work at MCNC, possibly
> part of the VIVID project (i.e. had some ABCD stuff thrown
> in). Other keywords: mulga, virtual grid, compaction ...

I didn't get a response for this request but I found the reference at
last! The algorithm wasn't called `picket fence', it was called
`Virtual Grid Compaction Using The Most Recent Layers Algorithm'.
You can find it in ICCAD-83, IEEE International Conference on Computer
Aided Design, by Neil Weste and David G. Boyer.  My guess at
MCNC and ABCD were correct. The picket fence stuff was part of the
explanation of the article ... authors take note, people remember your
examples, not your titles!

		Thanks to everybody who tried to help,

				Kevin
-- 
Kevin Szabo  watmath!wateng!ksbszabo (U of Waterloo VLSI Group, Waterloo Ont.)