Semaphore Solutions To General Mutual Exclusion Problems
| dc.contributor.author | Yue, Kwok-Bun | |
| dc.date.accessioned | 2019-10-04T19:32:47Z | |
| dc.date.available | 2019-10-04T19:32:47Z | |
| dc.date.issued | 1988 | |
| dc.description.abstract | Automatic generation of starvation-free semaphore solutions to general mutual exclusion problems is discussed. A reduction approach is introduced for recognizing edge-solvable problems, together with an O(N^2) algorithm for graph reduction, where N is the number of nodes. An algorithm for the automatic generation of starvation-free edge-solvable solutions is presented. The solutions are proved to be very efficient. For general problems, there are two ways to generate efficient solutions. One associates a semaphore with every node, the other with every edge. They are both better than the standard monitor—like solutions. Besides strong semaphores, solutions using weak semaphores, weaker semaphores and generalized semaphores are also considered. Basic properties of semaphore solutions are also discussed. Tools describing the dynamic behavior of parallel systems, as well as performance criteria for evaluating semaphore solutions are elaborated. | en_US |
| dc.identifier.citation | Yue, K., Semaphore Solutions To General Mutual Exclusion Problems. Ph.D. Dissertation. University of North Texas, Denton, 1988. | en_US |
| dc.identifier.uri | https://hdl.handle.net/10657.1/1495 | |
| dc.publisher | University of North Texas, Denton | en_US |
| dc.title | Semaphore Solutions To General Mutual Exclusion Problems | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- sephomoresolutions.pdf
- Size:
- 105.15 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: