{"title":"基于不精确计算的可扩展流媒体系统实时调度","authors":"Kui Gao , Wen Gao , Simin He , Yuan Zhang","doi":"10.1016/j.rti.2004.08.002","DOIUrl":null,"url":null,"abstract":"<div><p>This paper proposes a performance metrics and a real-time scheduling algorithm based on imprecise computation workload model for delivery of scalable streaming media, which can be adapted to network status and QoS requirement over the best-effort Internet. The scheduling task of a scalable streaming media is partitioned into two subtasks: the mandatory subtask for the base layer and the optional subtask for the enhancement layers. The imprecise computation workload model and real-time scheduling algorithm provide scheduling flexibility by trading off video quality reconstructed in client to meet the playback deadline. Thus, the better usage of available bandwidth and smoother playback are achieved.</p></div>","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"10 5","pages":"Pages 307-313"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.rti.2004.08.002","citationCount":"4","resultStr":"{\"title\":\"Real-time scheduling based on imprecise computation for scalable streaming media system over the Internet\",\"authors\":\"Kui Gao , Wen Gao , Simin He , Yuan Zhang\",\"doi\":\"10.1016/j.rti.2004.08.002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper proposes a performance metrics and a real-time scheduling algorithm based on imprecise computation workload model for delivery of scalable streaming media, which can be adapted to network status and QoS requirement over the best-effort Internet. The scheduling task of a scalable streaming media is partitioned into two subtasks: the mandatory subtask for the base layer and the optional subtask for the enhancement layers. The imprecise computation workload model and real-time scheduling algorithm provide scheduling flexibility by trading off video quality reconstructed in client to meet the playback deadline. Thus, the better usage of available bandwidth and smoother playback are achieved.</p></div>\",\"PeriodicalId\":101062,\"journal\":{\"name\":\"Real-Time Imaging\",\"volume\":\"10 5\",\"pages\":\"Pages 307-313\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.rti.2004.08.002\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Real-Time Imaging\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S107720140400066X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Real-Time Imaging","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S107720140400066X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Real-time scheduling based on imprecise computation for scalable streaming media system over the Internet
This paper proposes a performance metrics and a real-time scheduling algorithm based on imprecise computation workload model for delivery of scalable streaming media, which can be adapted to network status and QoS requirement over the best-effort Internet. The scheduling task of a scalable streaming media is partitioned into two subtasks: the mandatory subtask for the base layer and the optional subtask for the enhancement layers. The imprecise computation workload model and real-time scheduling algorithm provide scheduling flexibility by trading off video quality reconstructed in client to meet the playback deadline. Thus, the better usage of available bandwidth and smoother playback are achieved.