The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2010 vol.21)
pp: 303-312
Min He , California State University Long Beach, Long Beach
Xiaolong Wu , California State University Long Beach, Long Beach
Si Qing Zheng , University of Texas at Dallas, Richardson
Burkhard Englert , California State University Long Beach, Long Beach
ABSTRACT
In recent years, many researchers have investigated optical interconnections as parallel computing. Optical interconnections are attractive due to their high bandwidth and concurrent access to the bus in a pipelined fashion. The Linear Array with Reconfigurable Pipelined Bus System (LARPBS) model is a powerful optical bus system that combines both the advantages of optical buses and reconfiguration. To increase the scalability of the LARPBS model, we propose a two-dimensional extension: a simplified two-dimensional Array with Reconfigurable Pipelined Bus System (2D ARPBS). While achieving better scalability, we show the effectiveness of this newly proposed model by designing two novel optimal sorting algorithms on this model. The first sorting algorithm is an extension of Leighton's seven-phase columnsort algorithm that eliminates the restriction of sorting only an r \times s array, where r \ge s^2 , and sorts an n \times n array in O(\log n) time. The second one is an optimal multiway mergesort algorithm that uses a novel processor efficient two-way mergesort algorithm and a novel multiway merge scheme to sort n^2 items in O(\log n) time. Using an optimal sorting algorithm Pipelined Mergesort designed for the LARPBS model as a building block, we extend our research on parallel sorting on the LARPBS to a more scalable 2D ARPBS model and achieve optimality in both sorting algorithms.
INDEX TERMS
Interconnection networks, optical networks, parallel algorithms and architectures, sorting.
CITATION
Min He, Xiaolong Wu, Si Qing Zheng, Burkhard Englert, "Optimal Sorting Algorithms for a Simplified 2D Array with Reconfigurable Pipelined Bus System", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 3, pp. 303-312, March 2010, doi:10.1109/TPDS.2009.68
REFERENCES
[1] S. Sahni, "Models and Algorithms for Optical and Optoelectronic Parallel Computers," Int'l J. Foundations of Computer Science, vol. 12, no. 3, pp. 249-264, 2001.
[2] C. Qiao and R. Melhem, "Time-Division Optical Communications in Multiprocessor Arrays," IEEE Trans. Computers, vol. 42, no. 5, pp. 577-590, May 1993.
[3] Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster, "The Power of Reconfiguration," J. Parallel and Distributed Computing, vol. 13, no. 2, pp. 139-153, 1991.
[4] R. Miller, V.K. Prasanna-Kumar, D. Reisis, and Q.F. Stout, "Meshes with Reconfigurable Buses," IEEE Trans. Computers, vol. 42, pp. 678-692, 1993.
[5] Y. Pan and K. Li, "Linear Array with Reconfigurable Pipelined Bus System—Concepts and Applications," J. Information Science, vol. 106, nos. 3/4, pp. 237-258, 1998.
[6] S. Rajasekaran and S. Sahni, "Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 11, pp. 1123-1132, Nov. 1997.
[7] Y. Pan, K.Q. Li, and S.Q. Zheng, "Fast Nearest Neighbor Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System," Parallel Algorithms and Applications, vol. 13, pp. 1-25, 1998.
[8] Y. Pan and M. Hamdi, "Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System," Proc. Second Int'l Symp. Parallel Architectures, Algorithms, and Networks, pp. 313-319, 1996.
[9] Y. Pan, M. Hamdi, and K. Li, "Efficient and Scalable Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System," Future Generation Computer Systems, vol. 13, pp. 501-513, 1998.
[10] A. Datta, S. Soundaralakshmi, and R. Owens, "Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp. 212-222, Mar. 2002.
[11] M. He and S.Q. Zheng, "An Optimal Sorting Algorithm on a Linear Array with Reconfigurable Pipelined Bus System," Proc. 15th ISCA Int'l Conf. Parallel and Distributed Computing Systems, pp. 386-391, 2002.
[12] A.G. Bourgeois and J.L. Trahan, "Fault Tolerant Algorithms for a Linear Array with a Reconfigurable Pipelined Bus System," Parallel Algorithms Appl., vol. 18, no. 3, pp. 139-153, 2003.
[13] A. Datta and S. Soundaralakshmi, "Fast and Scalable Algorithms for the Euclidean Distance Transform on a Linear Array with a Reconfigurable Pipelined Bus System," J. Parallel and Distributed Computing, vol. 64, no. 3, pp. 360-369, 2004.
[14] A.G. Bourgeois, Y. Pan, and S.K. Prasad, "Constant Time Fault Tolerant Algorithms for a Linear Array with a Reconfigurable Pipelined Bus System," J. Parallel and Distributed Computing, vol. 65, no. 3, pp. 374-381, 2005.
[15] S. Babvey, A.G. Bourgeois, J.A. Fernandez-Zepeda, and S.W. Mclaughlin, "A Parallel Implementation of the Message-Passing Decoder of LDPC Codes Using a Reconfigurable Optical Model," Proc. Sixth Int'l Conf. Software Eng., Artificial Intelligence, Networking and Parallel/Distributed Computing and First Int'l Workshop Self-Assembling Wireless Networks, pp. 288-293, 2005.
[16] M. Arock and R. Ponalagusamy, "Parallel Algorithms for Robot Path Planning with Simpler VLSI Architecture," Int'l J. Computer Applications in Technology, vol. 26, no. 3. pp. 157-163, 2006.
[17] D. Semé and S. Youlou, "Repetitions Detection on a Linear Array with Reconfigurable Pipelined Bus System," Int'l J. Parallel, Emergent, and Distributed Systems, vol. 22, no. 3, pp. 173-183, 2007.
[18] Y.R. Wang, "An Efficient O(1) Time 3D All Nearest Neighbor Algorithm from Image Processing Perspective," J. Parallel and Distributed Computing, vol. 67, no. 10, pp. 1082-1091, 2007.
[19] L. Chen, Y. Pan, and X.H. Xu, "Scalable and Efficient Parallel Algorithms for Euclidean Distance Transform on the LARPBS Model," IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 11, pp. 975-982, Nov. 2004.
[20] J.L. Trahan, Y. Pan, R. Vaidyanathan, and A.G. Bourgeois, "Scalable Basic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System," Proc. Int'l Conf. Parallel and Distributed Computing Systems, pp. 564-569, 1997.
[21] J.L. Trahan, A.G. Bourgeois, Y. Pan, and R. Vaidyanathan, "Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses," J. Parallel and Distributed Computing, vol. 60, no. 9, pp. 1125-1136, 2000.
[22] B.J. D'Auriol and R. Molakaseema, "A Parameterized Linear Array with a Reconfigurable Pipelined Bus System: LARPBS(p)," The Computer J., vol. 48, no. 1, pp. 115-125, 2005.
[23] R. Vaidyanathan, J.L. Trahan, and C. Lu, "Degree of Scalability: Scalable Reconfigurable Mesh Algorithms for Multiple Addition and Matrix-Vector Multiplication," Parallel Computing, vol. 29, no. 1, pp. 95-109, 2003.
[24] D.M. Chiarulli, S.P. Levitan, R.G. Melhem, M. Bidnurkar, R. Ditmore, G. Gravenstreter, Z. Guo, C. Qiao, M. Sakr, and J.P. Teza, "Optoelectronic Buses for High-Performance Computing," Proc. IEEE, vol. 82, no. 11, pp. 1701-1709, Nov. 1994.
[25] J.L. Trahan, A.G. Bourgeois, and R. Vaidyanathan, "Tighter and Broader Complexity Reconfigurable Models," Parallel Processing Letters, vol. 8, pp. 271-282, 1998.
[26] M.C. Pinotti and S.Q. Zheng, "Efficient Parallel Computation on a Processor Array with Pipelined TDM Optical Buses," Proc. 12th ISCA Int'l Conf. Parallel and Distributed Computing Systems, pp. 114-120, 1999.
[27] Y. Li, J. Tao, and S.Q. Zheng, "A Symmetric Processor Array with Synchronous Optical Buses and Switches," Parallel Processing Letters, vol. 8, no. 3, pp. 283-295, 1998.
[28] C. Qiao, "On Designing Communication-Intensive Algorithms for a Spanning Optical Bus-Based Array," Parallel Processing Letters, vol. 5, no. 3, pp. 499-511, 1995.
[29] Z. Guo, "Optically Interconnected Processor Arrays with Switching Capability," J. Parallel and Distributed Computing, vol. 23, pp. 314-329, 1994.
[30] M. Ajtai, J. Komlos, and E. Szemeredi, "An $O$ ($n$ log $n$ ) Sorting Network," Proc. 15th Ann. ACM Symp. Theory of Computing, pp. 1-9, 1983.
[31] M.S. Paterson, "Improved Sorting Networks with O(log$N$ ) Depth," Algorithmica, vol. 5, nos. 1-4, pp. 75-92, 1990.
[32] R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, no. 4, pp. 1431-1442, 1988.
[33] S. Levitan, D. Chiarulli, and R. Melhem, "Coincident Pulse Techniques for Multiprocessor Parallel Computing," Applied Optics, vol. 29, no. 14, pp. 2024-2039, 1990.
[34] A.G. Bourgeois and J.L. Trahan, "Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined Buses," Int'l J. Foundations of Computer Science, vol. 11, no. 4, pp. 553-571, 2000.
[35] J.A. Fernandez-Zepeda, R. Vaidyanathan, and J.L. Trahan, "Scaling Simulation of the Fusing-Restricted Reconfigurable Mesh," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 861-871, Sept. 1998.
[36] K. Li, Y. Pan, and S.Q. Zheng, Parallel Computing Using Optical Interconnections. Kluwer Academic Publishers, 1998.
[37] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
[38] S. Olariu, C. Pinotti, and S.Q. Zheng, "An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device," IEEE Trans. Computers, vol. 49, no. 12, pp. 1310-1324, Dec. 2000.
43 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool