Distributed match-making for processes in computer networks

Sape J. Mullender, Paul M.B. Vitányi

    Research output: Contribution to journalArticleAcademicpeer-review

    1 Citation (Scopus)
    51 Downloads (Pure)

    Abstract

    In the very large multiprocessor systems and, on a grander scale, computer networks now emerging, processes are not tied to fixed processors but run on processors taken from a pool of processors. Processors are released when a process dies, migrates or when the process crashes. In distributed operating systems using the service concept, processes can be clients asking for a service, servers giving a service or both. Establishing communication between a process asking for a service and a process giving that service, without centralized control in a distributed environment with mobile processes, constitutes the problem of distributed match-making. Logically, such a match-making phase precedes routing in store-and-forward computer networks of this type. Algorithms for distributed match-making are developed and their complexity is investigated in terms of message passes and in terms of storage needed. The theoretical limitations of distributed match-making are established, and the techniques are applied to several network topologies.
    Original languageUndefined
    Pages (from-to)54-64
    Number of pages11
    JournalOperating systems review
    Volume20
    Issue number2
    DOIs
    Publication statusPublished - Apr 1986

    Keywords

    • EWI-1262
    • IR-55902

    Cite this

    Mullender, Sape J. ; Vitányi, Paul M.B. / Distributed match-making for processes in computer networks. In: Operating systems review. 1986 ; Vol. 20, No. 2. pp. 54-64.
    @article{d86569e6996343e1b67aebc52602dcdf,
    title = "Distributed match-making for processes in computer networks",
    abstract = "In the very large multiprocessor systems and, on a grander scale, computer networks now emerging, processes are not tied to fixed processors but run on processors taken from a pool of processors. Processors are released when a process dies, migrates or when the process crashes. In distributed operating systems using the service concept, processes can be clients asking for a service, servers giving a service or both. Establishing communication between a process asking for a service and a process giving that service, without centralized control in a distributed environment with mobile processes, constitutes the problem of distributed match-making. Logically, such a match-making phase precedes routing in store-and-forward computer networks of this type. Algorithms for distributed match-making are developed and their complexity is investigated in terms of message passes and in terms of storage needed. The theoretical limitations of distributed match-making are established, and the techniques are applied to several network topologies.",
    keywords = "EWI-1262, IR-55902",
    author = "Mullender, {Sape J.} and Vit{\'a}nyi, {Paul M.B.}",
    note = "Imported from DIES",
    year = "1986",
    month = "4",
    doi = "10.1145/12481.12484",
    language = "Undefined",
    volume = "20",
    pages = "54--64",
    journal = "Operating systems review",
    issn = "0163-5980",
    publisher = "Association for Computing Machinery (ACM)",
    number = "2",

    }

    Distributed match-making for processes in computer networks. / Mullender, Sape J.; Vitányi, Paul M.B.

    In: Operating systems review, Vol. 20, No. 2, 04.1986, p. 54-64.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    T1 - Distributed match-making for processes in computer networks

    AU - Mullender, Sape J.

    AU - Vitányi, Paul M.B.

    N1 - Imported from DIES

    PY - 1986/4

    Y1 - 1986/4

    N2 - In the very large multiprocessor systems and, on a grander scale, computer networks now emerging, processes are not tied to fixed processors but run on processors taken from a pool of processors. Processors are released when a process dies, migrates or when the process crashes. In distributed operating systems using the service concept, processes can be clients asking for a service, servers giving a service or both. Establishing communication between a process asking for a service and a process giving that service, without centralized control in a distributed environment with mobile processes, constitutes the problem of distributed match-making. Logically, such a match-making phase precedes routing in store-and-forward computer networks of this type. Algorithms for distributed match-making are developed and their complexity is investigated in terms of message passes and in terms of storage needed. The theoretical limitations of distributed match-making are established, and the techniques are applied to several network topologies.

    AB - In the very large multiprocessor systems and, on a grander scale, computer networks now emerging, processes are not tied to fixed processors but run on processors taken from a pool of processors. Processors are released when a process dies, migrates or when the process crashes. In distributed operating systems using the service concept, processes can be clients asking for a service, servers giving a service or both. Establishing communication between a process asking for a service and a process giving that service, without centralized control in a distributed environment with mobile processes, constitutes the problem of distributed match-making. Logically, such a match-making phase precedes routing in store-and-forward computer networks of this type. Algorithms for distributed match-making are developed and their complexity is investigated in terms of message passes and in terms of storage needed. The theoretical limitations of distributed match-making are established, and the techniques are applied to several network topologies.

    KW - EWI-1262

    KW - IR-55902

    U2 - 10.1145/12481.12484

    DO - 10.1145/12481.12484

    M3 - Article

    VL - 20

    SP - 54

    EP - 64

    JO - Operating systems review

    JF - Operating systems review

    SN - 0163-5980

    IS - 2

    ER -