✦ LIBER ✦

Parallel algorithms for corner stitching

✍ Scribed by Mehta, Dinesh P.; Wilson, Erica D.

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 252 KB
Volume: 10
Category: Article
ISSN: 1040-3108
DOI: 10.1002/(sici)1096-9128(19981225)10:15<1317::aid-cpe419>3.0.co;2-4

No coin nor oath required. For personal study only.

✦ Synopsis

Corner stitching is the underlying data structure that is used to represent rectangular objects in interactive VLSI layout editing systems such as Magic and Tailor. In this paper we develop efficient algorithms for basic corner stitching operations under the message-passing paradigm. These algorithms were implemented using C and PVM on a distributed network composed of SUN workstations. Experimental results show that significant speed-ups were obtained. ©1998

📜 SIMILAR VOLUMES

Parallel algorithms for semi-lagrangian

Parallel algorithms for semi-lagrangian advection

✍ A. V. Malevsky; S. J. Thomas 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 2 views

Numerical time step limitations associated with the explicit treatment of advection-dominated problems in computational ¯uid dynamics are often relaxed by employing Eulerian±Lagrangian methods. These are also known as semi-Lagrangian methods in the atmospheric sciences. Such methods involve backward

Parallel algorithms for multicomponent s

Parallel algorithms for multicomponent separation calculations

✍ R. Wait; J. Landauro 📂 Article 📅 1988 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 444 KB 👁 1 views

Parallel algorithms for a singularly per

Parallel algorithms for a singularly perturbed parabolic problem

✍ Igor Boglaev 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB 👁 2 views

This article deals with iterative algorithms for domain decomposition applied to the solution of a singularly perturbed parabolic problem. These algorithms are based on finite difference domain decomposition methods and are suitable for parallel computing. Convergence properties of the algorithms ar

EDITORIAL SPECIAL ISSUE ON PARALLEL ALGO

EDITORIAL SPECIAL ISSUE ON PARALLEL ALGORITHMS FOR CONTROL

✍ F. M. F. Gaston 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 33 KB 👁 2 views

Within control there is an ever-increasing demand for more and more computation to be performed in less and less time. Not only are applications faster, but more complex algorithms are being used to control them, and recently non-linear control algorithms are becoming more commonplace. However, if s

The parallel downhill simplex algorithm

The parallel downhill simplex algorithm for unconstrained optimisation

✍ COETZEE, LOUIS; BOTHA, ELIZABETH C. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

In this paper we present a parallel implementation of a well-known heuristic optimisation algorithm (the downhill simplex algorithm developed by Nelder and Mead in 1965) which is well suited for unconstrained optimisation. We present the sequential algorithm as well as the parallel algorithm which w

Parallel implementation of a ray tracing

Parallel implementation of a ray tracing algorithm for distributed memory parallel computers

✍ Lee, Tong-Yee; Raghavendra, C. S.; Nicholas, John B. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 3 views

Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr