Search 250 million research papers

pipelining

SpringerReference · 2011

Cited by 0

Pipelining

Михаил Михайлович Ковалев, Silvia M. Müller, Wolfgang J. Paul · Lecture notes in computer science · 2014

Cited by 0

Pipelining

David J. Lilja, Sachin S. Sapatnekar · Cambridge University Press eBooks · 2004

If you were plowing a field, which would you rather use? Two strong oxen or 1024 chickens?Seymour Cray (1925–1996), father of supercomputing

Cited by 0

Pipelining

Tobias Häberlein · Vieweg+Teubner eBooks · 2011

Pipelining ist eine der effektivsten Techniken, die Performance einer Prozessorarchitektur zu steigern. In diesem Kapitel lernen Sie …

Cited by 0

• Pipelining

Branch Hazards, Branch Penalty · 2014

This course introduces advanced topics in computer architecture and organization. Topics include instruction set architecture, performance measures, pipeline processor design, data and instruction cache, data dependencies, branch prediction and penalties, and multiprocessor system design. As well, this course is concerned with an engineering approach to selecting and interconnecting hardware components to create computers that meet functional, performance and cost goals. The course covers improvements and refinements to the basic computer designs as taught in undergraduate courses, and is intended to be a successor of same. Therefore, it is crucial that students have a good grasp of basic computer architecture as taught at ECE 3610 or in similar classes elsewhere.

Cited by 0

Pipelining

2009

Cited by 0

Pipelining

Sajjan G. Shiva · 2018

Cited by 0

Objektorientiertes Pipelining

Holger Schwichtenberg · 2018

No AccessWindows PowerShell 5.1 und PowerShell Core 6.1Nov 2018Objektorientiertes PipeliningHolger SchwichtenbergHolger Schwichtenberghttps://doi.org/10.3139/9783446459236.005SectionsAboutPDF ToolsAdd to FavoritesDownload CitationTrack CitationsCopy LTI LinkPDF key 'share (en)' returned an object instead of string.FacebookTwitterEmailLinkedIn previous chapternext chapter FiguresReferencesRelatedDetails 2018Pages: 87-128eISBN: 978-3-446-45923-6 Copyright & Permissions© 2019 Carl Hanser Verlag GmbH & Co. KGPDF downloadLoading ...

Cited by 0

GridFTP Pipelining

John Bresnahan, Michael Link, Rajkumar Kettimuthu et al. · 2008

Abstract—GridFTP is an exceptionally fast transfer protocol for large volumes of data. Implementations of it are widely deployed and used on well-connected Grid environments such as those of the TeraGrid because of its ability to scale to network speeds. However, when the data is partitioned into many small files instead of few large files, it suffers from lower transfer rates. The latency between the serialized transfer requests of each file directly detracts from the amount of time data pathways are active, thus lowering achieved throughput. Further, when a data pathway is inactive, the TCP window closes, and TCP must go through the slow-start algorithm. The performance penalty can be severe. This situation is known as the “lots of small files ” problem. In this paper we introduce a solution to this problem. This solution, called pipelining, allows many transfer requests to be sent to the server before any one completes. Thus, pipelining hides the latency of each transfer request by sending the requests while a data transfer is in progress. We present an implementation and performance study of the pipelining solution. Index Terms — data transfer, small files, GridFTP 1

Cited by 0

Data Pipelining

Douglas E. Comer · 2024

Cited by 0

GridFTP Pipelining

SciVee · 2007

Professor John Bresnahan discusses "GridFTP Pipelineing" at the TeraGrid 07 Conference. For further information about TeraGrid please see their website at: http://www.teragrid.org/. Originally posted at SDSC's CI Channel.

Cited by 0Open access

Objektorientiertes Pipelining

Holger Schwichtenberg · 2017

No AccessWindows PowerShell 5 und PowerShell Core 6Nov 2017Objektorientiertes PipeliningHolger SchwichtenbergHolger Schwichtenberghttps://doi.org/10.3139/9783446453975.005SectionsAboutPDF ToolsAdd to FavoritesDownload CitationTrack CitationsCopy LTI LinkPDF key 'share (en)' returned an object instead of string.FacebookTwitterEmailLinkedIn previous chapternext chapter FiguresReferencesRelatedDetails 2017Pages: 81-122Print ISBN: 978-3-446-45331-9eISBN: 978-3-446-45397-5 Copyright & Permissions© 2017 Carl Hanser Verlag GmbH & Co. KGPDF downloadLoading ...

Cited by 0

pipelining programs

2024

Citation: 'pipelining programs' in the IUPAC Compendium of Chemical Terminology, 5th ed.; International Union of Pure and Applied Chemistry; 2025. Online version 5.0.0, 2025. 10.1351/goldbook.11486 • License: The IUPAC Gold Book is licensed under Creative Commons Attribution-ShareAlike CC BY-SA 4.0 International for individual terms. Requests for commercial usage of the compendium should be directed to IUPAC.

Cited by 0

Pipelining Transformation

Indrajit Chakrabarti · 2007

Measured in terms of • Speed of execution (which depends on both throughput and clock rate) • Amount of hardware circuitry (area or space) • Amount of power dissipation or total energy required to perform a given task • Finite word-length effect (quantization and round-off noise) for fixed-point digital signal processing (dsp) systems, specially for digital filters

Cited by 0

Segmented Pipelining

Phillip K.C. Tse · IGI Global eBooks · 2011

The robotic tape library and optical jukebox provide huge and cheap capacity for the storage of multimedia objects. The stored objects may be retrieved using staging, time slicing, or pipelining. The staging method retrieves the whole objects to the staging buffers prior to consumption at the cost of high start-up latency. The time slice method reduces the start-up latency at the cost of heavy switching overheads. The pipelining methods aim at minimizing the start-up latency. In the normal pipelining method, the sizes of the slices are minimized to maximize the overlapping between the displaying time and the retrieval time of the slices. In space efficient pipelining methods, the buffer size in accessing the slices is minimized. We have already described the normal pipelining and the space efficient pipelining methods in the two previous chapters. The segmented pipelining method to reduce the latency in serving interactive requests is presented in this chapter. Multimedia objects are usually displayed from the beginning to the end in video on demand systems. Interactive video-on-demand systems support VCR-like functions, including fast forward, rewind, pause, and resume functions. Large video systems store many objects. The video systems should allow some searching to allow users find the desired objects. When searching is required, the video-on-demand system would need to provide browsing, jump, keyword, and content based searching. Unless the staging method is used, the multimedia storage system cannot support any VCR-like operations. The segmented pipelining method is designed to provide efficient retrieval of multimedia objects with supporting of previews. In this chapter, the segmented pipelining method is first described in the next section. The performance of the segmented pipelining method is then described and analyzed before this chapter is summarized.

Cited by 0

Dynamic pipelining

Jahangir Hasan, T. N. Vijaykumar · ACM SIGCOMM Computer Communication Review · 2005

A truly scalable IP-lookup scheme must address five challenges of scalability, namely: routing-table size, lookup throughput, implementation cost, power dissipation, and routing-table update cost. Though several IP-lookup schemes have been proposed in the past, none of them do well in all the five scalability requirements. Previous schemes pipeline tries by mapping trie levels to pipeline stages. We make the fundamental observation that because this mapping is static and oblivious of the prefix distribution, the schemes do not scale well when worst-case prefix distributions are considered. This paper is the first to meet all the five requirements in the worst case. We propose scalable dynamic pipelining (SDP) which includes three key innovations: (1) We map trie nodes to pipeline stages based on the node height. Because the node height is directly determined by the prefix distribution, the node height succinctly provides sufficient information about the distribution. Our mapping enables us to prove a worst-case per-stage memory bound which is significantly tighter than those of previous schemes. (2) We exploit our mapping to propose a novel scheme for incremental route-updates. In our scheme a route-update requires exactly and only one write dispatched into the pipeline. This route-update cost is obviously the optimum and our scheme achieves the optimum in the worst case. (3) We achieve scalability in throughput by simultaneously pipelining at the data-structure level and the hardware level. SDP naturally scales in power and implementation cost. We not only present a theoretical analysis but also evaluate SDP and a number of previous schemes using detailed hardware simulation. Compared to previous schemes, we show that SDP is the only scheme that scales well in all the five requirements.

Cited by 12

Software pipelining

Vicki H. Allan, Reese B. Jones, Randall M. Lee et al. · ACM Computing Surveys · 1995

Utilizing parallelism at the instruction level is an important way to improve performance. Because the time spent in loop execution dominates total execution time, a large body of optimizations focuses on decreasing the time to execute each iteration. Software pipelining is a technique that reforms the loop so that a faster execution rate is realized. Iterations are executed in overlapped fashion to increase parallelism. Let { ABC } n represent a loop containing operations A, B, C that is executed n times. Although the operations of a single iteration can be parallelized, more parallelism may be achieved if the entire loop is considered rather than a single iteration. The software pipelining transformation utilizes the fact that a loop { ABC } n is equivalent to A { BCA } n −1 BC . Although the operations contained in the loop do not change, the operations are from different iterations of the original loop. Various algorithms for software pipelining exist. A comparison of the alternative methods for software pipelining is presented. The relationships between the methods are explored and possibilities for improvement highlighted.

Cited by 344Open access

Parallel Pipelining

D. D. Joseph, R. Bai, T. Y. Liao et al. · Journal of Fluids Engineering · 1995

In this paper we introduce the idea of parallel pipelining for water lubricated transportation of oil (or other viscous material). A parallel system can have major advantages over a single pipe with respect to the cost of maintenance and continuous operation of the system, to the pressure gradients required to restart a stopped system and to the reduction and even elimination of the fouling of pipe walls in continuous operation. We show that the action of capillarity in small pipes is more favorable for restart than in large pipes. In a parallel pipeline system, we estimate the number of small pipes needed to deliver the same oil flux as in one larger pipe as N = (R/r)α, where r and R are the radii of the small and large pipes, respectively, and α = 4 or 19/7 when the lubricating water flow is laminar or turbulent.

Cited by 2

Pipelining Threads

V. Alessandrini · Elsevier eBooks · 2016

Cited by 0

Objektorientiertes Pipelining

Holger Schwichtenberg · 2018

No AccessWindows PowerShell und PowerShell Core - Der schnelle EinstiegJun 2018Objektorientiertes PipeliningHolger SchwichtenbergHolger Schwichtenberghttps://doi.org/10.3139/9783446452817.005SectionsAboutPDF ToolsAdd to FavoritesDownload CitationTrack CitationsCopy LTI LinkPDF key 'share (en)' returned an object instead of string.FacebookTwitterEmailLinkedIn previous chapternext chapter FiguresReferencesRelatedDetails 2018Pages: 79-120Print ISBN: 978-3-446-45214-5eISBN: 978-3-446-45281-7 Copyright & Permissions© 2018 Carl Hanser Verlag GmbH & Co. KGPDF downloadLoading ...

Cited by 0