This file describes the detail about Parallel Cell Placement
Experimental System.(92/7/15)

Application Domain : Knowledge Processing

Name : Standard Cell Placement Experimental System

Overview : Experimental system to get optimum placement in standard
cell LSI design

Machine : Multi-PSI,PIM

Environment : PIMOS,SIMPOS

Language : KL1,ESP

Source Code : 750KB(KL1),570KB(ESP)

Features $B!'(B

This experimental system is constructed to examine the efficiency of
parallel processing applied to LSI design problems and to search and
develop a parallel algorithm.  The Parallel Simulated Annealing (SA)
algorithm, developed by ICOT, is adopted to obtain optimum
configurations. Parallel SA is obtained by expanding sequential SA
that are known to solve the combinatorial optimization problem.

Configuration :

	  $B(#(!(!(!(!(!(!(!(!(!(!(!(!(!($(B       $B(#(!(!(!(!(!(!(!(!(!(!(!(!(!($(B
	  $B("(Bcircuit/cell data parser  $B("(B       $B("(B                          $B("(B
	  $B("(Bplacement initializer     $B("(!(!(!(B $B("(B Placement Improver 	   $B("(B
	  $B("(Bexecution monitor         $B("(B       $B("(B (Parallel SA processing) $B("(B
	  $B("(Bresult display/editor     $B("(B       $B("(B              	           $B("(B
	  $B(&(!(!(!(!(!(!(!(!(!(!(!(!(!(%(B       $B(&(!(!(!(!(!(!(!(!(!(!(!(!(!(%(B

Functions :
	$B!&(BDecides the physical position of each cell in standard cell
	  LSI design with the aim to minimize the total estimated wire
	  length in the chip.
	$B!&(BDisplays the result cell placement graphically and also the
	  estimated value and approximate channel density.
	$B!&(BParameters can be set to arbitrary values to search and
          examine the performance of parallel SA algorithm.
	$B!&(BMonitors the procedure of parallel SA by displaying the
	  energy on a line graph.  
	$B!&(BSuspension and the re-execution can be done if necessary,
	  and allow the user to edit a placement using the graphic interface.

Documents :
	See the installation and manipulation manual to install and
	manipulate the system.
	The file names are "install.man" and "manipulate.man".

References:
	[1] K. Kimura and K. Taki.
	    Time-homogeneous Parallel Annealing Algorithm.
	    In Proc. IMACS'91, 1991. pp. 827-828.
	[2] C.Sechen, and A.Sangiovanni-Vincentelli,
	    The TimberWolf Placement and Routing Package, 
	    IEEE Journal of Solid-State Circuits, vol.SC-20, no.2,
	    1985, pp.510-522.

