Semaphores in Ada-94
| dc.contributor.author | Yue, Kwok-Bun | |
| dc.date.accessioned | 2019-10-04T19:52:21Z | |
| dc.date.available | 2019-10-04T19:52:21Z | |
| dc.date.issued | 1994 | |
| dc.description.abstract | The new protected type and requeue features in Ada-94 make possible the efficient implementations of many concurrent solutions, previously not possible in Ada-83. In this paper, the implementations of various semaphore systems in Ada-94 are presented. These systems are more general and powerful than the familiar binary and counting semaphores. As examples, the uses of the most general one, PVgeneral, in resource management and the synchronization of general mutual exclusion problems are discussed. | en_US |
| dc.identifier.citation | Yue, K., Semaphores in Ada-94. Ada Letters. vol.14, no.5, pp71-79, 1994. | en_US |
| dc.identifier.uri | https://hdl.handle.net/10657.1/1504 | |
| dc.publisher | Ada Letters | en_US |
| dc.title | Semaphores in Ada-94 | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- semaphoresada94.pdf
- Size:
- 4.09 KB
- Format:
- Adobe Portable Document Format
- Description:
- Abstract and Citation
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: