A technique for simulating composed SAN-based reward models
| dc.contributor.advisor | Sanders, William | en_US |
| dc.contributor.author | Freire, Roberto, 1960- | |
| dc.creator | Freire, Roberto, 1960- | en_US |
| dc.date.accessioned | 2013-04-03T13:25:26Z | |
| dc.date.available | 2013-04-03T13:25:26Z | |
| dc.date.issued | 1990 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/278460 | |
| dc.description.abstract | Stochastic activity networks (SANs) have been used in the modeling of computer systems because of their suitability in representing distributed systems. SANs may be solved by analysis or by simulation. When simulation is used, future events list management is very time consuming, as with other simulation techniques. New methods that take advantage of the SAN model structure are presented which significantly reduce the cost of future events list management. Multiple future events lists are used to reduce operations required upon each state change. | |
| dc.language.iso | en_US | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Engineering, Electronics and Electrical. | en_US |
| dc.subject | Engineering, System Science. | en_US |
| dc.subject | Computer Science. | en_US |
| dc.title | A technique for simulating composed SAN-based reward models | en_US |
| dc.type | text | en_US |
| dc.type | Thesis-Reproduction (electronic) | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | masters | en_US |
| dc.identifier.proquest | 1342649 | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.name | M.S. | en_US |
| dc.identifier.bibrecord | .b26592216 | en_US |
| refterms.dateFOA | 2018-06-15T09:25:56Z | |
| html.description.abstract | Stochastic activity networks (SANs) have been used in the modeling of computer systems because of their suitability in representing distributed systems. SANs may be solved by analysis or by simulation. When simulation is used, future events list management is very time consuming, as with other simulation techniques. New methods that take advantage of the SAN model structure are presented which significantly reduce the cost of future events list management. Multiple future events lists are used to reduce operations required upon each state change. |
