HPorter is a DSL embedded in Haskell for composing processes running on a parallel computer. Using arrows (a generalization of monads), one can "wire together" processes in a manner analogous to a signal-pro...
详细信息
ISBN:
(纸本)9783540696087
HPorter is a DSL embedded in Haskell for composing processes running on a parallel computer. Using arrows (a generalization of monads), one can "wire together" processes in a manner analogous to a signal-processing application. The processes themselves are typically existing C or C++ programs, but may also be programs written in a first-order sub-language in Haskell that supports basic arithmetic, trigonometric functions, and other related operations. In both cases, once the processes are wired together, the supporting Haskell implementation is out of the loop - imported C programs run unimpeded, the Haskell sub-language is compiled into C code, and all data paths run directly between C processes. But in addition, HPorter's event-driven reactivity permits reconfiguration of these tightly-coupled processes at any time, thus providing a degree of dynamism that is critical in many applications. The advantages of our approach over conventional scripting languages include a higher degree of type safety, a declarative style, dynamic reconfiguration of processes, having the full power of Haskell, and portability across operating systems. We have implemented HPorter both on the QNX operating system and using conventional TCP/IP sockets, and are using it in a practical application in Yale's Humanoid Robotics Laboratory, where the processes correspond to soft-real-time tasks such as computer vision, motor control, planning, and limb kinematics.
In this paper, we present an advanced placement which aims at both flattening the temperature and decreasing the area in SoC floorplanning. The placement process is ingeniously converted into a quasi TSP problem and i...
详细信息
In this paper, we present an advanced placement which aims at both flattening the temperature and decreasing the area in SoC floorplanning. The placement process is ingeniously converted into a quasi TSP problem and is solved by ant colony optimization (ACO) algorithm. Compared to traditional algorithms based on O-tree and B*-tree optimization, our results show great improvement in calculating speed while promising satisfying accuracy.
During the last years, component based software development has become a well accepted software engineering paradigm within the automotive industry. This fact is not only reflected by upcoming development tools but al...
详细信息
During the last years, component based software development has become a well accepted software engineering paradigm within the automotive industry. This fact is not only reflected by upcoming development tools but also by newly arising automotive software standards. In component based software engineering, applications are built by assembling small reusable building blocks, the components. Typically more than one component implementation meets the application developer's requirements, so proper selection of the assembled components becomes a key element of the whole procurement and engineering process. This paper's contribution is twofold: First, a basic set of performance and dependability metrics and measures for automotive components is identified. Second, a unified benchmarking process is proposed, that allows an unambiguous comparison of distinct component implementations of a given component class.
Embedded systems are computational environments having restricted capabilities. These restrictions make the incorporation of high-level general purpose libraries, such as *** and ***, into the embedded systems softwar...
详细信息
Embedded systems are computational environments having restricted capabilities. These restrictions make the incorporation of high-level general purpose libraries, such as *** and ***, into the embedded systems software development process problematic. This paper describes a general transformation-based approach that can be used to adapt Java libraries making them compatible with the computational restrictions imposed by embedded environments.
We propose an error resilience transcoder based on the intra refresh technique for H.264/AVC videos. Our algorithm focuses on making decisions on the number of inserted intra MBs, allocations of proper MBs for intra r...
详细信息
We propose an error resilience transcoder based on the intra refresh technique for H.264/AVC videos. Our algorithm focuses on making decisions on the number of inserted intra MBs, allocations of proper MBs for intra refresh, and the quantization parameter for each P-frame, according to varying channel condition and frame contents. We build source distortion, channel distortion, and bit-rate models for prediction and adopt the Lagrangian multiplier approach for constrained optimization. Existing algorithms are compared in experiments. The results show that our algorithm improves PSNR by 0.28~2.76 dB, compared to the "equal intra refresh" approach. Our algorithm also outperforms CBERC (Chen and Wang, 2001) by 0.1~1.13 dB, with the same number of inserted intra MBs, but different MB priorities in allocation
This paper proposes combined decoding architecture and high-throughput flexible transform design to effectively decode the residual data for H.264/AVC decoders. The inverse quantization (IQ) procedure is combined with...
详细信息
This paper proposes combined decoding architecture and high-throughput flexible transform design to effectively decode the residual data for H.264/AVC decoders. The inverse quantization (IQ) procedure is combined with context-based adaptive variable length coding (CAVL) decoder to efficiently achieve the simplification. Besides, the flexible transform architecture is also proposed for effective computation of all transforms needed in H.264/AVC decoders. Since all the transforms are realized in the same architecture, the flexible transform design with the throughput of 8 pixels/sec needs fewer logic gate counts. Simulation results show that the implemented gate count is 18.6k and the maximum operating frequency is 125 MHz. For real-time requirements, this proposed design achieves 4VGA (1280times960)@30 frames/sec in the worst case.
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system workload. Thus, online adaptation must be...
详细信息
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system workload. Thus, online adaptation must be adopted in face of workload changes in such systems. We present the multiparametric rate adaptation (MPRA) algorithm for discrete rate adaptation in distributed real-time systems with end-to-end tasks. The key novelty and advantage of MPRA is that it can efficiently produce optimal solutions in response to workload variations such as dynamic task arrivals. Through offline preprocessing MPRA transforms an NP-hard utility optimization problem to the evaluation of a piecewise linear function of the CPU utilization. At run time MPRA produces optimal solutions by evaluating the function based on the CPU utilization. Analysis and simulation results show that MPRA maximizes system utility in the presence of varying workloads, while reducing the online computation complexity to polynomial time.
In order to get accurately the coding characteristics of current basic unit, a novel adaptive coding characteristic prediction scheme called texture-complexity estimation is proposed. Through adaptive linear texture-c...
详细信息
In order to get accurately the coding characteristics of current basic unit, a novel adaptive coding characteristic prediction scheme called texture-complexity estimation is proposed. Through adaptive linear texture-complexity and overhead prediction model as well as optimum bits allocation scheme, we can obtain current basic unit coding parameter such as texture-complexity, overhead bits count and texture bits budget, and then the quantization parameter can be directly calculated. Simulation results show that the H.264 encoder, using the proposed rate control algorithm, achieves a visual quality improvement up to 0.388 dB, meets better with target bit rates and produces more flat bit-rate curve than that using the H.264 previous rate control method (JVT-G012).
In this paper, we present an improved frame level mean absolute difference (MAD) prediction model for H.264/AVC rate control. Based on the histogram information of successive frames, the MAD of current frame can be ac...
详细信息
In this paper, we present an improved frame level mean absolute difference (MAD) prediction model for H.264/AVC rate control. Based on the histogram information of successive frames, the MAD of current frame can be accurately estimated. Instead of only using buffer status in the frame target bits allocation process, we also take into consideration the frame complexity which depends on the improved predicted frame MAD value. The objective of this frame complexity based bit allocation is to follow the non-stationary characteristics of video source and to provide smoother visual quality. Simulation results show that by using our proposed scheme, smaller frame target bits mismatch can be achieved. In addition, the average peak signal-to-noise ratio (PSNR) for the reconstructed video is improved by up to 0.5 dB with up to 62% reduction in picture quality variation.
This paper focuses on three kinds of normal forms: the weak conjunctive normal form, the weak disjunctive normal form and the weak implicational normal form. The existence of these normal forms in Godel logics is inve...
详细信息
This paper focuses on three kinds of normal forms: the weak conjunctive normal form, the weak disjunctive normal form and the weak implicational normal form. The existence of these normal forms in Godel logics is investigated, and two kinds of reduction methods for them are presented, one of which is based on model-characterizing formulas and the other on rewriting systems. As byproducts of these investigations, three kinds of model-characterizing formulas are obtained. In the end, the complexities of reductions to these normal forms are also studied.
暂无评论