Show simple item record

dc.contributor.authorMeka, Archana
dc.date.accessioned2014-03-04T16:21:44Z
dc.date.available2014-03-04T16:21:44Z
dc.date.issued2008-12
dc.identifier.othermeka_archana_200812_ms
dc.identifier.urihttp://purl.galileo.usg.edu/uga_etd/meka_archana_200812_ms
dc.identifier.urihttp://hdl.handle.net/10724/25254
dc.description.abstractWe 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.
dc.languageeng
dc.publisheruga
dc.rightspublic
dc.subjectLLREF, optimal scheduling algorithm, uniform multiprocessors
dc.titleA scheduling algorithm and utilization bound for uniform multiprocessors
dc.typeThesis
dc.description.degreeMS
dc.description.departmentComputer Science
dc.description.majorComputer Science
dc.description.advisorShelby Funk
dc.description.committeeShelby Funk
dc.description.committeeRobert Robinson
dc.description.committeeJohn A. Miller


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record