{"title":"Towards an Efficient Memory Architecture for Video Decoding Systems","authors":"A. Bonatto, M. Negreiros, A. Soares, A. Susin","doi":"10.1109/SBESC.2012.45","DOIUrl":"https://doi.org/10.1109/SBESC.2012.45","url":null,"abstract":"Multimedia applications are known to use large amounts of memory. The video modules need also high throughput memory port for coding and decoding high resolution video sequences. The design of a multimedia System-on-Chip (SoC) could implement embedded block RAMs but it is much more cost-effective to use a single external memory at the expense of a multichannel memory controller. This paper presents the design and implementation of an efficient memory hierarchy for a Set-Top Box (STB) SoC with a video decoder. To use efficiently the Double Data Rate (DDR) external memory it must be accessed in burst mode whenever possible. In this paper we develop an analysis and implementation of a four level memory hierarchy targeting data latency reduction and bandwidth optimization of the memory port. The case study is DDR2 SDRAM memory used as the main system video memory in a digital television set-top box implemented on a Virtex-5 FPGA. This paper presents the architecture of the system and shows that the memory hierarchy efficiently uses the DDR characteristics while serving four client processes. The proposed memory architecture can reduce data latency in 78% when compared to a direct demand-access procedure.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115304994","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}
D. Pasetto, H. Franke, K. Schleupen, David Maze, Hartmut Penner, Heather D. Achilles, Catherine H. Crawford, M. Purcell
{"title":"Design and Implementation of a Network Centric Appliance Platform","authors":"D. Pasetto, H. Franke, K. Schleupen, David Maze, Hartmut Penner, Heather D. Achilles, Catherine H. Crawford, M. Purcell","doi":"10.1109/SBESC.2012.46","DOIUrl":"https://doi.org/10.1109/SBESC.2012.46","url":null,"abstract":"Increasing demands on end-to-end solution performance has lead to a generation of workload optimized systems and appliances, with tightly integrated hardware and software delivering substantial improvements over general purpose architectures. Among the many challenges encountered in designing an appliance, the most complex one is making hardware and software high performance and, at the same time, render the system versatile enough to support as many workloads as possible. This paper provides a high level overview of the design and implementation process of such an appliance architecture, as realized by the IBM PowerEN team. The platform includes new silicon (the PowerEN processor), a novel system level board (Chroma card), system software and development kit, as well as end user applications for different industry domains. The solution has been completely designed by the team, starting from concept, to architecture, to implementation and delivery. The paper describes the most important characteristics of the platform, detailing how these influence its capability of supporting multiple optimized workloads.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127177748","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":"Cache Preemption Related Delay Accounting via Static Analysis and Functional Simulation","authors":"R. A. Starke, R. S. Oliveira","doi":"10.1109/SBESC.2012.36","DOIUrl":"https://doi.org/10.1109/SBESC.2012.36","url":null,"abstract":"Cache memory related preemption delay causes large variations of the task execution time and tools that perform WCET static code analysis usually do not consider this behavior. The additional cache delays are usually solved by cache partitioning between tasks or they are incorporated in the schedulability analysis equations. This paper estimates the cache preemption delay of a task in two steps: task static analysis for the instruction cache and functional simulation for the data cache. Both steps are used to track the memory references. After that, we estimate which cache blocks may actually cause additional cache faults in a preemption. Due to the use of functional simulation, the calculated cache preemption delay is not the worst case, but this technique does not rely on WCET tools nor the real hardware. After this analysis, we determine the cost of preemption at each point of the program more accurately.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125801290","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}
Raimundo Valter Costa, Silvio Fernandes, Leonardo Casilo, A. Soares, Denis Freire
{"title":"SICXE: Improving Experience with Didactic Processors","authors":"Raimundo Valter Costa, Silvio Fernandes, Leonardo Casilo, A. Soares, Denis Freire","doi":"10.1109/SBESC.2012.24","DOIUrl":"https://doi.org/10.1109/SBESC.2012.24","url":null,"abstract":"This paper presents the design, hardware description and test of SICXE processor, as well as a development environment and simulation tools for this architecture. Based on SIC processor, SICXE is a didactic 32-bit RISC that offers integer ALU, floating-point ALU, interrupts, addressing up to 4GB of program memory, programmed I/O based, DMA-based I/O and also supports a simple operating system. The physical model proposed fit in a compact design, operating at frequencies above 50 MHz and may compose larger projects of embedded systems. This entire software and hardware environment also may be applied for university courses in disciplines such as computer architecture, operating systems, system software and compilers.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121724408","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":"A Model to Calculate Exact End-to-End Delay of Sporadic Flows on AFDX Network Using Mathematical Programming","authors":"Leonardo Malta, R. S. Oliveira","doi":"10.1109/SBESC.2012.25","DOIUrl":"https://doi.org/10.1109/SBESC.2012.25","url":null,"abstract":"Avionics Full DupleX (AFDX) Switched Ethernet technology provides a deterministic network to avionics context. Guarantees on worst-case end-to-end (ETE) communication delays are required for certification purposes. This paper identifies the worst-case ETE analysis as an optimization problem and proposes a mathematical programming approach to calculate an exact worst-case delay and the corresponding scenario. It allows to significantly increase the size of the configuration for which an exact worst-case can be determined. The approach considers a set of sporadic flows with no assumption concerning the arrival time of packets.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130713666","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":"A Methodology to Adapt Data Path Architectures to a MIPS-1 Model","authors":"L. A. Casillo, Ivan Saraiva Silva","doi":"10.1109/SBESC.2012.41","DOIUrl":"https://doi.org/10.1109/SBESC.2012.41","url":null,"abstract":"MIPS (Microprocessor without Interlocked Pipeline Stages) is an Instruction Set Architecture used in applications such as computers, routers, game consoles and various embedded systems. Among the advantages of this pattern, it could be cited the variety of free software such as compilers and simulators. This paper shows a methodology required to adapt other architectures to use a MIPS-1 instruction set without significant increase in chip area and power dissipation. This methodology was applied in two case studies, which architectures at different complexity levels data paths will be adapted to a new model.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132405214","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}
Igor K. Pinotti, T. Webber, Natanael Ribeiro, Carlos N. Fraga, R. Fagundes, C. Marcon
{"title":"Partitioning Algorithms Analysis for Heterogeneous NoC Based MPSoC","authors":"Igor K. Pinotti, T. Webber, Natanael Ribeiro, Carlos N. Fraga, R. Fagundes, C. Marcon","doi":"10.1109/SBESC.2012.42","DOIUrl":"https://doi.org/10.1109/SBESC.2012.42","url":null,"abstract":"Several new applications have high complexity degree, requiring high processing rate and memory usage. Multiprocessor System-on-Chip (MPSoC) is a promising architecture to fulfill these requirements, due to its high parallelism that enables several tasks been executed at the same time. One problem in current heterogeneous MPSoC design is application's tasks partitioning aiming energy consumption minimization and load balance. In order to optimize partition problems, many algorithms have been applied to generate quality solutions. This work aims to analyze and compare stochastic and heuristic partitioning algorithms for obtaining low energy consumption and load balance when applied to tasks partitioning onto heterogeneous MPSoC.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129607498","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}
Luis Coutinho, A. M. Girao, J. B. Frota, Elias Teodoro da Silva
{"title":"Device to Assist the Visually Impaired in Reading Printed or Scanned Documents","authors":"Luis Coutinho, A. M. Girao, J. B. Frota, Elias Teodoro da Silva","doi":"10.1109/SBESC.2012.14","DOIUrl":"https://doi.org/10.1109/SBESC.2012.14","url":null,"abstract":"Individuals with visual impairment have their ability to access information limited by the lack of mass literature in Braille. This paper presents an embedded application to aid the visually impaired that allows reading and writing printed and/or digitized documents. The solution, designated PORTÁCTIL, is a device composed of five modules: (1) electromechanical Braille cells, (2) hand motion sensor, (3) processing unit, (4) wireless communication and (5) power supply. The text, locally stored or received by wireless communication, is translated to Braille and displayed following the movement of the hand of the reader. Thus, reading occurs in the same way as in books written in Braille. The device is powered by rechargeable batteries and is capable of receiving texts from smartphones and tablets through Bluetooth. Some prototypes were built and tested by several visually impaired users. The adaptation was very good as well as the acceptance. Properties such as weight / volume, energy consumption and performance were evaluated and are given in the full text.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127422931","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":"A Comprehensive Complexity Analysis of User-Level Memory Allocator Algorithms","authors":"T. Ferreira, M. Fernandes, Rivalino Matias","doi":"10.1109/SBESC.2012.27","DOIUrl":"https://doi.org/10.1109/SBESC.2012.27","url":null,"abstract":"Memory allocations are one of the most frequently used operations in computer programs. The performance of memory allocation operations is a critical factor in software design; however, it is very often neglected. In this paper, we present a comprehensive complexity analysis of widely adopted user-level memory allocator algorithms. We consider time and space complexity, as well as the allocator overhead. The results show that the Ptmalloc family of memory allocator algorithms outperformed all other investigated allocators in terms of theoretical time complexity and space overhead. All allocators showed the same space complexity.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116539376","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":"Request Batching Self-Configuration in Byzantine Fault-Tolerant Replication","authors":"A. S. Sá, A. E. S. Freitas, R. Macêdo","doi":"10.1109/SBESC.2012.32","DOIUrl":"https://doi.org/10.1109/SBESC.2012.32","url":null,"abstract":"Replication techniques that tolerate byzantine failures have been applied in distributed computing to cope with hostile environments in which system components may fail due to malicious or natural causes (e.g., intrusions). From the seminal work of Lamport, Pease and Shostak on Byzantine Generals, in 1982, Castro and Liskov proposed in 1999 a successful solution, named PBFT, which overcomes performance drawbacks of previous ones, based on a number of protocol optimizations, including the use of request batching. Such a work motivated several other works as extension of the PBFT protocol, improving PBFT performance in certain computing environment conditions. In these solutions, which we call PBFT-family protocols, the tuning of the request batching parameters are realized in design time. However, such configuration may not yield the desired performance in dynamic distributed systems where the underlying characteristics change dynamically (e.g., workload, channel QoS, network topology, etc.). To answer to this challenge, this paper proposes an innovative solution to the dynamic configuration of batching parameters inspired on feedback control theory. In order to evaluate its efficiency, the proposed solution is simulated in various scenarios and compared with the original version used in the PBFT-family protocols.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133316300","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}