Machine buffer sizing based on the theory of constraint principles and the tabu search technique

2004 ◽  
Vol 218 (12) ◽  
pp. 1825-1832 ◽  
Author(s):  
S Apolloni ◽  
M Lando ◽  
M Savino
Keyword(s):  
Tabu Search ◽  
Search Technique ◽  
Buffer Sizing ◽  
Theory Of Constraint

scholarly journals Two-dimensional Placement Using Tabu Search

VLSI Design ◽  
2001 ◽  
Vol 12 (1) ◽  
pp. 13-23
Author(s):  
John M. Emmert ◽  
Dinesh K. Bhatia
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Optimization Technique ◽  
Vlsi Design ◽  
Two Dimensional ◽  
Search Technique ◽  
Quality Of Results ◽  
Circuit Performance ◽  
Speed Up

Search based placement of modules is an important problem in VLSI design. It is always desired that the search should converge quickly to a high quality solution. This paper presents a tabu search based optimization technique to place modules on a regular two-dimensional array. The goal of the technique is to speed up the placement process. The technique is based on a two-step placement strategy. The first step is targeted toward improving circuit routability and the second step addresses circuit performance. The technique is demonstrated through placement of several benchmark circuits on academic as well as commercial FPGAs. Results are compared to placements generated by commercial CAE tools and published simulated annealing based techniques. The tabu search technique compares favorably to published simulated annealing based techniques, and it demonstrates an average execution time speedup of 20 with no impact on quality of results when compared to commercial tools.

BWR fuel reloads design using a Tabu search technique

2004 ◽  
Vol 31 (2) ◽  
pp. 151-161 ◽  
Author(s):  
Alejandro Castillo ◽  
Gustavo Alonso ◽  
Luis B. Morales ◽  
Cecilia Martı́n del Campo ◽  
J.L. François ◽  
...  
Keyword(s):  
Tabu Search ◽  
Search Technique

A TABU SEARCH APPROACH TO POLYGONAL APPROXIMATION OF DIGITAL CURVES

2000 ◽  
Vol 14 (02) ◽  
pp. 243-255 ◽  
Author(s):  
PENG-YENG YIN
Keyword(s):  
Tabu Search ◽  
Compression Ratio ◽  
Error Tolerance ◽  
Approximation Methods ◽  
Optimal Solutions ◽  
Polygonal Approximation ◽  
Search Technique ◽  
Computation Cost ◽  
Memory Store ◽  
Search Approach

Most of the previous polygonal approximation methods are sub-optimal and their compression ratio with respect to a given error tolerance is not good enough for some applications. Recently, a genetic-based approach which can provide near-optimal solutions is presented, but the demands on computation and memory are too high. In this paper, a new polygonal approximation method using the tabu search technique is presented. The proposed method produces a higher compression ratio than the suboptimal approach and the genetic-based approach, and the computation cost and the memory store are more efficient.

Sign in / Sign up

Export Citation Format

Share Document