A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Singular value decomposition on processor arrays with a pipelined bus system
1996
Journal of Network and Computer Applications
Preserved Fulltext
The algorithms are designed for optically interconnected multiprocessor systems where pipelined optical buses are used to connect processors. ...
Analysis of the parallel computation times of the SVD algorithms shows that they are asymptotically equivalent to those implemented on the hypercube while using substantially less hardware. ...
SVD on 2-D arrays with pipelined optical buses The 1-D array with a single pipelined optical bus has certain limitations [23] . ...
doi:10.1006/jnca.1996.0016
fatcat:sic4vyvadvesfduwpvvfb3dwee
MODELS AND ALGORITHMS FOR OPTICAL AND OPTOELECTRONIC PARALLEL COMPUTERS
2001
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
This paper briefly reviews some of the more popular parallel-computer models-pipelined optical bus, optical transpose interconnect system (OTIS), and partitioned optical passive stars (POPS) network-that ...
The interconnect topology and some simple algorithms for each model are also described. ...
The resulting parallel computer model is called onedimensional array with pipelined buses (1D APPB) [8] . ...
doi:10.1142/s0129054101000473
fatcat:y6ipq2i3szgvpawf3jem3drav4
Synthesis of application-specific heterogeneous multiprocessor systems (abstract)
1992
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We will first describe the pipeline structure of our processor and analyze its performance and compare it to typical RISC-style pipeline structures given the context of a processor with multiple functional ...
Next we shall study the performance effects of various bypassing schemes in terms of their effectiveness in resolving pipeline data hazards and their effect on the processor cycle time. ...
Message Pipelining on Opticul Buses Pipelined optical buses take advantage of two unique properties of optical signal transmissions in waveguides: unidirectional propagation and predictable path delays ...
doi:10.1145/146628.140538
fatcat:p6hrkpvy7zdtfcawrsrrolbiwi
Pipelining and bypassing in a VLIW processor
1994
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We will first describe the pipeline structure of our processor and analyze its performance and compare it to typical RISC-style pipeline structures given the context of a processor with multiple functional ...
Next we shall study the performance effects of various bypassing schemes in terms of their effectiveness in resolving pipeline data hazards and their effect on the processor cycle time. ...
Message Pipelining on Opticul Buses Pipelined optical buses take advantage of two unique properties of optical signal transmissions in waveguides: unidirectional propagation and predictable path delays ...
doi:10.1109/71.285612
fatcat:jrxjrviylfbvdicvhp6pnr2jmu
Parallel Algorithms for String Matching Problem on Single and Two Dimensional Reconfigurable Pipelined Bus Systems
2007
Journal of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It has one extra pair of switches for the convenience of row bus reconfiguration and column bus reconfiguration. ...
We considered string matching on LARPBS and 2D LARPBS. This has applications such as string databases, cellular automata and computational biology. ...
ACKNOWLEDGEMENTS We would like to thank our colleagues in the Department of Computer Science and Computer applications for their advice and helpful discussions. ...
doi:10.3844/jcssp.2007.754.759
fatcat:y6cmqmutdfea5kwc5cjhelbi5a
Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus
2002
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
AbstractÐThe Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) is a newly introduced parallel computational model, where processors are connected by a reconfigurable optical bus. ...
To our best knowledge, this is the best deterministic selection algorithm on any model with a reconfigurable optical bus. ...
Several slightly different versions of such a system have been proposed in the literature, including the array processors with pipelined buses (APPB) [7] , [16] , the array processors with pipelined ...
doi:10.1109/tc.2002.1009153
fatcat:msi3h7kunffl3ht5wtam35ysv4
Pipelined communications in optically interconnected arrays
1991
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The first is a linear pipeline with enhanced control strategies which make optimal use of the available communication bandwidth of the optical bus. ...
The second is a two-dimensional architecture in which processors are placed in a square grid and interconnected to one another through horizontal and vertical pipelined optical buses. ...
LINEAR ARRAY PROCESSORS WITH PIPELINED BUSES In the system of Fig. 1 left, another optical bus is used, as shown in Fig. 3a . ...
doi:10.1016/0743-7315(91)90130-2
fatcat:hsevn53zlbaxhmopgp6nlcg2bi
Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system
1998
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The main contributions of the paper are as follows: We develop five matrix multiplication algorithms with varying degrees of parallelism on the LARPBS computing model, namely, MM 1 ...
We present efficient parallel matrix multiplication algorithms for linear arrays with reconfigurable pipelined bus systems (LARPBS). ...
ACKNOWLEDGMENTS The authors are grateful to the four anonymous reviewers whose criticism and constructive comments helped to improve the presentation of the paper. ...
doi:10.1109/71.706044
fatcat:vjjmcce5wfhazjny54geootpbe
Solving graph theory problems using reconfigurable pipelined optical buses
2000
Parallel Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We solve a number of important and interesting problems from graph theory on a linear array with a recon®gurable pipelined optical bus system. ...
Our algorithms are based on fast matrix multiplication and extreme value ®nding algorithms, and are currently the fastest algorithms. ...
A linear array with a recon®gurable pipelined bus system (LARPBS) consists of x processors P 1 , P 2 Y F F F Y P N connected by a pipelined optical bus. ...
doi:10.1016/s0167-8191(99)00126-x
fatcat:3c5nlovinbbazkq3kgdbqxsf7i
Solving graph theory problems using reconfigurable pipelined optical buses
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We solve a number of important and interesting problems from graph theory on a linear array with a recon®gurable pipelined optical bus system. ...
Our algorithms are based on fast matrix multiplication and extreme value ®nding algorithms, and are currently the fastest algorithms. ...
A linear array with a recon®gurable pipelined bus system (LARPBS) consists of x processors P 1 , P 2 Y F F F Y P N connected by a pipelined optical bus. ...
doi:10.1007/bfb0097976
fatcat:ny3kn2hqmbaytkdrxepwacya3e
A Fast Efficient Parallel Hough Transform Algorithm on LARPBS
2004
Journal of Supercomputing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A parallel algorithm for Hough transform on a linear array with reconfigurable pipeline bus system (LARPBS) is presented. ...
We also illustrate how to partition data and perform the algorithm on a LARPBS with fewer than mn 2 processors, and hence show that the algorithm is highly scalable. ...
A constant-time Hough transform algorithm on a 3D AROB (array with reconfigurabl optical buses) using n 2 m processors is presented in [14] . ...
doi:10.1023/b:supe.0000026850.06646.3c
fatcat:j4i7mmqkmffn5aej5zdcd2i2oy
Efficient Parallel Algorithms for Hierarchical Clustering on Arrays with Reconfigurable Optical Buses
2000
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
In this paper, with the advantages of both optical transmission and electronic computation, we design efficient parallel hierarchical clustering algorithms on the arrays with reconfigurable optical buses ...
Recently, based on the MST of a proximity matrix, Tsai and Horng et al. [37] also proposed an O(log 2 N) time parallel algorithm on the processor array with a reconfigurable bus system (PARBS) using N ...
THE COMPUTATION MODEL A linear array processors with pipelined optical buses (1-D APPB) [8] of size N contains N processors connected to the optical bus with two couplers. ...
doi:10.1006/jpdc.2000.1644
fatcat:wszduwuf4jbgneabkslcu4zcia
Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses
2000
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
This algorithm extends naturally to one for routing h-relations optimally in O(h) steps. We also establish the equivalence of the three models: linear array with a reconfigurable pipelined bus system, ...
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus. ...
MODEL DESCRIPTIONS A system with an optically pipelined bus uses optical waveguides instead of electrical buses to transfer information among processors. ...
doi:10.1006/jpdc.2000.1643
fatcat:bfgabd4fdnhydgwvbzp4u2vdd4
Fast Parallel Algorithms for the Longest Common Subsequence Problem Using an Optical Bus
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To the best of our knowledge this is the fastest and cost-optimal parallel algorithm for LCS problem on array architectures. ...
For two sequences of lengths m and n, the algorithm uses p processors and costs O(mn/p) computation time where 1 ≤ p ≤ max{m, n}. ...
Conclusions In this paper, we present a parallel algorithm on LARPBS for computing the length of the longest common subsequence of two given sequences. ...
doi:10.1007/11424857_37
fatcat:i6vf26djkfgc7jt3wwchuk2exq
Reconfigurable Architectures and Algorithms: A Research Survey
2009
International Journal of Computer Science and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is a powerful model of computation in which communication pattern between the processors could be changed during the execution. ...
Ever since the introduction of the Dynamically Reconfigurable Buses, the architecture gained a lot of popularity amongst the researchers and scientists for its high performance computing with general purpose ...
In Section 5 algorithms development on Linear Arrays with Reconfigurable Pipelined Bus System (LARPBS), Array with Reconfigurable Optical Buses (AROB) and CD-PARBS are discussed. ...
dblp:journals/ijcsa/WankarA09
fatcat:4ge43cflzjfgrnd6uggrs7hb3u
« Previous
Showing results 1 — 15 out of 747 results