Show simple item record

dc.contributor.authorHua, Shaoxiong
dc.contributor.authorQu, Gang
dc.date.accessioned2009-04-10T18:23:45Z
dc.date.available2009-04-10T18:23:45Z
dc.date.issued2003-04
dc.identifier.citationS. Hua and G. Qu. "A New Quality of Service Metric for Hard/Soft Real-Time Applications," IEEE International Conference on Information Technology: Coding and Computing (ITCC'03), pp. 347-351, April 2003.en
dc.identifier.urihttp://hdl.handle.net/1903/9051
dc.description.abstractReal-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data dependency. The simple but widely used task completion ratio, as the Quality of Service (QoS) metric, does not capture these characteristics and can not reflect user perceived QoS well. In this paper, we propose a new quantitative QoS metric, which is based on task completion ratio but differentiates hard and soft deadlines and models data dependency as well. Basically, it assigns different weights to hard and soft deadline tasks, penalizes late soft task completion, and measures the tasks affected by any dropped tasks. We apply popular online schedulers, such as EDF (earliest deadline first), FCFS (first come first serve), and LETF (least execution time first), on a set of simulated MPEG movies at the frame level and for each application compare the new QoS measurement, traditional completion ratio with the “real” completion ratio which considers the number of correctly decoded frames and has been mapped to the user perceived QoS well. Experimental results show that our proposed QoS metric can reflect real life QoS much better than the traditional one.en
dc.format.extent265534 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen
dc.publisherIEEEen
dc.subjectquality of serviceen
dc.subjectschedulingen
dc.titleA New Quality of Service Metric for Hard/Soft Real-Time Applicationsen
dc.typeArticleen
dc.relation.isAvailableAtA. James Clark School of Engineeringen_us
dc.relation.isAvailableAtElectrical & Computer Engineeringen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us
dc.rights.licenseCopyright © 2003 IEEE. Reprinted from IEEE International Conference on Information Technology. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Maryland's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record