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の簡単化
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.
,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=02A0029626&from=J-GLOBAL&jstjournalNo=S0532B") }}
JST classification (2):
JST classification
Category name(code) classified by JST.
Operating systems  ,  Theory of computation 
Reference (16):
more...
Terms in the title (2):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page