Topic
Serial computer
About: Serial computer is a research topic. Over the lifetime, 73 publications have been published within this topic receiving 1310 citations.
Papers published on a yearly basis
Papers
IBM1
TL;DR: Modifications to the standard simulated annealing method for circuit placement are explored which make it more suitable for use on a shared-memory parallel computer and allow the parallel algorithms to deviate from the algorithm defined for a serial computer.
Abstract: We explore modifications to the standard simulated annealing method for circuit placement which make it more suitable for use on a shared-memory parallel computer. By employing chaotic approaches we allow the parallel algorithms to deviate from the algorithm defined for a serial computer and thus obtain good execution efficiencies for large numbers of processors. The qualitative behavior of the parallel algorithms is comparable to that of the serial algorithm.
79 citations
TL;DR: State-of-the-art SVD computation schemes using large arrays of parallel processors that improve the computation speed linearly and quadratically are discussed and a comparison is made between the computationspeed and the number of arithmetic units required for various parallel architecture schemes as well as with the traditional serial computer.
Abstract: Several researchers have suggested characterising a power system voltage collapse using the singularity of the Jacobian of the network descripter load-flow equations. It has been proposed to use the minimum singular value of the Jacobian as a security index for monitoring how closely a power system is operating to a voltage instability. However, a singular value decomposition (SVD) computation is an iterative process with a number of arithmetic operations proportional to the cubic power of the matrix size. State-of-the-art SVD computation schemes using large arrays of parallel processors that improve the computation speed linearly and quadratically are discussed. A comparison is made between the computation speed and the number of arithmetic units required for various parallel architecture schemes as well as with the traditional serial computer. >
60 citations
TL;DR: A novel method to parallelize high-order compact numerical algorithms for the solution of three-dimensional PDEs in a space?time domain that is driven by a communication and computation schedule instead of the usual “creative programming” approach is proposed.
45 citations
TL;DR: This paper discusses a number of algorithms for solving the transonic full-potential equation in conservative form on a vector computer, such as the CDC STAR-100 or the CRAY-1, and several of these more promising schemes are described.
Abstract: This paper discusses a number of algorithms for solving the transonic full-potential equation in conservative form on a vector computer, such as the CDC STAR-100 or the CRAY-1. Recent research with the 'artificial density' method for transonics has led to development of some new iteration schemes which take advantage of vector-computer architecture without suffering significant loss of convergence rate. Several of these more promising schemes are described and 2-D and 3-D results are shown comparing the computational rates on the STAR and CRAY vector computers, and the CYBER-175 serial computer. Schemes included are: (1) Checkerboard SOR, (2) Checkerboard Leapfrog, (3) odd-even vertical line SOR, and (4) odd-even horizontal line SOR.
32 citations
1 Jan 1979
TL;DR: In this article, a number of algorithms for solving the transonic full-potential equation in conservative form on a vector computer, such as the CDC STAR-100 or the CRAY-1, are discussed.
Abstract: This paper discusses a number of algorithms for solving the transonic full-potential equation in conservative form on a vector computer, such as the CDC STAR-100 or the CRAY-1. Recent research with the 'artificial density' method for transonics has led to development of some new iteration schemes which take advantage of vector-computer architecture without suffering significant loss of convergence rate. Several of these more promising schemes are described and 2-D and 3-D results are shown comparing the computational rates on the STAR and CRAY vector computers, and the CYBER-175 serial computer. Schemes included are: (1) Checkerboard SOR, (2) Checkerboard Leapfrog, (3) odd-even vertical line SOR, and (4) odd-even horizontal line SOR.
27 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 1 |
| 2020 | 2 |
| 2019 | 1 |
| 2015 | 2 |
| 2014 | 1 |
| 2013 | 1 |