DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kang, Sung-Il | ko |
dc.contributor.author | Lee, Heung-Kyu | ko |
dc.date.accessioned | 2013-03-02T16:43:53Z | - |
dc.date.available | 2013-03-02T16:43:53Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1998-07 | - |
dc.identifier.citation | OPERATING SYSTEMS REVIEW (ACM), v.32, no.3, pp.30 - 50 | - |
dc.identifier.issn | 0163-5980 | - |
dc.identifier.uri | http://hdl.handle.net/10203/74508 | - |
dc.description.abstract | The readers-writers problem is a classical one in the area of operating system and database. Although the problem has simple constraints, it has a feature that various scheduling policies can be applied to it. In this paper, we consider non-preemptive scheduling policies for solving the problem. In order to analyze detailed features of those policies, we define scheduling points and items of the readers-writers problem and present their semaphore-based solutions with a common style. | - |
dc.language | English | - |
dc.publisher | Association for Computing Machinary, Inc. | - |
dc.title | Analysis and Solution of Non-preemptive Policies for Scheduling Readers and Writers | - |
dc.type | Article | - |
dc.identifier.scopusid | 2-s2.0-0042537274 | - |
dc.type.rims | ART | - |
dc.citation.volume | 32 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 30 | - |
dc.citation.endingpage | 50 | - |
dc.citation.publicationname | OPERATING SYSTEMS REVIEW (ACM) | - |
dc.contributor.localauthor | Lee, Heung-Kyu | - |
dc.contributor.nonIdAuthor | Kang, Sung-Il | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.