• Login
    View Item 
    •   Athenaeum Home
    • University of Georgia Theses and Dissertations
    • University of Georgia Theses and Dissertations
    • View Item
    •   Athenaeum Home
    • University of Georgia Theses and Dissertations
    • University of Georgia Theses and Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A scheduling algorithm and utilization bound for uniform multiprocessors

    Thumbnail
    Date
    2008-12
    Author
    Meka, Archana
    Metadata
    Show full item record
    Abstract
    We present a new scheduling algorithm, U-LLREF, which is the first scheduling algorithmfor that is optimal for uniform multiprocessors. It is an extension of the LLREF algorithmfor identical multiprocessors. These algorithms attempt to emulate a fluid scheduling model,which executes all periodic tasks at a constant rate equal to their utilization. Like the LLREFalgorithm, U-LLREF generates schedules based on the fairness notion. It uses the Time andLocal execution time (TL) plane to describe fluid schedules and ensures the amount of workcompleted by each task remains close to the corresponding amount of work in the fluidschedule by monitoring task progress within TL planes.
    URI
    http://purl.galileo.usg.edu/uga_etd/meka_archana_200812_ms
    http://hdl.handle.net/10724/25254
    Collections
    • University of Georgia Theses and Dissertations

    About Athenaeum | Contact Us | Send Feedback
     

     

    Browse

    All of AthenaeumCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    About Athenaeum | Contact Us | Send Feedback