Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Huang, TL | en_US |
| dc.contributor.author | Shann, CH | en_US |
| dc.date.accessioned | 2014-12-08T15:49:13Z | - |
| dc.date.available | 2014-12-08T15:49:13Z | - |
| dc.date.issued | 1998-04-01 | en_US |
| dc.identifier.issn | 1045-9219 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/71.667901 | en_US |
| dc.identifier.uri | http://hdl.handle.net/11536/32703 | - |
| dc.description.abstract | The circular list-based mutual exclusion algorithm proposed by Fu and Tzeng [1] is subject to a race condition that leads to a deadlock under subtle situations. An execution sequence evidences the race, and a modified version is provided. The performance of the original algorithm remains unchanged. | en_US |
| dc.language.iso | en_US | en_US |
| dc.subject | critical sections | en_US |
| dc.subject | race conditions | en_US |
| dc.subject | deadlocks | en_US |
| dc.subject | atomic instructions | en_US |
| dc.title | A comment on "A circular list-based mutual exclusion scheme for large shared-memory multiprocessors" | en_US |
| dc.type | Editorial Material | en_US |
| dc.identifier.doi | 10.1109/71.667901 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | en_US |
| dc.citation.volume | 9 | en_US |
| dc.citation.issue | 4 | en_US |
| dc.citation.spage | 414 | en_US |
| dc.citation.epage | 415 | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.identifier.wosnumber | WOS:000073300300008 | - |
| dc.citation.woscount | 4 | - |
| Appears in Collections: | Articles | |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

