메뉴 건너뛰기




Volumn , Issue , 2003, Pages

Scalable hardware-based multicast trees

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING ALGORITHM; BARRIER SYNCHRONIZATION; COLLECTIVE COMMUNICATIONS; MULTICAST COMMUNICATION; MULTICAST MECHANISM; NEAR-OPTIMAL SOLUTIONS; PERFORMANCE AND SCALABILITIES; UNICAST COMMUNICATION;

EID: 84877065624     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1048935.1050205     Document Type: Conference Paper
Times cited : (10)

References (16)
  • 1
    • 0001357914 scopus 로고    scopus 로고
    • Implicit coscheduling: Coordinated scheduling with implicit information in distributed systems
    • August Available from
    • Andrea Carol Arpaci-Dusseau. Implicit coscheduling: Coordinated scheduling with implicit information in distributed systems. ACM Transactions on Computer Systems, 19(3), August 2001. Available from http://www.cs.wisc.edu/ ~dusseau/Papers/tocs01.ps.
    • (2001) ACM Transactions on Computer Systems , vol.19 , Issue.3
    • Arpaci-Dusseau, A.C.1
  • 2
    • 84976858135 scopus 로고
    • Ultracomputers: A teraflop before its time
    • August
    • Gordon Bell. Ultracomputers: A teraflop before its time. Communications of the ACM, 35(8):27-47, August 1992.
    • (1992) Communications of the ACM , vol.35 , Issue.8 , pp. 27-47
    • Bell, G.1
  • 3
    • 84877028585 scopus 로고    scopus 로고
    • Technical report,Digital Systems Design Group, Technical University of Valencia, February Available from
    • Salvador Coll. A Parameterized CommunicationModel for QsNET. Technical report,Digital Systems Design Group, Technical University of Valencia, February 2002. Available from http://ttt.upv.es/~scoll/papers/comm-model.pdf.
    • (2002) A Parameterized CommunicationModel for QsNET
    • Coll, S.1
  • 5
    • 0023346637 scopus 로고
    • Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
    • May
    • William J. Dally and Charles L. Seitz. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks. IEEE Transactions on Computers, C-36(5):547-553,May 1987.
    • (1987) IEEE Transactions on Computers , vol.C-36 , Issue.5 , pp. 547-553
    • Dally, W.J.1    Seitz, C.L.2
  • 6
    • 84877040882 scopus 로고    scopus 로고
    • Technical report, Parallel Architectures Group, Technical University of Valencia, August
    • José Duato. Improved Multicast Support for the Quadrics Network. Technical report, Parallel Architectures Group, Technical University of Valencia, August 2001.
    • (2001) Improved Multicast Support for the Quadrics Network
    • Duato, J.1
  • 8
    • 84957008669 scopus 로고    scopus 로고
    • Improved utilization and responsiveness with gang scheduling
    • Dror G. Feitelson and Larry Rudolph, editors, 3rd Workshop on Job Scheduling Strategies for Parallel Processing, Geneva, Switzerland, April 5, Springer-Verlag. Available from
    • Dror G. Feitelson and Morris A. Jette. Improved utilization and responsiveness with gang scheduling. In Dror G. Feitelson and Larry Rudolph, editors, 3rd Workshop on Job Scheduling Strategies for Parallel Processing, volume 1291 of Lecture Notes in Computer Science, pages 238-261, Geneva, Switzerland, April 5, 1997. Springer-Verlag. Available from http://www.cs.huji. ac.il/~feit/parsched/p-97-11.ps.gz.
    • (1997) Lecture Notes in Computer Science , vol.1291 , pp. 238-261
    • Feitelson, D.G.1    Jette, M.A.2
  • 10
    • 12444327177 scopus 로고    scopus 로고
    • Challenges in Developing Scalable Software for BlueGene/L
    • Available from
    • Manish Gupta. Challenges in Developing Scalable Software for BlueGene/L. In Scaling to New Heights Workshop, Pittsburgh, PA, May 2002. Available from http://www.psc.edu/training/scaling/gupta.ps.
    • Scaling to New Heights Workshop, Pittsburgh, PA, May 2002
    • Gupta, M.1
  • 11
    • 0033902561 scopus 로고    scopus 로고
    • Buffered coscheduling: A new methodology for multi-tasking parallel jobs on distributed systems
    • Cancun, Mexico, May 1-5, Available from
    • Fabrizio Petrini and Wu chun Feng. Buffered coscheduling: A new methodology for multi-tasking parallel jobs on distributed systems. In Proceedings of the International Parallel and Distributed Processing Symposium 2000 (IPDPS 2000), volume 16, Cancun, Mexico, May 1-5, 2000. Available from http://ipdps.eece.unm.edu/2000/papers/petrini.pdf.
    • (2000) Proceedings of the International Parallel and Distributed Processing Symposium 2000 (IPDPS 2000) , vol.16
    • Petrini, F.1    Feng, W.C.2
  • 12
    • 0036170241 scopus 로고    scopus 로고
    • The Quadrics network: High-performance clustering technology
    • January/February ISSN 0272-1732. Available from
    • Fabrizio Petrini, Wu chun Feng, Adolfy Hoisie, Salvador Coll, and Eitan Frachtenberg. The Quadrics network: High-performance clustering technology. IEEE Micro, 22(1):46-57, January/February 2002. ISSN 0272-1732. Available from http://www.computer.org/micro/mi2002/pdf/m1046.pdf.
    • (2002) IEEE Micro , vol.22 , Issue.1 , pp. 46-57
    • Petrini, F.1    Feng, W.C.2    Hoisie, A.3    Coll, S.4    Frachtenberg, E.5
  • 14
    • 84877019178 scopus 로고    scopus 로고
    • The Case of the Missing Supercomputer Performance: Achieving Optimal Performance on the 8,192 Processors of ASCI Q
    • Available from
    • Fabrizio Petrini, Darren Kerbyson, and Scott Pakin. The Case of the Missing Supercomputer Performance: Achieving Optimal Performance on the 8,192 Processors of ASCI Q. In Proceedings of SC2003, Phoenix, Arizona, November 10-16, 2003. Available from http://www.c3.lanl.gov/~fabrizio/papers/sc03-noise. pdf.
    • Proceedings of SC2003, Phoenix, Arizona, November 10-16, 2003
    • Petrini, F.1    Kerbyson, D.2    Pakin, S.3
  • 15
    • 0008348598 scopus 로고    scopus 로고
    • Performance analysis of wormhole routed k-ary n-trees
    • June Available from
    • Fabrizio Petrini and Marco Vanneschi. Performance analysis of wormhole routed k-ary n-trees. International Journal on Foundations of Computer Science, 9(2):157-177, June 1998. Available from http://www.c3.lanl.gov/~fabrizio/papers/ ijfcs98.ps.gz.
    • (1998) International Journal on Foundations of Computer Science , vol.9 , Issue.2 , pp. 157-177
    • Petrini, F.1    Vanneschi, M.2
  • 16
    • 0022138618 scopus 로고
    • "Hot spot" contention and combining in multistage interconnection networks
    • October
    • Gregory F. Pfister and V. Alan Norton. "Hot spot" contention and combining in multistage interconnection networks. IEEE Transactions on Computers, C-34(10):943-948, October 1985.
    • (1985) IEEE Transactions on Computers , vol.C-34 , Issue.10 , pp. 943-948
    • Pfister, G.F.1    Norton, V.A.2


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