WEKO3
アイテム
A New Synchronization Mechanism called "Forcing Expression" and its Implementation
https://ipsj.ixsq.nii.ac.jp/records/59917
https://ipsj.ixsq.nii.ac.jp/records/599174418bc2e-d5da-4b5a-b45c-78f78b6ef8c6
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JIP0603003.pdf (813.7 kB)
|
Copyright (c) 1983 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | JInfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1983-11-20 | |||||||
| タイトル | ||||||||
| タイトル | A New Synchronization Mechanism called "Forcing Expression" and its Implementation | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | A New Synchronization Mechanism called "Forcing Expression" and its Implementation | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Department of mathematics Waseda University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of mathematics, Waseda University | ||||||||
| 著者名 |
Kiyoshi, Segawa
× Kiyoshi, Segawa
|
|||||||
| 著者名(英) |
Kiyoshi, Segawa
× Kiyoshi, Segawa
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | A new synchronization mechanism -forcing expression- is proposed. Forcing expressions describe the behavior of critical sections by denoting the allowable combinations of processes and data concerning the sections. and cooperation problems can be treated equally be forcing expressions. Forcing expressions are high level synchronbation mechanisms but can be implemented by simpler synchronization primitives such as .binary semaphore cause/await and enq/deq operations. The definition and the implementation details of forcing expressions are described. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | A new synchronization mechanism -forcing expression- is proposed. Forcing expressions describe the behavior of critical sections by denoting the allowable combinations of processes and data concerning the sections. and cooperation problems can be treated equally be forcing expressions. Forcing expressions are high level synchronbation mechanisms, but can be implemented by simpler synchronization primitives such as .binary semaphore, cause/await and enq/deq operations. The definition and the implementation details of forcing expressions are described. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00700121 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 6, 号 3, p. 141-147, 発行日 1983-11-20 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
