Art
J-GLOBAL ID:200902131032220788
Reference number:02A0029626
A Simplification of the Bakery algorithm Based on Bounded Tickets for the Mutual Exclusion Problem.
相互排他問題を解くための有限のチケットを用いたBakery algorithmの簡単化
-
Publisher site
Copy service
{{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=02A0029626©=1") }}
-
Access JDreamⅢ for advanced search and analysis.
{{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=02A0029626&from=J-GLOBAL&jstjournalNo=S0532B") }}
Author (2):
,
Material:
Volume:
101
Issue:
376(COMP2001 37-51)
Page:
61-68
Publication year:
Oct. 19, 2001
JST Material Number:
S0532B
ISSN:
0913-5685
Document type:
Proceedings
Article type:
原著論文
Country of issue:
Japan (JPN)
Language:
ENGLISH (EN)
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
JST classification (2):
JST classification
Category name(code) classified by JST.
Operating systems
, Theory of computation
Reference (16):
-
ATTIYA, H. Distributed Computing : Fundamentals, Simulations and Advanced Topics. 1998
-
BURNS, J. E. Mutual exclusion with linear waiting using binary shared variables. ACM SIGACT News. 1978, 10, 42-47
-
BURNS, J. E. Data requirements for implementation of N-process mutual exclusion using a single shared variable. J. of the ACM. 1982, 29, 183-205
-
BURNS, J. E. Bounds on shared memory for mutual exclusion. Information and Computation. 1993, 107, 171-184
-
CREMERS, A. B. Mutual exclusion of N processors using an O(N)-valued message variable. 5th International Colloquium on Automata, Languages and Programming, Udine, Italy, 1978. 1978, 165-176
more...
Terms in the title (2):
Terms in the title
Keywords automatically extracted from the title.
,
Return to Previous Page