메뉴 건너뛰기




Volumn 26, Issue 6, 2000, Pages 723-735

Solving graph theory problems using reconfigurable pipelined optical buses

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; GRAPH THEORY; MATRIX ALGEBRA; OPTICAL COMMUNICATION; OPTICAL DATA PROCESSING; PROBLEM SOLVING;

EID: 0034188384     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00126-X     Document Type: Article
Times cited : (16)

References (20)
  • 2
    • 0003140890 scopus 로고
    • Using coincident optical pulses for parallel memory addressing
    • Chiarulli D., Melhem R., Levitan S. Using coincident optical pulses for parallel memory addressing. IEEE Computer. 30:1987;48-57.
    • (1987) IEEE Computer , vol.30 , pp. 48-57
    • Chiarulli, D.1    Melhem, R.2    Levitan, S.3
  • 4
    • 85031559629 scopus 로고    scopus 로고
    • Communication-efficient sorting algorithms on reconfigurable array of processors with slotted optical buses
    • to appear
    • M. Hamdi, C. Qiao, Y. Pan, J. Tong, Communication-efficient sorting algorithms on reconfigurable array of processors with slotted optical buses, Journal of Parallel and Distributed Computing, to appear.
    • Journal of Parallel and Distributed Computing
    • Hamdi, M.1    Qiao, C.2    Pan, Y.3    Tong, J.4
  • 6
    • 84975664096 scopus 로고
    • Coincident pulse techniques for multiprocessor interconnection structures
    • Levitan S., Chiarulli D., Melhem R. Coincident pulse techniques for multiprocessor interconnection structures. Applied Optics. 29:1990;2024-2039.
    • (1990) Applied Optics , vol.29 , pp. 2024-2039
    • Levitan, S.1    Chiarulli, D.2    Melhem, R.3
  • 7
    • 0031338095 scopus 로고    scopus 로고
    • Constant time boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system
    • Li K. Constant time boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system. Journal of Supercomputing. 11(4):1997;391-403.
    • (1997) Journal of Supercomputing , vol.11 , Issue.4 , pp. 391-403
    • Li, K.1
  • 9
    • 0003492558 scopus 로고    scopus 로고
    • K. Li, Y. Pan, & S.-Q. Zheng. Boston, MA: Kluwer Academic Publishers
    • Li K., Pan Y., Zheng S.-Q. Parallel Computing Using Optical Interconnections. 1998;Kluwer Academic Publishers, Boston, MA.
    • (1998) Parallel Computing Using Optical Interconnections
  • 10
    • 0032137234 scopus 로고    scopus 로고
    • Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system
    • Li K., Pan Y., Zheng S.-Q. Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system. IEEE Transactions on Parallel and Distributed Systems. 9(8):1998;705-720.
    • (1998) IEEE Transactions on Parallel and Distributed Systems , vol.9 , Issue.8 , pp. 705-720
    • Li, K.1    Pan, Y.2    Zheng, S.-Q.3
  • 11
    • 0003038484 scopus 로고    scopus 로고
    • Parallel matrix computations using a reconfigurable pipelined optical bus
    • Li K., Pan Y., Zheng S.-Q. Parallel matrix computations using a reconfigurable pipelined optical bus. Journal of Parallel and Distributed Computing. 59(1):1999;13-30.
    • (1999) Journal of Parallel and Distributed Computing , vol.59 , Issue.1 , pp. 13-30
    • Li, K.1    Pan, Y.2    Zheng, S.-Q.3
  • 12
    • 0033903632 scopus 로고    scopus 로고
    • Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems
    • Li K., Pan Y., Zheng S.-Q. Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems. Journal of Supercomputing. 15(2):2000;163-181.
    • (2000) Journal of Supercomputing , vol.15 , Issue.2 , pp. 163-181
    • Li, K.1    Pan, Y.2    Zheng, S.-Q.3
  • 13
    • 0023866641 scopus 로고
    • Minimum-cost spanning tree as a path-finding problem
    • Maggs B.M., Plotkin S.A. Minimum-cost spanning tree as a path-finding problem. Information Processing Letters. 26:1988;291-293.
    • (1988) Information Processing Letters , vol.26 , pp. 291-293
    • Maggs, B.M.1    Plotkin, S.A.2
  • 14
    • 0000514921 scopus 로고    scopus 로고
    • Efficient computation of singular value decomposition on arrays with pipelined optical buses
    • Pan Y., Hamdi M. Efficient computation of singular value decomposition on arrays with pipelined optical buses. Journal of Network and Computer Applications. 19:1996;235-248.
    • (1996) Journal of Network and Computer Applications , vol.19 , pp. 235-248
    • Pan, Y.1    Hamdi, M.2
  • 15
    • 0032071141 scopus 로고    scopus 로고
    • Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system
    • Pan Y., Hamdi M., Li K. Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system. Future Generation Computer Systems. 13(6):1998;501-513.
    • (1998) Future Generation Computer Systems , vol.13 , Issue.6 , pp. 501-513
    • Pan, Y.1    Hamdi, M.2    Li, K.3
  • 16
    • 0032068431 scopus 로고    scopus 로고
    • Linear array with a reconfigurable pipelined bus system - concepts and applications
    • Pan Y., Li K. Linear array with a reconfigurable pipelined bus system - concepts and applications. Journal of Information Sciences. 106(3-4):1998;237-258.
    • (1998) Journal of Information Sciences , vol.106 , Issue.34 , pp. 237-258
    • Pan, Y.1    Li, K.2
  • 17
    • 0002410301 scopus 로고    scopus 로고
    • Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system
    • Pan Y., Li K., Zheng S.-Q. Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system. Journal of Parallel Algorithms and Applications. 13:1998;1-25.
    • (1998) Journal of Parallel Algorithms and Applications , vol.13 , pp. 1-25
    • Pan, Y.1    Li, K.2    Zheng, S.-Q.3
  • 18
    • 0027644856 scopus 로고
    • An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh
    • Park H., Kim H.J., Prasanna V.K. An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh. Information Processing Letters. 47:1993;109-113.
    • (1993) Information Processing Letters , vol.47 , pp. 109-113
    • Park, H.1    Kim, H.J.2    Prasanna, V.K.3
  • 19
    • 0011666070 scopus 로고
    • Random sampling techniques and parallel algorithm design
    • J.H. Reif. Los Altos, CA: Morgan Kaufmann
    • Rajasekaran S., Sen S. Random sampling techniques and parallel algorithm design. Reif J.H. Synthesis of Parallel Algorithms. 1993;411-451 Morgan Kaufmann, Los Altos, CA.
    • (1993) Synthesis of Parallel Algorithms , pp. 411-451
    • Rajasekaran, S.1    Sen, S.2
  • 20
    • 0025505685 scopus 로고
    • Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems
    • Wang B.-F., Chen G.-H. Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems. IEEE Transactions on Parallel and Distributed Systems. 1:1990;500-507.
    • (1990) IEEE Transactions on Parallel and Distributed Systems , vol.1 , pp. 500-507
    • Wang, B.-F.1    Chen, G.-H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.