Show simple item record

dc.contributor.authorFeizabadi, Shahrooz Shojaniaen_US
dc.date.accessioned2014-03-14T20:21:05Z
dc.date.available2014-03-14T20:21:05Z
dc.date.issued2006-12-07en_US
dc.identifier.otheretd-12222006-020218en_US
dc.identifier.urihttp://hdl.handle.net/10919/30233
dc.description.abstractUtility Accrual (UA) scheduling is a method of dynamic real-time scheduling that is designed to respond to overload conditions by producing a feasible schedule that heuristically maximizes a pre-defined metric of utility. Whereas utility accrual schedulers have traditionally focused on CPU overload, this dissertation explores memory overload conditions during which the aggregate memory demand exceeds a system's available memory bandwidth.

Real-time systems are typically implemented in C or other languages that use explicit dynamic memory management. Taking advantage of modern type-safe languages, such as Java, necessitates the use of garbage collection (GC). The timeliness requirements of real-time systems, however, impose specific demands on the garbage collector. Garbage collection introduces a significant source of unpredictability in the execution timeline of a task because it unexpectedly interjects pauses of arbitrary length, at arbitrary points in time, with an arbitrary frequency.

To construct a feasible schedule, a real-time scheduler must have the ability to predict the collector's activities and plan for them accordingly. We have devised CADUS (Collector-Aware Dynamic Utility Scheduler), a utility accrual algorithm that tightly links CPU scheduling with the memory requirements -and the corresponding garbage collection activities - of real-time tasks. By constructing and storing memory time allocation profiles, we address the problem of GC activation strategy. We estimate GC latency by using a real-time collector and modeling its behavior. We project GC frequency by planning, at schedule construction time, the memory bandwidth available to the collector. CADUS can point the collector's activities to any specific task in the system. The runtime system provides this ability by maintaining separate logical heaps for all tasks.

We demonstrate the viability of CADUS through extensive simulation studies. We evaluated the behavior of CADUS under a wide range of CPU and memory load conditions and utility distributions. We compared its performance against an existing GC-unaware UA scheduler and found that CADUS consistently outperformed its GC-unaware counterpart. We investigated and identified the reasons for the superior performance of CADUS and quantified our results. Most significantly, we found that in an overloaded dynamic soft real-time system, a scheduler's preemption decisions have a highly significant impact on GC latency. A dynamic real-time scheduler therefore must predict the impact of its preemption decisions on GC latency in order to construct time-feasible schedules.

en_US
dc.publisherVirginia Techen_US
dc.relation.haspartdissertation.pdfen_US
dc.rightsI hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to Virginia Tech or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report.en_US
dc.subjectGarbage Collectionen_US
dc.subjectUtility Accrual Schedulingen_US
dc.subjectReal-Time Systemsen_US
dc.titleGarbage Collection Scheduling for Utility Accrual Real-Time Systemsen_US
dc.typeDissertationen_US
dc.contributor.departmentComputer Scienceen_US
dc.description.degreePh. D.en_US
thesis.degree.namePh. D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen_US
thesis.degree.disciplineComputer Scienceen_US
dc.contributor.committeechairBack, Godmar Volkeren_US
dc.contributor.committeememberNance, Richard E.en_US
dc.contributor.committeememberJensen, E. Douglasen_US
dc.contributor.committeememberArthur, James D.en_US
dc.contributor.committeememberCline, Benjamin E.en_US
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-12222006-020218/en_US
dc.contributor.committeecochairFox, Edward Alanen_US
dc.date.sdate2006-12-22en_US
dc.date.rdate2007-04-06
dc.date.adate2007-04-06en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record