Coen Tempelaars, M. M. H. P. van den Heuvel, R. J. Bril, S. Schiemenz, C. Hentschel
{"title":"Real-time priority processing on the Cell platform","authors":"Coen Tempelaars, M. M. H. P. van den Heuvel, R. J. Bril, S. Schiemenz, C. Hentschel","doi":"10.1109/ICCE.2011.5722514","DOIUrl":null,"url":null,"abstract":"Flexible signal processing on programmable platforms are increasingly important for consumer electronic applications. Scalable video algorithms (SVAs) using the novel principle of priority processing guarantee real-time performance on programmable platforms, even with limited resources. Dynamic resource allocation is required to maximize the overall output quality of independent, competing priority processing algorithms that are executed on a shared platform. In this paper we describe the mapping of a priority processing application on the Cell/B.E. platform. We compare the performance of different implementations for dynamic-resource-allocation mechanisms, and show that priority processing achieves real-time performance.","PeriodicalId":256368,"journal":{"name":"2011 IEEE International Conference on Consumer Electronics (ICCE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Consumer Electronics (ICCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCE.2011.5722514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Flexible signal processing on programmable platforms are increasingly important for consumer electronic applications. Scalable video algorithms (SVAs) using the novel principle of priority processing guarantee real-time performance on programmable platforms, even with limited resources. Dynamic resource allocation is required to maximize the overall output quality of independent, competing priority processing algorithms that are executed on a shared platform. In this paper we describe the mapping of a priority processing application on the Cell/B.E. platform. We compare the performance of different implementations for dynamic-resource-allocation mechanisms, and show that priority processing achieves real-time performance.