Results 1  10
of
118
ABSTRACT SEQUENTIAL/PARALLEL HEURISTIC ALGORITHMS
, 2004
"... With advanced submicron technologies, the exponentially increasing number of transistors on a VLSI chip causes placement within physical design automation to become more and more important and consequently extremely complicated and time consuming. This thesis addresses the placement for VLSI stand ..."
Abstract
 Add to MetaCart
standard cell designs. A number of heuristic optimization techniques for placement are studied and implemented, in particular, local search, Tabu Search, Simulated Annealing and Genetic Algorithm. The Tabu Search reduces wire length on average by 52.4 % while Simulated Annealing yields a 61 % improvement
Parallel Delaunay Refinement: Algorithms and Analyses
 In Proceedings, 11th International Meshing Roundtable
, 2002
"... In this paper, we analyze the complexity of natural parallelizations of Delaunay refinement methods for mesh generation. The parallelizations employ a simple strategy: at each iteration, they choose a set of "independent" points to insert into the domain, and then update the Delaunay trian ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
triangulation. We show that such a set of independent points can be constructed efficiently in parallel and that the number of iterations needed is O(log²(L/s)), where L is the diameter of the domain, and s is the smallest edge in the output mesh. In addition, we show that the insertion of each
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
, 2008
"... Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edges in the computed triangulation is highly dependent on the order in which Elimination Game processes the vertices, and in ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and the triangulation resulting from Elimination Game. One of the strengths of the new approach is that is is easily parallelizable, and thus we are able to present the first parallel algorithm to compute such sandwiched minimal triangulations. In addition, the insight that we gain through Elimination Game is used
Parallel Algorithms for Line Generation
"... A new, parallel approach for generating Bresenhamtype lines is developed. Coordinate pairs which approximate straight lines on a square grid are derived from line equations. These pairs serve as a basis for the development of four new parallel algorithms. One of the algorithms uses the fact that st ..."
Abstract
 Add to MetaCart
denotes the number of points generated and n \Gamma 1 is the number of processors in the tree. This compares to O(n) for Bresenham's algorithm executed on a sequential processor. Pipelining can be used to achieve a constant time per line generation as long as line length is less than n. Keywords
Implementing Sequential and Parallel Programs for the Homing Sequence Problem
 Lecture Notes in Computer Science 1260
"... Homing sequences play an important role in the testing of finite state systems and have been used in a number of applications such as hardware faultdetection [7], protocol verification [4], and learning algorithms [11, 3, 1] etc. Here we present a parallel program implementation that finds a homing ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Homing sequences play an important role in the testing of finite state systems and have been used in a number of applications such as hardware faultdetection [7], protocol verification [4], and learning algorithms [11, 3, 1] etc. Here we present a parallel program implementation that finds a
Scalable Load Balancing Strategies for Parallel A* Algorithms
 Journal of Parallel and Distributed Computing
, 1994
"... In this paper, we develop load balancing strategies for scalable highperformance parallel A* algorithms suitable for distributedmemory machines. In parallel A* search, inefficiencies such as processor starvation and search of nonessential spaces (search spaces not explored by the sequential algori ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
In this paper, we develop load balancing strategies for scalable highperformance parallel A* algorithms suitable for distributedmemory machines. In parallel A* search, inefficiencies such as processor starvation and search of nonessential spaces (search spaces not explored by the sequential
An Optimal Parallel Algorithm for Sorting Multisets
"... . In this paper we consider the problem of sorting n numbers such that there are only k distinct values. We present a randomized arbitrary CRCW PRAM algorithm that runs in O(log n) time using n log k log n processors. The algorithm is clearly optimal. The same algorithm runs in O i log n log ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
as in parallel. For sorting n general keys,\Omega\Gamma n log n) is a well known lower bound on the work. When additional information about the keys to be sorted is available, sorting can be done with less work. For instance sorting of n keys where each key is an integer in the range [1; n O(1) ] can
Analyzing Synchronous and Asynchronous Parallel Distributed Genetic Algorithms
 Future Generation Computer Systems
, 2001
"... Parallel genetic algorithms (PGAs) have been traditionally used to extend the power of serial genetic algorithms (GAs), since they often can be tailored to provide a larger efficiency on complex search problems. In a PGA several subalgorithms cooperate in parallel to solve the problem. This highle ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
Parallel genetic algorithms (PGAs) have been traditionally used to extend the power of serial genetic algorithms (GAs), since they often can be tailored to provide a larger efficiency on complex search problems. In a PGA several subalgorithms cooperate in parallel to solve the problem. This high
A Parallel Genetic Algorithm for Floorplan Area Optimization
"... Floorplanning is an important problem in Very LargeScale Integratedcircuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. From the computational point of view, floorplan area minimization is an NPhard problem. This paper presents a parallel g ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
results show that the parallel GA can produce better results than the sequential GA when they use the same amount of computing resources. In addition, since the number of islands and migration interval are two important parameters that directly affect the performance of islandbased parallel GAs
Abstract On the Parallel Cbmplexit~ of ’ lhtrix Factorization.Algorithms*
"... ll;eprove allulllberof negaLive resultsahout practicaf (i.e., numerically accurate) algorithms for certain matrix factorization. In particular. we prow that the popular (;iwns’ method for computing the QR decomposition is inherentl} sequential over the realistic model of floating point arithmetic. W ..."
Abstract
 Add to MetaCart
. We also prove a number of additional results concerning Gaussian Elimination for computing the LIT decon]positiou..iltogether, the results of this paper sllpport the widespread belief that there is a tradeotlbetween palallclism and accuracy in numerical algorithms. 1
Results 1  10
of
118