| dc.contributor.author | Zhang, Jingsong | |
| dc.date.accessioned | 2014-04-15T18:33:25Z | |
| dc.date.available | 2014-04-15T18:33:25Z | |
| dc.date.issued | 2006-12-01 | |
| dc.identifier.uri | https://hdl.handle.net/11244/8275 | |
| dc.description.abstract | This thesis gives an alternative mutual exclusion algorithm that is based on request and fair access instead of turn taking. The algorithmic details and the implementation of the new mutual exclusion algorithm are given in this thesis report. The new algorithm's implementation was tested on different multi-tasking multi-processor systems. The test environments consisted of a Dual CPU Dell PowerEdge 1800 running Windows 2003 Advanced Server and a four CPU HP ProLiant DL580 running Windows 2000 Server. The new algorithm was implemented in C#. The new algorithm was tested using classical dining philosophers and race condition problems. The test results showed that the new algorithm successfully solved these traditional mutual exclusion problems. | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.publisher | Oklahoma State University | |
| dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
| dc.title | Mutual Exclusion Algorithm Based on Request and Fair Access | |
| dc.type | text | |
| osu.filename | Zhang_okstate_0664M_2066.pdf | |
| osu.college | Arts and Sciences | |
| osu.accesstype | Open Access | |
| dc.description.department | Computer Science Department | |
| dc.type.genre | Thesis | |
