• DocumentCode
    275699
  • Title

    Good networks

  • Author

    Sabin, Malcolm

  • Author_Institution
    Fegs Ltd., Cambridge, UK
  • fYear
    1991
  • fDate
    15-19 Apr 1991
  • Firstpage
    150
  • Lastpage
    152
  • Abstract
    In devising a programming model to act as an interface between various distributed memory MIMD hardware designs and application software there are clearly two alternative assumptions. One is that since machines differ in connectivity, portability can only be achieved by hiding these differences, and therefore the programming model must be of a set of processors with full virtual connectivity. This is achieved by supporting indirect communication either by message-forwarding software or by hardware. The other says that since the objective of going parallel is to achieve high performance, we wish to match process connectivity to processor connectivity as closely as possible. Message-forwarding may still be relevant (and used) if the underlying hardware has valency limits which preclude exact matching. The paper explores the implications for hardware design of each of these assumptions
  • Keywords
    graph theory; multiprocessor interconnection networks; MIN; application software; connectivity; distributed memory MIMD; hardware; hardware design; message-forwarding; parallel processing; performance;
  • fLanguage
    English
  • Publisher
    iet
  • Conference_Titel
    Design and Application of Parallel Digital Processors, 1991., Second International Specialist Seminar on the
  • Conference_Location
    Lisbon
  • Print_ISBN
    0-85296-519-2
  • Type

    conf

  • Filename
    140037