A Shared Memory Parallel Algorithm for Logic Synthesis

2005 ◽  
Author(s):  
Chieng-Fai Lim ◽  
P. Banerjee ◽  
K. De ◽  
S. Muroga
Keyword(s):  
Parallel Algorithm ◽  
Shared Memory ◽  
Logic Synthesis

An Efficient Parallel Algorithm for Rectangular Packing Based on Bintree Expression

1996 ◽  
Author(s):  
Aihu Wang ◽  
Jianzhong Cha ◽  
Jinmin Wang
Keyword(s):  
Computational Complexity ◽  
Problem Solving ◽  
Parallel Algorithm ◽  
Shared Memory ◽  
Optimal Packing ◽  
Packing Process ◽  
Left Corner ◽  
Rectangular Packing ◽  
Packing Scheme ◽  
Sequential Decomposition

Abstract In this paper, a method using bintree structure to express the states of the packing space of rectangular packing is proposed. Through the sequential decomposition of the packing space, the optimal packing scheme of various sized rectangular packing can be obtained by every time putting the optimal piece that satisfies specular conditions toward the current packing space and by locating it at the up-left corner of the current packing space. Different optimal packing schemes that satisfy different demands can be obtained by adjusting the values of the ordering factors KA and KB. A parallel algorithm based on SIMD-CREW shared-memory computer is designed through the analysis of the parallelism of the bintree expression. The whole packing process is clearly expressed by the bintree. The computational complexity of the algorithm is shown to be O(n2logn). Both the experimental results and the comparison with other sequential packing algorithms have proved that the parallel packing algorithm is efficient. What is more, it nearly doubles the problem solving speed.

scholarly journals Area Optimization of Slicing Floorplans in Parallel

VLSI Design ◽  
1994 ◽  
Vol 2 (2) ◽  
pp. 143-156
Author(s):  
Cheng-Hsi Chen ◽  
Ioannis G. Tollis
Keyword(s):  
Parallel Algorithms ◽  
Parallel Algorithm ◽  
Shared Memory ◽  
Distributed System ◽  
Sequential Algorithm ◽  
Area Optimization

We first present a parallel algorithm for finding the optimal implementations for the modules of a slicing floorplan that respects a given slicing tree. The algorithm runs in O(n) time and requires O(n) processors, where n is the number of modules. It is based on a new O(n2) sequential algorithm for solving the above problem. We then present a parallel algorithm for finding a set of optimal implementations for a slicing floorplan whose corresponding slicing tree has height O(logn). This algorithm runs in O(n) time using O(logn) processors. Our parallel algorithms do not need shared memory and can be implemented in a distributed system.

scholarly journals An implementation of ray tracing algorithm for the multiprocessor machines

2006 ◽  
Vol 16 (1) ◽  
pp. 125-135 ◽  
Author(s):  
Aleksandar Samardzic ◽  
Dusan Starcevic ◽  
Milan Tuba
Keyword(s):  
Parallel Algorithm ◽  
Ray Tracing ◽  
Shared Memory ◽  
Parallel Machines ◽  
Lighting Condition ◽  
Posix Threads ◽  
Scene Description ◽  
Tracing Algorithm

Ray Tracing is an algorithm for generating photo-realistic pictures of the 3D scenes, given scene description, lighting condition and viewing parameters as inputs. The algorithm is inherently convenient for parallelization and the simplest parallelization scheme is for the shared-memory parallel machines (multiprocessors). This paper presents two implementations of the algorithm developed by the authors for alike machines, one using the POSIX threads API and another one using the OpenMP API. The paper also presents results of rendering some test scenes using these implementations and discusses our parallel algorithm version efficiency.

The MPI and OpenMP Implementation of Parallel Algorithm for Generating Mandelbrot Set

2014 ◽  
Vol 571-572 ◽  
pp. 26-29
Author(s):  
Xiang Wei Duan ◽  
Wei Chang Shen ◽  
Jun Guo
Keyword(s):  
Parallel Algorithm ◽  
Shared Memory ◽  
Message Passing ◽  
Message Passing Interface ◽  
Algorithm Design ◽  
Performance Testing ◽  
Mandelbrot Set ◽  
The Difference ◽  
And Performance

The paper introduce the Mandelbrot Set and the message passing interface (MPI) and shared-memory (OpenMP), analyses the characteristic of algorithm design in the MPI and OpenMP environment, describes the implementation of parallel algorithm about Mandelbrot Set in the MPI environment and the OpenMP environment, conducted a series of evaluation and performance testing during the process of running, then the difference between the two system implementations is compared.

scholarly journals Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines

1989 ◽  
Vol 18 (2) ◽  
pp. 216-228 ◽  
Author(s):  
Gianfranco Bilardi ◽  
Alexandru Nicolau
Keyword(s):  
Parallel Algorithm ◽  
Shared Memory

Hybrid image classification and parameter selection using a shared memory parallel algorithm

2007 ◽  
Vol 33 (7) ◽  
pp. 875-897 ◽  
Author(s):  
Rhonda D. Phillips ◽  
Layne T. Watson ◽  
Randolph H. Wynne
Keyword(s):  
Image Classification ◽  
Parallel Algorithm ◽  
Shared Memory ◽  
Parameter Selection

A parallel algorithm for stiffness matrix assembling in a shared memory environment

2000 ◽  
Vol 76 (5) ◽  
pp. 593-602 ◽  
Author(s):  
Marcelo Novaes De Rezende ◽  
Joao Batista de Paiva
Keyword(s):  
Parallel Algorithm ◽  
Shared Memory ◽  
Stiffness Matrix
Sign in / Sign up

Export Citation Format

Share Document