Results 211 to 220 of about 1,103,162 (263)
Some of the next articles are maybe not open access.
A parallel standard cell placement algorithm
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1997We present a loosely coupled parallel algorithm for the placement of standard cell integrated circuits. Our algorithm is a derivative of simulated annealing. The implementation of our algorithm is targeted toward networks of Unix workstations. This is the very first reported parallel algorithm for standard cell placement which yields as good or better ...
Wern-Jieh Sun, Carl Sechen
openaire +1 more source
Towards Standard Nested Parallelism
2000Several generalizations of the flat data parallel model have been proposed. Their aim is to allow the capability of nested parallel invocations, combining the easiness of programming of the data parallel model with the efficiency of the control parallel model.
Jesus A. González +6 more
openaire +1 more source
AN EFFICIENT PARALLEL SORTING COMPATIBLE WITH THE STANDARD QSORT
International Journal of Foundations of Computer Science, 2009The main contribution of this paper is to present an efficient parallel sorting "psort" compatible with the standard qsort. Our parallel sorting "psort" is implemented such that its interface is compatible with "qsort" in C Standard Library. Therefore, any application program that uses standard "qsort" can be accelerated by simply replacing "qsort ...
Duhu Man, Yasuaki Ito, Koji Nakano
openaire +1 more source
OpenMP: a parallel standard for the masses
IEEE Concurrency, 1998The author considers how the recent release of OpenMP could finally shove parallel software applications out of the domain of high-performance scientific research and analysis, and onto the desktop. By supporting cross-platform, directive-based programming, the OpenMP application programming interface will simplify the development of parallel ...
openaire +1 more source
Parallel global routing for standard cells
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990The potential speedup of a standard cell global router using a general-purpose multiprocessor is investigated. LocusRoute, a global routing algorithm for standard cells, and its parallel implementation are presented. The uniprocessor speed and quality of LocusRoute is comparable to modern global routers.
openaire +1 more source
Parallel adders using standard plas
1978 IEEE 4th Symposium onomputer Arithmetic (ARITH), 1978PLA adders are described that add in one cycle and require a reasonable number of product terms for an 8, 16, or even a 32-bit adder. A procedure is also described for minimizing the number of product terms for any size adder.
openaire +1 more source
Parallel global routing algorithms for standard cells
Proceedings 11th International Parallel Processing Symposium, 2002In this paper, we propose three different parallel algorithms based on a state-of-the-art global router called TimberWolfSC. The parallel algorithms have been implemented by using the Message Passing Interface (MPI), and have been evaluated on a wide range of parallel platforms such as the Sun SparcCenter 1000 and the Intel Paragon.
Zhaoyun Xing +2 more
openaire +1 more source
Standard FORTRAN 77 as a parallel language
Parallel Computing, 1988There have been many attempts to use FORTRAN as a language environment for parallel processing. In each case either the standard has been violated or some facilities have been left lacking and in most cases both. This paper briefly examines some of the approaches to parallel processing in the FORTRAN environment, provides an interpretation of the ...
openaire +1 more source
THE PARALLEL PERFORMANCE OF STANDARD PARABOLIC MARCHING SCHEMES
International Journal of High Speed Computing, 1991We compare standard parallel algorithms for solving linear parabolic partial differential equations. The comparison is based on the combined effect of their numerical properties and their parallel performance. We discuss the classical explicit methods (forward Euler, Heun and DuFort-Frankel), the standard implicit methods (BDF1, BDF2 and Crank-Nicolson)
Stefan Vandewalle +2 more
openaire +1 more source