Show simple item record

dc.contributor.advisorCrawford, Paul B.
dc.contributor.advisorWortham, A. W.
dc.creatorMcCarthy, Edmond Robert
dc.description.abstractConsidering time-sharing as a stochastic queuing process, a probabilistic model of an infinite source round robin time-shared system is formulated and studied under a variety of circumstances. At first, a continuous process is considered using independent Poisson arrivals and exponential service. Assumptions include positive overhead time and explicit fixed priorities or bribes chosen a priori by the user of the system without any specific knowledge of the state of the system at the time he seeks to submit his job. For analytical convenience, a Markov chain is embedded within the continuous system and analysis proceeds via the method of generating functions on the discrete renewal points of the Markov sequence. Performance measures derived include the first and second moments for the state variable (number of tasks in the system) at stationarity, waiting time moments both for the job queue and the entire system conditioned on a known service requirement and the mean of the first response for user requests belonging to a given priority class.en
dc.format.extent149 leavesen
dc.rightsThis thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use.en
dc.subject.classification1974 Dissertation M123
dc.titleTime-sharing analysis combining processor scheduling and memory resourcesen
dc.typeThesisen Scienceen A&M Universityen of Philosophyen
dc.contributor.committeeMemberDrew, Dan
dc.contributor.committeeMemberPulley, Eugene
dc.contributor.committeeMemberStone, Douglas
dc.format.digitalOriginreformatted digitalen
dc.publisher.digitalTexas A&M University. Libraries

Files in this item


This item appears in the following Collection(s)

Show simple item record

This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.

Request Open Access