NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
A multiple subsystem simulator of processor scheduling
dc.contributor.advisor | Pooch, Udo W. | |
dc.creator | Reeves, Thomas Edward | |
dc.date.accessioned | 2020-09-02T20:46:06Z | |
dc.date.available | 2020-09-02T20:46:06Z | |
dc.date.issued | 1975 | |
dc.identifier.uri | https://hdl.handle.net/1969.1/DISSERTATIONS-184260 | |
dc.description.abstract | A multiple subsystem simulator of processor scheduling for performance of a time-sharing system has been developed and validated. This FB₃ multiple subsystem utilizes an objective function which considers both processor time as well as memory requests. A previously developed iterative optimization procedure is extended to provide measures of performance optimization, i.e. optimization with respect to variables of the software and management control in a hardware fixed environment. This iterative optimization technique utilizing both an analytic and simulation approach applies to computer system models driven by either a general system load or an objective function based on general forms of cost of delay functions. The job load is described by two probability density functions; one which describes the interarrival time between requests and one which describes a request's need for processor time. The optimization procedure requires no assumptions concerning the description of these probability density functions. In general, either one or both functions can be described by histograms. The other component of the system load, management control, involves the choice of a family of Greenberger cost of delay functions. The optimization procedure requires no assumptions concerning the functional form of these cost of delay functions. The developed simulator is applied to several scheduler models from this class of optimization models, these models are solved, and the results validated. Representative models that are analyzed include Hellerman's scheduling functions, round-robin, FB₂ and FB₃. A mathematical multiple subsystem model, based on the work of Blatny, Clark, and Rourke, of processor scheduling for performance of a time-sharing system is constructed. The optimization procedure used to find the optimal cost of the FB₃ multiple subsystem is an extension from two to three-dimensional state space. These models were validated by comparing derived data to acceptable values from other models specified in the literature. | en |
dc.format.extent | 166 leaves | en |
dc.format.medium | electronic | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.rights | This 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.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Computing Science | en |
dc.subject.classification | 1975 Dissertation R332 | |
dc.title | A multiple subsystem simulator of processor scheduling | en |
dc.type | Thesis | en |
thesis.degree.discipline | Computing Science | en |
thesis.degree.grantor | Texas A&M University | en |
thesis.degree.name | Doctor of Philosophy | en |
thesis.degree.name | Ph. D. in Computing Science | en |
thesis.degree.level | Doctorial | en |
dc.type.genre | dissertations | en |
dc.type.material | text | en |
dc.format.digitalOrigin | reformatted digital | en |
dc.publisher.digital | Texas A&M University. Libraries | |
dc.identifier.oclc | 5778793 |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
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.