About J-GLOBAL

日本語

Font size
  • A
  • A

Articleの詳細情報

ArticleJ-GLOBAL ID:200902131032220788整理番号:02A0029626

A Simplification of the Bakery algorithm Based on Bounded Tickets for the Mutual Exclusion Problem.

相互排他問題を解くための有限のチケットを用いたBakery algorithmの簡単化

著者:TAKAMURA M(Gunma Univ., Gunma, JPN)、IGARASHI Y(Gunma Univ., Gunma, JPN)
資料名:電子情報通信学会技術研究報告 巻:101 号:376(COMP2001 37-51) ページ:61-68
発行年:2001年10月19日
  • J-GLOBAL home
  • Bookmark J-GLOBAL

J-GLOBAL: Linking, Expanding and Sparking

About J-GLOBAL

Linking

J-GLOBAL links information that represents the key to research and development. For example, linking articles and patents with people (authors and inventors) enables the extraction of a sequence of information.
It’s useful for making new discoveries and uncovering new information.

Expanding

The system enables searches of similar kinds of content through linkage with external sites.
It helps you to obtain knowledge from dissimilar fields and discover concepts that cross the boundaries of specialisms.

Sparking

Through repeated linkage and expansioniteration, J-GLOBAL provides unexpected hints for problem-solving and the illumination of new ideas.