Advertisement

Basic Data Movement Operations on the LARPBS Model

Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 468)

Abstract

Linear array with a reconfigurable pipelined bus system (LARPBS) is a parallel computational model designed based on fiber optics. Many algorithms have been designed for the model by several research groups, and the results show that most of the algorithms can be executed efficiently on the LARPBS model. In this chapter, the main features of the LARPBS model are introduced and several basic data movement operations on the model are described. The scalability issue of the model is also addressed via demonstrating scalable algorithms on the model. Finally, its relation to other similar models is also discussed.

Keywords

Reference Pulse Address Frame Conditional Delay Select Pulse Message Frame 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Upper Saddle River, New Jersey, 1997.Google Scholar
  2. [2]
    S. G. Akl, J. W. Baker, and Y. Pan, eds., Special Issue on Computing on Bus-Based Architectures of Parallel Processing Letters, 1998.Google Scholar
  3. [3]
    A. F. Benner, H. F. Jordan, and V. P. Heuring, “Digital optical computing with optically switched directional couplers,” Optical Engineering, vol. 30,no. 12, pp. 1936–1941, 1991.CrossRefGoogle Scholar
  4. [4]
    D. Ben-Asher, A. Gordon, A. Schuster, “Efficient self-simulation algorithms for reconfigurable arrays,” Journal of Parallel and Distributed Computing, vol. 30,no. 1, pp. 1–22, 1995.CrossRefGoogle Scholar
  5. [5]
    S. H. Bokhari, “Finding maximum on an array processor with a global bus,” IEEE Trans. on Computers, vol. C-32,no. 2, pp. 133–139, 1984.Google Scholar
  6. [6]
    D. Chiarulli, R. Melhem, and S. Levitan, “Using coincident optical pulses for parallel memory addressing,” IEEE Computer, vol. 20,no. 12, pp. 48–58, 1987.Google Scholar
  7. [7]
    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,” Proceedings of IEEE, vol. 82,no. 11, pp. 1701–1709, Nov. 1994.CrossRefGoogle Scholar
  8. [8]
    B. Cong, “Mapping of ANNs on linear array with a reconfigurable pipelined bus system,” Proc. of 1997 International Conference on Parallel and Distributed Processing Techniques and Applications, June 30–July 3, 1997, Las Vegas, USA, pp. 522–529.Google Scholar
  9. [9]
    P. W. Dowd, “Wavelength division multiple access channel hypercube processor interconnection,” IEEE Trans. on Computers, vol. 41,no. 10, pp. 1223–1241, Oct. 1992.CrossRefGoogle Scholar
  10. [10]
    Z. Guo, R. Melhem, R. Hall, D. Chiarulli, and S. Levitan, “Pipelined communication in optically interconnected arrays,” Journal of Parallel and Distributed Computing, vol. 12,no. 3, pp. 269–282, 1991.CrossRefGoogle Scholar
  11. [11]
    Z. Guo, “Sorting on array processors with pipelined buses,” 1992 International Conference on Parallel Processing, pp. 289–292, St. Charles, IL, Aug. 17–21, 1992.Google Scholar
  12. [12]
    Z. Guo, “Optically interconnected processor arrays with switching capability,” Journal of Parallel and Distributed Computing, vol. 23, pp. 314–329, 1994.CrossRefGoogle Scholar
  13. [13]
    M. Hamdi, “Communications in optically interconnected parallel computer systems,” in Interconnection Networks and Mapping and Scheduling Parallel Computations, ed. by D.F. Hsu, A.L. Rosenberg, and D. Sotteau, pp. 181–200, American Mathematical Society, 1995.Google Scholar
  14. [14]
    M. Hamdi and Y. Pan, “Efficient parallel algorithms on optically interconnected array of processors,” IEE Proceedings — Computers and Digital Techniques, vol. 142,no. 2, pp. 87–92, March 1995.CrossRefGoogle Scholar
  15. [15]
    M. Hamdi and Y. Pan, “Communication-efficient algorithms on reconfigurable array of processors with spanning optical buses,” Proc. of IEEE International Symposium on Parallel Architectures, Algorithms, and Networks, pp. 440–446, June 12–14, 1996.Google Scholar
  16. [16]
    H. F. Jordan, “Exploiting precise delay in optical multiprocessor interconnects,” Proc. of the 2nd International Conference on Massively Parallel Processing Using Optical Interconnections, p. 357, October 1995.Google Scholar
  17. [17]
    M. A. Karim and M. A. G. Abushagur, eds., Special Issue on Optical Computing of Optics and Laser technology, vol. 26,no. 4, 1994.Google Scholar
  18. [18]
    H. Kimm, “Inversion number algorithm on a linear array with a reconfigurable pipelined bus system,” Proc. of 1996 International conference on Parallel and Distributed Processing Techniques and Applications, pp. 1398–1408, Sunnyvale, CA, August 9–11, 1996.Google Scholar
  19. [19]
    L. Kucera, “Parallel computation and conflicts in memory access,” Information Processing Letters, vol. 14, pp. 93–96, 1982.MATHCrossRefMathSciNetGoogle Scholar
  20. [20]
    V. Prasanna Kumar and C. S. Raghavendra, “Array processor with multiple broadcasting,” J. Parallel Distributed Computing, vol. 4,no. 2, pp. 173–190, Apr. 1987.CrossRefGoogle Scholar
  21. [21]
    S. Levitan, D. Chiarulli, and R. Melhem, “Coincident pulse techniques for multiprocessor interconnection structures,” Applied Optics, vol. 29,no. 14, pp. 2024–2039, 1990.CrossRefGoogle Scholar
  22. [22]
    K. Li, “Constant time boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system,” Journal of Supercomputing, vol. 11,no. 4, pp. 391–403, 1997.CrossRefGoogle Scholar
  23. [23]
    K. Li, Y. Pan, and S. Q. Zheng, “Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system,” to appear in IEEE Transactions on Parallel and Distributed Systems.Google Scholar
  24. [24]
    K. Li, Y. Pan, and S. Q. Zheng, “Fast and efficient parallel matrix computations on a linear array with a reconfigurable pipelined optical bus system,” in High Performance Computing Systems and Applications, Jonathan Schaeffer and Ron Unrau, eds., Kluwer Academic Publishers, Boston, USA, 1998.Google Scholar
  25. [25]
    Y. Li, Yi Pan and S.Q. Zheng, “Pipelined time-division multiplexing optical bus with conditional delays,” Optical Engineering, vol. 36,no. 9, pp. 2417–2424, September 1997.CrossRefGoogle Scholar
  26. [26]
    R. Lin and S. Olariu, eds., Special Issue on High Performance Bus-Based VLSI Architectures of VLSI Design, 1997.Google Scholar
  27. [27]
    A. Louri, “Three-dimensional optical architecture and data-parallel algorithms for massively parallel computing,” IEEE Micro, vol. 11,no. 2, pp. 24–81, April 1991.CrossRefGoogle Scholar
  28. [28]
    R. Melhem, D. Chiarulli, and S. Levitan, “Space multiplexing of waveguides in optically interconnected multiprocessor systems,” The Computer Journal, vol. 32,no. 4, pp. 362–369, 1989.CrossRefGoogle Scholar
  29. [29]
    R. Melhem and D. Chiarulli, eds., Special Issue on Optical Computing and Interconnection Systems of Journal of Parallel and Distributed Computing, vol. 17,no. 3, 1993.Google Scholar
  30. [30]
    R. Miller, V. K. Prasanna-Kumar, D. Reisis, and Q.F. Stout, “Meshes with Reconfigurable Buses,” MIT Conference on Advanced Research in VLSI, pp. 163–178, 1988.Google Scholar
  31. [31]
    R. Miller and A. Schuster, eds., Special Issue on Dynamically Reconfigurable Architectures of Parallel Processing Letters, vol. 5,no. 1, pp. 1–124, 1995.Google Scholar
  32. [32]
    K. Nakano, T. Masuzawa, and N. Tokura, “A sublogarithmic time sorting algorithm on a reconfigurable array,” IEICE Transactions, vol. E 74,no. 11, pp. 3894–3901, November 1991.Google Scholar
  33. [33]
    S. Olariu, J. L. Schwing, and J. Zhang, “On the power of two-dimensional processor arrays with reconfigurable bus systems,” Parallel Processing Letters, vol. 1,no. 1, pp. 29–34, 1991.CrossRefGoogle Scholar
  34. [34]
    S. Olariu, J. L. Schwing, and J. Zhang, “Fast computer vision algorithms on reconfigurable meshes,” Image and Vision Computing Journal, vol. 10,no. 9, pp. 610–616, November 1992.CrossRefGoogle Scholar
  35. [35]
    S. Olariu, ed., Special Issue on Algorithms for Enhanced Mesh Architectures of Journal of Parallel Algorithms and Applications, vol. 8, 1996.Google Scholar
  36. [36]
    Y. Pan, “Hough transform on arrays with an optical bus,” Fifth ISMM International conference on Parallel and Distributed Computing and Systems, pp. 161–166, Pittsburgh, PA, October 1–3, 1992.Google Scholar
  37. [37]
    Y. Pan, “Order statistics on optically interconnected multiprocessor systems,” Proc. of the First International Workshop on Massively Parallel Processing Using Optical Interconnections, pp. 162–169, Cancun, Mexico, April 26–27, 1994.Google Scholar
  38. [38]
    Y. Pan and M. Hamdi, “Quicksort on a linear array with a reconfigurable pipelined bus system,” Proc. of IEEE International Symposium on Parallel Architectures, Algorithms, and Networks, pp. 313–319, June 12–14, 1996.Google Scholar
  39. [39]
    Y. Pan and M. Hamdi, “Singular value decomposition on processor arrays with a pipelined bus system,” Journal of Network and Computer Applications, vol. 19,no. 3, pp. 235–248, July 1996. A preliminary version also appeared in 1993 ACM Symposium on Applied Computing, pp. 525–532.CrossRefGoogle Scholar
  40. [40]
    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,no. 6, pp. 501–513, 1998.CrossRefGoogle Scholar
  41. [41]
    Y. Pan and K. Li, “Linear array with a reconfigurable pipelined bus system — concepts and applications,” Proc. of 1996 International Conference on Parallel and Distributed Processing Techniques and Applications, August 9–11, 1996, Sunnyvale, California, USA, pp. 1431–1442.Google Scholar
  42. [42]
    Y. Pan, K. Li, and M. Hamdi, eds., Special Issue on Parallel Computing with Optical Interconnections of Informatica — An International Journal, to appear in 1998.Google Scholar
  43. [43]
    Y. Pan, K. Li, and S.-Q. Zheng, “Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system,” to appear in Parallel Algorithms and Applications.Google Scholar
  44. [44]
    S. Pavel and S. G. Akl, “Matrix operations using arrays with reconfigurable optical buses,” Parallel Algorithms and Applications, vol. 11, pp. 223–242, 1996.Google Scholar
  45. [45]
    S. Pavel and S. G. Akl, “Efficient algorithms for the Hough transform on arrays with reconfigurable optical buses,” Proc. of the 10th International Parallel Processing Symposium, pp. 697–701, April 1996.Google Scholar
  46. [46]
    S. Pavel and S. G. Akl, “Integer sorting and routing in arrays with reconfigurable optical buses,” Proc. of 1996 International Conference on Parallel Processing, vol. III, pp. 90–94, August 1996.Google Scholar
  47. [47]
    S. Pavel and S. G. Akl, “On the power of arrays with optical pipelined buses,” Proc. of 1996 International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 1443–1454, Sunnyvale, California, August 9–11, 1996.Google Scholar
  48. [48]
    S. Pavel, “Computation and communication aspects of arrays with optical pipelined buses,” PhD Dissertation, Department of Computing and Information Science, Queen’s University, Canada, October 1996.Google Scholar
  49. [49]
    C. Qiao, R. Melhem, D. Chiarulli, and S. Levitan, “Optical multicasting in linear arrays,” International Journal of Optical Computing, vol. 2,no. 1, pp. 31–48, 1991.Google Scholar
  50. [50]
    C. Qiao and R. Melhem, “Time-division optical communications in multiprocessor arrays,” IEEE Transactions on Computers, vol. 42,no. 5, pp. 577–590, May 1993.CrossRefGoogle Scholar
  51. [51]
    C. Qiao, “Efficient matrix operations in a reconfigurable array with spanning optical buses,” Proc. 5th IEEE Symposium on the Frontiers of Massively Parallel Computations, pp. 273–280, 1995.Google Scholar
  52. [52]
    S. Rajasekaran and S. Sahni, “Sorting, selection and routing on the arrays with reconfigurable optical buses,” IEEE Transactions on Parallel and Distributed Systems, vol. 8,no. 11, pp. 1123–1132, Nov. 1997.CrossRefGoogle Scholar
  53. [53]
    S. Ramanan and H. Jordan, “Serial array shuffle-exchange architecture for universal permutation of time slots,” SPIE Proc. of Digital Optical Computing II, vol. 1215, pp. 330–342, Jan. 1990.Google Scholar
  54. [54]
    M. M. Eshaghian and E. Schenfeld, ed., Special Issue on Parallel Computing with Optical Interconnects of Journal of Parallel and Distributed Computing, vol. 41,no. 1, 1997.Google Scholar
  55. [55]
    Q. F. Stout, “Mesh Connected Computers with Broadcasting,” IEEE Trans. on Computers, vol. C-32,no. 9, pp. 826–830, Sept. 1983.Google Scholar
  56. [56]
    J. L. Trahan, R. Vaidyanathan, and C. P. Subbaraman, “Constant time graph and poset algorithms on the reconfigurable multiple bus machine,” Proc. Int. Conf. on Parallel Processing, vol. III, pp. 214–217, 1994.Google Scholar
  57. [57]
    J. Trahan and R. Vaidyanathan, “Relative scalability of the reconfigurable multiple bus machine,” Proc. Workshop Reconfigurable Arch. and Algs., 1996.Google Scholar
  58. [58]
    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. of 10th International Conference on Parallel and Distributed Computing Systems, Oct. 1–3, 1997, New Orleans, LA, USA, pp. 564–569.Google Scholar
  59. [59]
    J. L. Trahan, Y. Pan, R. Vaidyanathan, and A. G. Bourgeois, “Scalable algorithms and simulation results for a linear array with a reconfigurable pipelined bus system,” submitted for publication.Google Scholar
  60. [60]
    B. F. Wang, G. H. Chen, and F. C. Lin, “Constant time sorting on a processor array with a reconfigurable bus system,” Information Processing Letters, vol. 34,no. 4, pp. 187–192, April 1990.MATHCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Yi Pan
    • 1
  1. 1.Department of Computer ScienceUniversity of DaytonDayton

Personalised recommendations