메뉴 건너뛰기




Volumn 5, Issue 5, 1988, Pages 69-77

Programming a Hypercube Multicomputer

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE;

EID: 0024072012     PISSN: 07407459     EISSN: None     Source Type: Journal    
DOI: 10.1109/52.7944     Document Type: Article
Times cited : (44)

References (11)
  • 2
    • 0023578212 scopus 로고
    • The Star Graph: An Attractive Alternative to the N-Cube
    • CS Press, Los Alamitos, Calif.
    • S.B. Akers, D. Harel, and B. Krishnamurthy, “The Star Graph: An Attractive Alternative to the N-Cube”, Proc. Int'l Conf. Parallel Processing, CS Press, Los Alamitos, Calif., 1987, pp. 393-400.
    • (1987) Proc. Int'l Conf. Parallel Processing , pp. 393-400
    • Akers, S.B.1    Harel, D.2    Krishnamurthy, B.3
  • 3
    • 0022910463 scopus 로고
    • Scalability of a Binary Tree on a Hypercube
    • CS Press, Los Alamitos, Calif.
    • S.R. Deshpande and R.M.Jenevein, “Scalability of a Binary Tree on a Hypercube”, Proc. Inl 7 Conf. Parallel Processing, CS Press, Los Alamitos, Calif., 1986, pp. 661-668.
    • (1986) Proc. Inl 7 Conf. Parallel Processing , pp. 661-668
    • Deshpande, S.R.1    Jenevein, R.M.2
  • 4
    • 0022812268 scopus 로고
    • Multigrid Algorithms on the Hypercube Multiprocessor
    • Nov.
    • T.F. Chan and Y. Saad, “Multigrid Algorithms on the Hypercube Multiprocessor”, IEEE Trans. Computers, Nov. 1986, pp. 969-977.
    • (1986) IEEE Trans. Computers , pp. 969-977
    • Chan, T.F.1    Saad, Y.2
  • 6
    • 0000456144 scopus 로고
    • Parallel Matrix and Graph Algorithms
    • Nov.
    • E. Dekel, D. Nassimi, and S. Sahni, “Parallel Matrix and Graph Algorithms”, SIAM J. Computing, Nov. 1981, pp. 657-675.
    • (1981) SIAM J. Computing , pp. 657-675
    • Dekel, E.1    Nassimi, D.2    Sahni, S.3
  • 8
    • 0023577384 scopus 로고
    • All-Pairs Shortest Paths on a Hypercube Multiprocessor
    • CS Press, Los Alamitos, Calif.
    • J. Jenq and S. Sahni, “All-Pairs Shortest Paths on a Hypercube Multiprocessor”, Proc. Int'l Conf. Parallel Processing, CS Press, Los Alamitos, Calif., 1987, pp. 713-716.
    • (1987) Proc. Int'l Conf. Parallel Processing , pp. 713-716
    • Jenq, J.1    Sahni, S.2
  • 9
    • 84939369756 scopus 로고
    • Hough's Transform on a Hypercube Multiprocessor Computer
    • Computer Science Dept., Univ. of Minnesota. Minneapolis, Minn.
    • S. Ranka and S. Sahni, “Hough's Transform on a Hypercube Multiprocessor Computer”, tech. report, Computer Science Dept., Univ. of Minnesota. Minneapolis, Minn., 1988.
    • (1988) tech. report
    • Ranka, S.1    Sahni, S.2
  • 10
    • 0023565726 scopus 로고
    • Maze Routing on a Hypercube Multiprocessor Computer
    • CS Press, Los Alamitos, Calif.
    • Y. Won and S. Sahni, “Maze Routing on a Hypercube Multiprocessor Computer”, Proc. Intl Conf. Parallel Processing, CS Press, Los Alamitos, Calif., 1987, pp. 630-637.
    • (1987) Proc. Intl Conf. Parallel Processing , pp. 630-637
    • Won, Y.1    Sahni, S.2
  • 11
    • 84939342983 scopus 로고
    • 0/1- Knapsack Problem on a Hypercube Multiprocessor System
    • CS Press, Los Alamitos, Calif.
    • J. Lee, E. Shargowitz, and S. Sahni, “0/1- Knapsack Problem on a Hypercube Multiprocessor System”, Proc. Int ‘I Conf. Parallel Processing, CS Press, Los Alamitos, Calif., 1987, pp. 600-706.
    • (1987) Proc. Int ‘I Conf. Parallel Processing , pp. 600-706
    • Lee, J.1    Shargowitz, E.2    Sahni, S.3


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