| Summary: | 碩士 === 元智大學 === 資訊工程學系 === 96 === Solutions of the CTP problem, a typical group mutual exclusion problem in which a group of philosophers competing for a resource, have to satisfy the requirements of “mutual exclusion”, “bounded delay”, and “concurrent entering.” Local-Spin algorithm has been developed to solve such problems.
In this thesis, we present an enhanced algorithm, ELS, and apply the algorithm on process and resource management of magnificent data storage jukeboxes. The ELS algorithm extends single critical section to multiple critical sections, assigns a weight to each mission to determine the priority of each mission, and make use of idle CD-ROM drives whenever possible to increase the quantity of the data output.The simulation results confirm the effectiveness of the proposed algorithm.
|
|---|
