• DocumentCode
    3281910
  • Title

    Context streams a theoretical basis for a generic form of MIMD pipelining

  • Author

    Lees, Timothy E A

  • Author_Institution
    Dept. of Comput. Sci., Edinburgh Univ., UK
  • fYear
    1990
  • fDate
    9-13 Dec 1990
  • Firstpage
    754
  • Lastpage
    757
  • Abstract
    Context flow (CF) is a canonical form of MIMD pipelining in which process contexts rather than either instructions or data are manipulated. The paper presents a formal definition of context flow. It defines the state of a CF computation as the stream of contexts which pass a particular point in a context flow graph during a given period of time. It shows that for a class of context flow graphs corresponding to dynamic multifunctional pipelines, the number of contexts which may exist at any point in a graph is bounded, and independent of the computation being performed. It presents methods for determining the numerical value of the upper bound or queue length for a variety of configurations of a acyclic graph
  • Keywords
    graph theory; parallel algorithms; parallel processing; pipeline processing; MIMD pipelining; acyclic graph; context flow graph; context streams; dynamic multifunctional pipelines; process contexts; queue length; upper bound; Computer science; Concurrent computing; Control systems; Councils; Data mining; Hardware; Interleaved codes; Parallel processing; Pipeline processing; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
  • Conference_Location
    Dallas, TX
  • Print_ISBN
    0-8186-2087-0
  • Type

    conf

  • DOI
    10.1109/SPDP.1990.143639
  • Filename
    143639