Proceedings of the 15th IEEE/ACM Symposium on Embedded Systems for Real-Time Multimedia最新文献

{"title":"System-level reliability analysis considering imperfect fault coverage","authors":"Faramarz Khosravi, H. Aliee, J. Teich","doi":"10.1145/3139315.3141787","DOIUrl":"https://doi.org/10.1145/3139315.3141787","url":null,"abstract":"Safety-critical systems rely on redundancy schemes such as k-out-of-n structures which enable tolerance against multiple faults. These techniques are subject to Imperfect Fault Coverage (IFC) as error detection and recovery might be prone to errors or even impossible for certain fault models. As a result, these techniques may act as single points of failure in the system where uncovered faults might be overlooked and lead to wrong system outputs. Neglecting IFC in reliability analysis may lead to fatal overestimations in case of safety-critical applications. Yet, existing techniques that do consider IFC are overly pessimistic in assuming that the occurrence of an uncovered fault always results in a system failure. But often, in particular in complex systems with nested redundant structures, a fault that is not noticed by an inner redundancy scheme might be caught by an outer redundancy scheme. This paper proposes to automatically incorporate IFC into reliability models, i. e. Binary Decision Diagrams (BDDs), to enable an accurate reliability analysis for complex system structures including nested redundancies and repeated components. It also shows that IFC does not equally affect different redundancy schemes. Experimental results presented for applications in multimedia and automotive confirm that the proposed approach can analyze system reliability more accurately at an acceptable execution time and memory overhead compared to the underlying IFC-unaware technique.","PeriodicalId":208026,"journal":{"name":"Proceedings of the 15th IEEE/ACM Symposium on Embedded Systems for Real-Time Multimedia","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121963983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Approximate compression: enhancing compressibility through data approximation","authors":"Harini Suresh, Shashank Hegde, J. Sartori","doi":"10.1145/3139315.3139319","DOIUrl":"https://doi.org/10.1145/3139315.3139319","url":null,"abstract":"Internet-connected mobile processors used in cellphones, tablets, and internet-of-things (IoT) devices are generating and transmitting data at an ever-increasing rate. These devices are already the most abundant types of processor parts produced and used today and are growing in ubiquity with the rapid proliferation of mobile and IoT technologies. Size and usage characteristics of these data-generating systems dictate that they will continue to be both bandwidth- and energy-constrained. The most popular mobile applications, dominating communication bandwidth utilization for the entire internet, are centered around transmission of image, video, and audio content. For such applications, where perfect data quality is not required, approximate computation has been explored to alleviate system bottlenecks by exploiting implicit noise tolerance to trade off output quality for performance and energy benefits. However, it is often communication, not computation, that dominates performance and energy requirements in mobile systems. This is coupled with the increasing tendency to offload computation to the cloud, making communication efficiency, not computation efficiency, the most critical parameter in mobile systems. Given this increasing need for communication efficiency, data compression provides one effective means of reducing communication costs. In this paper, we explore approximate compression and communication to increase energy efficiency and alleviate bandwidth limitations in communication-centric systems. We focus on application-specific approximate data compression, whereby a transmitted data stream is approximated to improve compression rate and reduce data transmission cost. Whereas conventional lossy compression follows a one-size-fits-all mentality in selecting a compression technique, we show that higher compression rates can be achieved by understanding the characteristics of the input data stream and the application in which it is used. We introduce a suite of data stream approximations that enhance the compression rates of lossless compression algorithms by gracefully and efficiently trading off output quality for increased compression rate. For different classes of images, we explain the interaction between compression rate, output quality, and complexity of approximation and establish comparisons with existing lossy compression algorithms. Our approximate compression techniques increase compression rate and reduce bandwidth utilization by up to 10X with respect to state-of-the-art lossy compression while achieving the same output quality and better end-to-end communication performance.","PeriodicalId":208026,"journal":{"name":"Proceedings of the 15th IEEE/ACM Symposium on Embedded Systems for Real-Time Multimedia","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123363855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}