Analysis of the non-saturated Readers and Writers system with a threshold policy

dc.contributor.authorXu, Ericen_US
dc.date.accessioned2007-05-22T15:15:21Z
dc.date.available2007-05-22T15:15:21Z
dc.date.issued2001-05-01T00:00:00Zen_US
dc.degree.disciplineMechanical and Manufacturing Engineeringen_US
dc.degree.levelMaster of Science (M.Sc.)en_US
dc.description.abstractThis thesis builds an analytical model system for the non-saturated Writers and Readers problem with threshold service policy. The Writers and Readers problem is a queuing system which has two kinds of customers and multiple servers. The two kinds of customers are called "Writers" and "Readers" respectively. A Writer is served by all servers as a single server system. Readers can be served each by one server as a multiple server system. This thesis sets up two vacation models for the Writers and Readers respectively. Since the dependency between Writers and Readers is approximated, this model system is an approximation. The numerical results compared with the simulation results show that this vacation model system approximates the non-saturated Writers and Readers problem very well. The non-saturated Writers and Readers system with threshold service policy is a general situation of the classical Writers and Readers problem. It considers the case where both Writers and Readers have thresholds for beginning of service. (Abstract shortened by UMI.)en_US
dc.format.extent3006945 bytes
dc.format.extent184 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.identifier.urihttp://hdl.handle.net/1993/2074
dc.language.isoengen_US
dc.rightsopen accessen_US
dc.titleAnalysis of the non-saturated Readers and Writers system with a threshold policyen_US
dc.typemaster thesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
MQ57597.pdf
Size:
2.87 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
184 B
Format:
Plain Text
Description: