• About
    • Login
    View Item 
    •   Institutional Repository Home
    • Electronic Theses and Dissertations
    • Electronic Theses and Dissertations
    • View Item
    •   Institutional Repository Home
    • Electronic Theses and Dissertations
    • Electronic Theses and Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Institutional RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDepartmentThis CollectionBy Issue DateAuthorsTitlesSubjectsDepartment

    My Account

    LoginRegister

    The Explicit Incorporation of Variance in the Performance Modeling of Scheduling Algorithms in Distributed and Soft Real-Time Systems

    Hamm, Nathan
    : https://etd.library.vanderbilt.edu/etd-03282011-020103
    http://hdl.handle.net/1803/11586
    : 2011-04-14

    Abstract

    As distributed and real-time systems become more pervasive, there is growing interest in their performance and reliability. The workloads found in these environments can exhibit variability that results in unpredictable and undesirable system behavior. Therefore, a key requirement in analyzing such systems is developing robust models and tools that accurately replicate the task workload and correctly mimic the variability found in real-world environments. Based on observations made during a case study of an enterprise grid environment, the method of stages modeling technique is adopted and applied to the performance evaluation of soft real-time systems. This approach achieves a two-moment match of performance parameters and allows the effects of variance to be studied in a uniform and systematic manner. Based on this technique, a new discrete-event simulator, the Method Of Stages Simulator (MOSS), is developed and used to conduct sensitivity analysis experiments on the variance of task parameters such as arrival, service, and deadline rates. The Matlab State-space Analysis Tool (MSAT) is also developed, which constructs and analytically solves state-space models representing small real-time systems. Traditional real-time scheduling algorithms such as Rate Monotonic (RM), Earliest Deadline First (EDF), and Least Laxity First (LLF) ignore the variance of performance parameters when allocating resources. However, this variance can directly influence the choice of the best scheduling algorithm, particularly under varying system loads. Explicit incorporation of variance in scheduling decisions leads to hybrid scheduling algorithms that are insensitive to, or unaffected by, the workload variability. Results from MOSS sensitivity analysis experiments suggest a promising new scheduling algorithm, TLAX (Threshold LAXity), that outperforms the traditional algorithms by as much as 50% in heavy load conditions. MSAT is used to analytically validate the results obtained from MOSS and to gain further insight into the robust TLAX algorithm. The explicit incorporation of variance in the performance modeling of scheduling algorithms improves the design, efficiency, and performance of distributed and soft real-time systems.
    Show full item record

    Files in this item

    Icon
    Name:
    01_Hamm_dissertation_complete.pdf
    Size:
    12.36Mb
    Format:
    PDF
    View/Open

    This item appears in the following collection(s):

    • Electronic Theses and Dissertations

    Connect with Vanderbilt Libraries

    Your Vanderbilt

    • Alumni
    • Current Students
    • Faculty & Staff
    • International Students
    • Media
    • Parents & Family
    • Prospective Students
    • Researchers
    • Sports Fans
    • Visitors & Neighbors

    Support the Jean and Alexander Heard Libraries

    Support the Library...Give Now

    Gifts to the Libraries support the learning and research needs of the entire Vanderbilt community. Learn more about giving to the Libraries.

    Become a Friend of the Libraries

    Quick Links

    • Hours
    • About
    • Employment
    • Staff Directory
    • Accessibility Services
    • Contact
    • Vanderbilt Home
    • Privacy Policy