Search this article in Google Scholar


分類 国際会議
著者名 (author) Satoshi Fujita,Masafumi Yamashita,Tadashi Ae
英文著者名 (author)
編者名 (editor)
編者名 (英文)
キー (key)
表題 (title) Distributed k-Mutual Exclusion Problem and k-Coteries
表題 (英文)
書籍・会議録表題 (booktitle) ISA '91 Algorithms, 2nd International Symposium on Algorithms, LNCS
書籍・会議録表題(英文)
巻数 (volume) 557
号数 (number)
ページ範囲 (pages) 22-31
組織名 (organization)
出版元 (publisher)
出版元 (英文)
出版社住所 (address)
刊行月 (month) December
出版年 (year) 1991
付加情報 (note) Taipei
注釈 (annote) Acceptance rate: 36/90 = 40%, http://www.springerlink.com/content/f4l5420u7w825567/
内容梗概 (abstract) The distributed k-mutual exclusion problem is the problem of guaranteeing that at most k processes are in a critical section simultaneously. This problem can be solved using the k-coterie: We first prepare a set (k-coterie) C of sets (quorums) Q of processes such that each k-set {Q 1,Onlogn when k=O(1).
論文電子ファイル Not available.


[1-64]  Satoshi Fujita, Masafumi Yamashita, and Tadashi Ae, ``Distributed K-Mutual Exclusion Problem and K-Coteries,'' In ISA '91 Algorithms, 2nd International Symposium on Algorithms, LNCS, vol. 557, pp. 22-31, December 1991. (Taipei)

@inproceedings{1_64,
    author = {Satoshi Fujita and Masafumi Yamashita and Tadashi Ae},
    author_e = {},
    editor = {},
    editor_e = {},
    title = {Distributed k-Mutual Exclusion Problem and k-Coteries},
    title_e = {},
    booktitle = {ISA '91 Algorithms, 2nd International Symposium on Algorithms,
    LNCS},
    booktitle_e = {},
    volume = {557},
    number = {},
    pages = {22-31},
    organization = {},
    publisher = {},
    publisher_e = {},
    address = {},
    month = {December},
    year = {1991},
    note = {Taipei},
    annote = {Acceptance rate: 36/90 = 40%, http://www.springerlink.com/content/
    f4l5420u7w825567/}
}

This site is maintained by Distributed System Laboratory.

PMAN 2.5.5 - Paper MANagement system / (C) 2002-2008, Osamu Mizuno / All rights reserved.