Linear array with a reconfigurable pipelined bus system - Concepts and applications

Authors:
Yi Pan;Keqin Li
Affiliations:
Department of Computer Science, University of Dayton, Dayton, OH 45469-2160, USA;Department of Mathematics and Computer Science, State University of New York, New Paltz, NY 12561-2499, USA
Venue:
Information Sciences: an International Journal
Year:
1998

Citing 25
Cited 18

Array processor with multiple broadcasting

Journal of Parallel and Distributed Computing
Using Coincident Optical Pulses for Parallel Memory Addressing

Computer
Space multiplexing of waveguides in optically interconnected multiprocessor systems

The Computer Journal - Special issue on object-oriented programming
Constant time sorting on a processor array with a reconfigurable bus system

Information Processing Letters
Meshes with reconfigurable buses

Proceedings of the fifth MIT conference on Advanced research in VLSI
Pipelined communications in optically interconnected arrays

Journal of Parallel and Distributed Computing
Fast computer vision algorithms for reconfigurable meshes

Image and Vision Computing
Wavelength Division Multiple Access Channel Hypercube Processor Interconnection

IEEE Transactions on Computers
Optically interconnected processor arrays with switching capability

Journal of Parallel and Distributed Computing
Singular value decomposition on processor arrays with a pipelined bus system

Journal of Network and Computer Applications
Parallel computation: models and methods

Parallel computation: models and methods
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses

IEEE Transactions on Parallel and Distributed Systems
Digital Picture Processing

Digital Picture Processing
Three-Dimensional Optical Architecture and Data-Parallel Algorithms for Massively Parallel Computing

IEEE Micro
Time-Division Optical Communications in Multiprocessor Arrays

IEEE Transactions on Computers
Efficient Algorithms for the Hough Transform on Arrays with Reconfigurable Optical Buses

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Efficient matrix operations in a reconfigurable array with spanning optical buses

FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Exploiting Precise Delay in Optical Multiprocessor Interconnects

MPPOI '95 Proceedings of the Second Workshop on Massively Parallel Processing Using Optical Interconnections
Communication-efficient algorithms on reconfigurable array of processors with spanning optical buses

ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System

ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
(C) Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses

ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2
Computation and communication aspects of arrays with optical pipelined buses

Computation and communication aspects of arrays with optical pipelined buses
Constant Time Graph and Poset Algorithms on the Reconfigurable Multiple Bus Machine

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 03
Finding Maximum on an Array Processor with a Global Bus

IEEE Transactions on Computers
Mesh-Connected Computers with Broadcasting

IEEE Transactions on Computers

Parallel Algorithms for Median Filtering on Arrays with Reconfigurable Optical Buses

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Fast and Scalable Parallel Matrix Computations with Optical Buses

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Fast Sorting on a Linear Array with a Reconfigurable Pipelined Bus System

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Efficient Graph Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Computing Distance Maps Efficiently Using an Optical Bus

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
On Parallel Generation of t-Ary Trees in an Associative Model

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
A New Computation of Shape Moments via Quadtree Decomposition

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Fast All Nearest Neighbor Algorithms from Image Processing Perspective

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Constant time fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system

Journal of Parallel and Distributed Computing
Computing on the restricted LARPBS model

ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
An efficient sequence alignment algorithm on a LARPBS

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Fast and highly scalable parallel computations for fundamental matrix problems on distributed memory systems

The Journal of Supercomputing
simulating a PR-mesh on an larpbs

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fast sequence similarity computing with LCS on LARPBS

ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Fast scalable algorithm on LARPBS for sequence alignment

ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Constant time algorithms for the 3-d all nearest neighbor problem on the LARPBS

PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Fast parallel algorithms for the longest common subsequence problem using an optical bus

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.07

Visualization

Abstract

A new computational model, called a linear array with a reconfigurable pipelined bus system (LARPBS), has been proposed as a feasible and efficient parallel computational model based on current optical technologies. In this paper, we further study this model by proposing several basic data movement operations on the model. These operations include broadcast, multicast, compression, split, binary prefix sum, maximum finding. Using these basic operations, several image processing algorithms are also presented for the model. We show that all algorithms can be executed efficiently on the LARPBS model. It is our hope that the LARPBS model can be used as a new and practical parallel computational model for designing parallel algorithms.