🚀 go-pugleaf

The following is the latest release message for SIS:

*****

The second release of SIS, SIS-1.1,  is available via anonymous ftp
or by ordering a tape from the UCB EECS ILP office.

Instructions for anonymous ftp:

ftp ic.berkeley.edu (the net address for ic is 128.32.132.1)
Name: anonymous
Password: anything
binary
cd pub/sis
get sis-1.1.tar.Z
get sis-1.1.patch1
quit

Note that the file sis-1.1.tar.Z is 5.9 Mbytes.  Benchmark examples
take up a significant amount of memory.  A version without the
examples is in the file sis-1.1.noex.tar.Z (it is 3 Mbytes).

To uncompress and extract the SIS files:

uncompress sis-1.1.tar.Z
tar xf sis-1.1.tar

Instructions for obtaining a tape:

Contact Cindy Manly-Fields in the ILP office (cost is $150):

Cindy Manly-Fields
Software Distribution Office
EECS/ERL Industrial Liaison Program
479 Cory Hall
University of California at Berkeley
Berkeley, CA  94720

(510) 643-6687
cindy@hera.berkeley.edu

After the tape has been obtained, uncompress and extract the
SIS files as described above.  Within the top level directory:

The file README contains information about compiling and running SIS,
getting help, and sending comments/bugs/suggestions to the authors.

The file RELEASE-NOTES-1.1 contains information about this release of
SIS, including updates and new packages.

The file SIS-paper.ps is a paper describing all the sequential
optimization and synthesis techniques in SIS, as well as updates to
the combinational techniques.  For a full description of combinational
algorithms, see the combinational references in this paper.  SIS-paper.ps
also has examples for synchronous and asynchronous design, and descriptions
of the BLIF (Berkeley Logic Interchange Format for netlists) and GENLIB
(format for library gates) formats.

All comments/questions/bugs should be sent to sis@ic.berkeley.edu.

-- 
Ellen M. Sentovich
Dept of EECS
UC Berkeley
ellen@ic.Berkeley.EDU