On the Computing Power of Arrays of Processors with Optical Pipelined Buses

1998 ◽  
Vol 08 (04) ◽  
pp. 503-513
Author(s):  
M. Hamdi ◽  
C. Qiao ◽  
Y. Pan
Keyword(s):  
Parallel Computation ◽  
Computer Systems ◽  
Parallel Computer ◽  
Computing Power ◽  
Time Performance ◽  
Pram Model ◽  
Multiple Processors ◽  
Crcw Pram

This paper examines the computing power of optical parallel computer systems. We consider the proposed Array of Processors with optical Pipelined Buses (APPB) in particular, where processors communicate with each other via a spanning optical bus. APPB allow simultaneous access by multiple processors to the optical bus through message pipelining, thus overcoming the bottlenecks caused by exclusive access when employing electronic buses. We give an overview of this model of parallel computation, and then examine the computing power of APPB by demonstrating its capability to efficiently emulate the CRCW PRAM model. We show that an APPB is almost as powerful as a CRCW PRAM. That is, an APPB can emulate a CRCW PRAM with only a small degradation in time performance.

A SIMPLE PARALLEL ALGORITHM FOR THE SINGLE FUNCTION COARSEST PARTITION PROBLEM

1994 ◽  
Vol 04 (04) ◽  
pp. 437-445 ◽  
Author(s):  
CLIVE N. GALLEY ◽  
COSTAS S. ILIOPOULOS
Keyword(s):  
Parallel Algorithm ◽  
Parallel Computation ◽  
Simple Algorithm ◽  
Partition Problem ◽  
Pram Model ◽  
Single Function ◽  
Crcw Pram

This paper shows a simple algorithm for solving the single function coarsest partition problem on the CRCW PRAM model of parallel computation using O(n) processors in O( log n) time with O(n1+ε) space.

scholarly journals ALGORITHM FOR EFFICIENCY INCREASE OF HETEROGENEOUS MULTI-PROCESSOR COMPUTER SYSTEMS

2016 ◽  
Vol 2016 (2) ◽  
pp. 186-192
Author(s):  
Александр Колпаков ◽  
Aleksandr Kolpakov ◽  
Юрий Кропотов ◽  
Yuriy Kropotov
Keyword(s):  
Parallel Computation ◽  
Computer Systems ◽  
Parallel Computations ◽  
Assessment Method ◽  
Computation Efficiency ◽  
Efficiency Assessment ◽  
Pram Model ◽  
Efficiency Increase ◽  
Assessment Results

In the paper there is considered an algorithm developed on the basis of modified PRAM-model for efficiency increase of parallel computations on specialized computer modules. By means of the efficiency assessment method there were carried out comparative experimental inves-tigations of the algorithm developed. The assessment results of the algorithm for the parallel computation efficiency increase on special computer modules show efficiency increase not less than 2-4 times depending on the number of flows under investigation.

Detection, Averaging, and 3D Reconstruction of Biological Specimens on Hypercubes (Transputer-based) Computers

1990 ◽  
Vol 48 (1) ◽  
pp. 454-455
Author(s):  
Jose-Maria Carazo ◽  
I. Benavides ◽  
S. Marco ◽  
J.L. Carrascosa ◽  
E.L. Zapata
Keyword(s):  
3D Reconstruction ◽  
3D Structure ◽  
Three Dimensional ◽  
Software Tools ◽  
Mapping Method ◽  
Computer Architectures ◽  
Parallel Computer ◽  
Reconstruction Process ◽  
Computing Power ◽  
Order Of Magnitude

Obtaining the three-dimensional (3D) structure of negatively stained biological specimens at a resolution of, typically, 2 - 4 nm is becoming a relatively common practice in an increasing number of laboratories. A combination of new conceptual approaches, new software tools, and faster computers have made this situation possible. However, all these 3D reconstruction processes are quite computer intensive, and the middle term future is full of suggestions entailing an even greater need of computing power. Up to now all published 3D reconstructions in this field have been performed on conventional (sequential) computers, but it is a fact that new parallel computer architectures represent the potential of order-of-magnitude increases in computing power and should, therefore, be considered for their possible application in the most computing intensive tasks.We have studied both shared-memory-based computer architectures, like the BBN Butterfly, and local-memory-based architectures, mainly hypercubes implemented on transputers, where we have used the algorithmic mapping method proposed by Zapata el at. In this work we have developed the basic software tools needed to obtain a 3D reconstruction from non-crystalline specimens (“single particles”) using the so-called Random Conical Tilt Series Method. We start from a pair of images presenting the same field, first tilted (by ≃55°) and then untilted. It is then assumed that we can supply the system with the image of the particle we are looking for (ideally, a 2D average from a previous study) and with a matrix describing the geometrical relationships between the tilted and untilted fields (this step is now accomplished by interactively marking a few pairs of corresponding features in the two fields). From here on the 3D reconstruction process may be run automatically.

An Additive Turbulent Decomposition of the Navier-Stokes Equations Implemented on Highly Parallel Computer Systems

1991 ◽  
Author(s):  
J. M. McDonough ◽  
E. C. Hylin ◽  
Tony F. Chan ◽  
Matthew T. Chan ◽  
Y. Yang ◽  
...  
Keyword(s):  
Stokes Equations ◽  
Computer Systems ◽  
Parallel Computer ◽  
Navier Stokes ◽  
Navier Stokes Equations

SUB-LOGARITHMIC ALGORITHMS FOR THE LARGEST EMPTY RECTANGLE PROBLEM

1993 ◽  
Vol 03 (01) ◽  
pp. 79-85
Author(s):  
STEPHAN OLARIU ◽  
WENHUI SHEN ◽  
LARRY WILSON
Keyword(s):  
Parallel Algorithms ◽  
Erew Pram ◽  
Pram Model ◽  
The Common ◽  
Crcw Pram ◽  
Natural Way

We show that the Largest Empty Rectangle problem can be solved by reducing it, in a natural way, to the All Nearest Smaller Values problem. We provide two classes of algorithms: the first one assumes that the input points are available sorted by x (resp. y) coordinate. Our algorithm corresponding to this case runs in O(log log n) time using [Formula: see text] processors in the Common-CRCW-PRAM model. For unsorted input, we present algorithms that run in [Formula: see text] time using [Formula: see text] processors in the Common-CRCW-PRAM, or in O( log n) time using [Formula: see text] processors in the EREW-PRAM model. No sub-logarithmic time parallel algorithms have been previously reported for this problem.

scholarly journals SeeMore: A kinetic parallel computer sculpture for educating broad audiences on parallel computation

2017 ◽  
Vol 105 ◽  
pp. 183-199 ◽  
Author(s):  
Bo Li ◽  
John Mooring ◽  
Sam Blanchard ◽  
Aditya Johri ◽  
Melinda Leko ◽  
...  
Keyword(s):  
Parallel Computation ◽  
Parallel Computer

scholarly journals SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM

1995 ◽  
Vol 05 (03) ◽  
pp. 273-288 ◽  
Author(s):  
HANS-PETER LENHOF ◽  
MICHIEL SMID
Keyword(s):  
Decision Tree ◽  
Parallel Algorithms ◽  
Dimensional Space ◽  
Decision Tree Model ◽  
Sequential Algorithm ◽  
Tree Model ◽  
Parallel Time ◽  
Parallel Version ◽  
Pram Model ◽  
Crcw Pram

Let S be a set of n points in D-dimensional space, where D is a constant, and let k be an integer between 1 and [Formula: see text]. A new and simpler proof is given of Salowe’s theorem, i.e., a sequential algorithm is given that computes the k closest pairs in the set S in O(n log n+k) time, using O(n+k) space. The algorithm fits in the algebraic decision tree model and is, therefore, optimal. Salowe’s algorithm seems difficult to parallelize. A parallel version of our algorithm is given for the CRCW-PRAM model. This version runs in O((log n)2 log log n) expected parallel time and has an O(n log n log log n+k) time-processor product. Finally, actual running times are given of an implementation of our sequential algorithm.

Sign in / Sign up

Export Citation Format

Share Document