• Login
    View Item 
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Master's Theses
    • View Item
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Master's Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UA Campus RepositoryCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournal

    My Account

    LoginRegister

    About

    AboutUA Faculty PublicationsUA DissertationsUA Master's ThesesUA Honors ThesesUA PressUA YearbooksUA CatalogsUA Libraries

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Matrix representations and analytical solution methods for stochastic activity networks

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    azu_td_1342682_sip1_w.pdf
    Size:
    4.764Mb
    Format:
    PDF
    Download
    Author
    Tvedt, Janet Elaine, 1963-
    Issue Date
    1990
    Keywords
    Engineering, Electronics and Electrical.
    Operations Research.
    Computer Science.
    Advisor
    Sanders, William H.
    
    Metadata
    Show full item record
    Publisher
    The University of Arizona.
    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.
    Abstract
    Stochastic activity networks, a probabilistic extension of Petri nets, can be used to evaluate the performance, dependability, and performability of a wide variety of systems. When analytical solution methods are used, it is necessary to generate a state-level representation of a model prior to solution. The transition-rate matrices obtained from this representation tend to be very large and sparse. Analytical solutions to such problems can only be obtained by exploiting the matrix sparsity both in storage and computation. We do this, by studying alternative matrix representation schemes and steady-state and transient solution methods, and implementing methods appropriate for problems of this type. The results suggest that the implemented techniques can yield analytical solutions for many realistic models of computer systems and networks. This is evidenced by the performance evaluation of a CSMA/CD Local area network.
    Type
    text
    Thesis-Reproduction (electronic)
    Degree Name
    M.S.
    Degree Level
    masters
    Degree Program
    Graduate College
    Degree Grantor
    University of Arizona
    Collections
    Master's Theses

    entitlement

     
    The University of Arizona Libraries | 1510 E. University Blvd. | Tucson, AZ 85721-0055
    Tel 520-621-6442 | repository@u.library.arizona.edu
    DSpace software copyright © 2002-2017  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.