Degree of parallelism

About: Degree of parallelism is a research topic. Over the lifetime, 1515 publications have been published within this topic receiving 25546 citations.

A prototype data flow computer with token labelling

Abstract: Computer users in many areas of scientific study appear to have an almost insatiable desire for processing power. Many of the computations exhibit a high degree of parallelism which is not exploited in conventional computer structures. Considerable interest has been shown in parallel computer architectures in the last decade in order to make use of this property.

Parallel AMVP candidate list construction for HEVC

Abstract: Advanced motion vector prediction (AMVP) is one of the most important inter prediction coding tools adopted in the state-of-the-art HEVC coding standard, which does great effect on the coding efficiency. However, the current AMVP design is highly sequential and thus restricts the throughput both on the encoder and the decoder sides. To facilitate the parallel processing and enlarge the throughput, a parallel AMVP candidate list (AMVPCL) construction solution is proposed. The proposed parallel scheme consists of a three level fine granularity solutions. The first level is a CU-based approach and it constructs AMVPCL of all PUs in the same CU in parallel. The second level is also at CU level but it generates a single set of AMVPCL for all PUs inside a CU. Specifically, we only apply this method to 8×8 CU to balance the parallelism degree and rate-distortion performance. The third level is a CU-group based approach, in which AMVPCL of all PUs in the same CU-group are constructed in parallel. Experimental results show the proposed algorithm can efficiently achieve parallel motion estimation with negligible 0.0%∼1.3% BD-rate loss at different degree of parallelism.

Instruction formats/instruction encoding

Abstract: Single-instruction multiple-data is a new class of integrated video signal processors especially suited for real-time processing of two-dimensional images. The single-instruction, multiple-data architecture is adopted to exploit the high degree of parallelism inherent in many video signal processing algorithms. Features have been added to the architecture which support conditional execution and sequencing--an inherent limitation of traditional single-instruction multiple-data machines. A separate transfer engine offloads transaction processing from the execution core, allowing balancing of input/output and compute resources--a critical factor in optimizing performance for video processing. These features, coupled with a scalable architecture allow a united programming model and application driven performance.

Guarded repair of dependable systems

Abstract: Imperfect coverage and nonnegligible reconfiguration delay are known to have a deleterious effect on the dependability and the performance of a multiprocessor system. In particular, increasing the number of processor elements does not always increase dependability. An obvious reason for this is that the total failure rate increases, generally, linearly with the number of components in the system. It is also a well-known fact that the performance gain due to parallelism mostly turns out to be sublinear with the number of processors. It is therefore important to optimize the degree of parallelism in system design. A related issue is that by deferring repair, it is sometimes possible to improve system dependability. In this case decisions have to be made dynamically as to when to repair and when not to repair. Most of the current research deals with static optimization of the number of processors. No systematic approach for dynamic control of dependable systems has been proposed so far. Dynamic, i.e. transient, decision of whether or not to repair is the optimization problem considered in this paper. We propose extended Markov reward models (EMRM) to capture such questions. EMRM are a marriage between performability modeling techniques and Markov decision theory. A numerical solution procedure is developed to provide optimal solution trajectories for this problem. EMRM are a general framework for the dynamic optimization of reconfigurable, dependable systems. The optimization is applied on the basis of several performance and dependability measures. In particular, we explore availability, capacity-oriented availability, performance-oriented unavailability, and performability measures. Furthermore, off-line and on-line repair strategies are compared. We show that guarded repair can improve system performance and dependability significantly. The control strategies and reward functions differ a lot in each case. Each scenario turns out to be interest in its own right. A time-dependent optimality of dependable, parallel configurations can be determined from our results.