Pipeline (computing)

About: Pipeline (computing) is a research topic. Over the lifetime, 26760 publications have been published within this topic receiving 204305 citations. The topic is also known as: data pipeline & computational pipeline.

Reducing the cost of branches

Abstract: Pipelining is the major organizational technique that computers use to reach higher single-processor performance. A fundamental disadvantage of pipelining is the loss incurred due to branches that require stalling or flushing the pipeline. Both hardware solutions and architectural changes have been proposed to overcome these problems. This paper examines a range of schemes for reducing branch cost focusing on both static (compile-time) and dynamic (hardware-assisted) prediction of branches. These schemes are investigated from quantitative performance and implementation viewpoints.1

The Alpha 21264 microprocessor architecture

Abstract: The 21264 is the third generation Alpha microprocessor from Compaq Computer (formerly Digital Equipment) Corporation. This microprocessor achieves the industry-leading performance levels of 30+ Specint95 and 50+ Specfp95. In addition to the aggressive 600 MHz cycle time in a 0.35 /spl mu/m CMOS process, there are also many architectural features that enable the outstanding performance level of the 21264. This paper discusses many of these architectural techniques, which include an out-of-order and speculative execution pipeline coupled with a high-performance memory system.

Improving image-based localization by active correspondence search

Abstract: We propose a powerful pipeline for determining the pose of a query image relative to a point cloud reconstruction of a large scene consisting of more than one million 3D points The key component of our approach is an efficient and effective search method to establish matches between image features and scene points needed for pose estimation Our main contribution is a framework for actively searching for additional matches, based on both 2D-to-3D and 3D-to-2D search A unified formulation of search in both directions allows us to exploit the distinct advantages of both strategies, while avoiding their weaknesses Due to active search, the resulting pipeline is able to close the gap in registration performance observed between efficient search methods and approaches that are allowed to run for multiple seconds, without sacrificing run-time efficiency Our method achieves the best registration performance published so far on three standard benchmark datasets, with run-times comparable or superior to the fastest state-of-the-art methods

Process of electric pipeline heating utilizing heating elements inserted in pipelines

Abstract: A process to clear pipelines carrying fluids viscous and/or rich in organic residues includes the introduction of a heating element inside a pipeline carrying the fluids through a coupling spool which is intercalated in the fluid-carrying pipeline. Simultaneously an electric current is applied to the heating element so that the heat generated by the heating element is transmitted to the viscous fluid or to the compacted residual mass inside the fluid-carrying pipeline, causing the detachment of those residues from the internal wall of the pipeline and re-establishing the conditions for fluid flow.

Genetic Algorithms In Pipeline Optimization

Abstract: The application of a genetic algorithm to the steady state optimization of a serial liquid pipeline is considered. Genetic algorithms are search procedures based upon the mechanics of natural genet...