Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
Full metadata record
|dc.identifier.citation||Journal of Supercomputing, 2003; 24(3):251-258||en|
|dc.description||The original publication is available at www.springerlink.com||en|
|dc.description.abstract||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. , proposed an algorithm for solving the problem in O(log2 N) time on the hypercube or shuffle-exchange networks with O(N 3) processors. Chaudhuri , gave an O(log N) algorithm using O(N 3) processors on a CRCW PRAM model. On the LARPBS (Linear Arrays with a Reconfigurable Pipelined Bus System) model, Li et al.  showed that the problem for a weighted directed graph with N vertices can be solved in O(log N) time by using N 3 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 N 3/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.||en|
|dc.description.statementofresponsibility||Jie Li, Yi Pan and Hong Shen||en|
|dc.publisher||Kluwer Academic Publ||en|
|dc.subject||analysis of algorithms; graph problem; massive parallelism; optical bus; time complexity||en|
|dc.title||More efficient topological sort using reconfigurable optical buses||en|
|pubs.library.collection||Computer Science publications||en|
|dc.identifier.orcid||Shen, H. [0000-0002-3663-6591]||en|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.