Space multiplexing of waveguides in optically interconnected multiprocessor systems
The Computer Journal - Special issue on object-oriented programming
Parallel algorithms: design and analysis
Parallel algorithms: design and analysis
An introduction to parallel algorithms
An introduction to parallel algorithms
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
The Journal of Supercomputing - Special issue: high performance computing systems
IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system—concepts and applications
Information Sciences: an International Journal - special issue on parallel and distributed processing
Solving graph theory problems using reconfigurable pipelined optical buses
Parallel Computing
IEEE Transactions on Parallel and Distributed Systems
Efficient Parallel and Distributed Topological Sort Algorithms
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
(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
Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System
The Journal of Supercomputing
Computers and Electrical Engineering
| Hi-index | 0.00 |
Topological sort of an acyclic graph has many applications such as job scheduling and network analysis. Due to its importance, it has been tackled on many models. Dekel et al. [3], proposed an algorithm for solving the problem in O(log2 N) time on the hypercube or shuffle-exchange networks with O(N3) processors. Chaudhuri [2], gave an O(log N) algorithm using O(N3) processors on a CRCW PRAM model. On the LARPBS (Linear Arrays with a Reconfigurable Pipelined Bus System) model, Li et al. [5] showed that the problem for a weighted directed graph with N vertices can be solved in O(log N) time by using N3 processors. In this paper, a more efficient topological sort algorithm is proposed on the same LARPBS model. We show that the problem can be solved in O(log N) time by using N3/log N processors. We show that the algorithm has better time and processor complexities than the best algorithm on the hypercube, and has the same time complexity but better processor complexity than the best algorithm on the CRCW PRAM model.