| 作成者 |
|
|
|
|
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
| 関連URI |
|
| 関連情報 |
|
| 概要 |
When a resource is shared among processors in a distributed environment , it is necessary to reduce communication overhead. Various mechanisms for this purpose have been proposed in such research area...s as distributed shared memory. We propose an efficient resource sharing mechanism using a framework for distributed problem solving. Our mechanism is that agents dynamically decide the placement of copies of the shared resource based on the count that each processor refers to it. And we describe how to process the strategy to decide the placement of copies at metalevel. we also compare our proposed mechanism with a traditional one.続きを見る
|
Mendeley出力
