• DocumentCode
    2743477
  • Title

    An implementation of N-party synchronization using tokens

  • Author

    Kumar, D.

  • Author_Institution
    Dept. of Comput. Eng. & Sci., Case Western Reserve Univ., Cleveland, OH, USA
  • fYear
    1990
  • fDate
    28 May-1 Jun 1990
  • Firstpage
    320
  • Lastpage
    327
  • Abstract
    In N-party synchronization, an arbitrary number of processes synchronize together and in their synchronized state these processes can execute an arbitrary computation consisting of asynchronous message transfers among them and local computations. The author presents an algorithm to implement N-party synchronization on a distributed system where processes communicate with each other via asynchronous message communication over one-to-one communication lines. The algorithm is developed in stages for better understandability. N-party synchronization is a generalization of the usual two-party synchronization
  • Keywords
    distributed processing; parallel algorithms; parallel programming; programming theory; N-party synchronization; asynchronous message communication; asynchronous message transfers; distributed system; one-to-one communication lines; tokens; Intrusion detection; Message passing; Protocols; Signal processing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing Systems, 1990. Proceedings., 10th International Conference on
  • Conference_Location
    Paris
  • Print_ISBN
    0-8186-2048-X
  • Type

    conf

  • DOI
    10.1109/ICDCS.1990.89299
  • Filename
    89299