نتایج جستجو برای: pipeline scheduling

تعداد نتایج: 97310  

ژورنال: مهندسی دریا 2007
آقاکوچک, علی اکبر, گلبهار حقیقی, مهدی,

Oil and Gas offshore pipelines, often pass through large geographical areas, from the supply point to the end-user, crossing seismic-active areas. For unburied pipelines, both seismic ground wave and permanent ground deformation can cause severe damage to pipelines, depending on the pipeline geometry and connected structures. Due to the largely non-linear nature of the problem, a finite element...

1999
MASAYUKI KATAHIRA HONG SHEN HIROAKI KOBAYASHI TADAO NAKAMURA Aza Aoba

High performance processors based on pipeline processing play an important role in scientific and engineering computation. However, it is difficult to gain a satisfactory solution when taking both high degree of flexibility of parallel processing and low hardware complexity into account. This paper propose a hybrid pipeline architecture named Jetpipeline that possesses high degree of flexibilit...

2001
Chi-Yuan Chin Wen-Tai Lin Juh-Ping Hwang Sow Chu Glenn Forman Robert Dunki-Jacobs Steven Karr John Mallick

DYNAMIC RECONFIGURATION OF INTERCONNECTION is important in today's multiprocessing computing systems. A reconfigurable network between processing elements is essential for systolic array, vector processing, or pipeline processing systems. This paper focuses on the development of a Link and INterconnection Chip (LINC), an interface chip optimized for dynamically reconfiguring the data flow and s...

1994
Masayuki Katahira Takehito Sasaki Hong Shen Hiroaki Kobayashi Tadao Nakamura

High performance processors based on pipeline processing play an important role in scientific computation. We have proposed a hybrid pipeline architecture named Jetpipeline in our former work. The concept of Jetpipeline comes from the integration of superscalar, VLIW and vector architectures. Jetpipeline has multiple instruction pipelines, which execute multiple instructions like superscalar ar...

2001
Bradley C. Kuszmaul Dana S. Henry

A processor with an explicit dataflow instruction-set architecture may be able to achieve performance comparable to a superscalar RISC processor, even on serial code. To achieve this, the dataflow processor must support speculative operation, especially speculative branches, and a pipeline with bypassing for serial code. This paper outlines a set of mechanisms to implement speculative operation...

2008
Duoduo Liao Simon Y. Berkovich

— This paper presents a new design for parallel solid voxelization using the multi-processor pipeline by slicing the program by forced interrupts. The proposed system provides a simple and effective solution to the on-the-fly parallel solid voxelization by relocating the portions of incoming data from processor to processor. It does not need conventional complicated parallel computing methods, ...

2012
Gavin Xiaoxu Yao Junfeng Fan Ray C. C. Cheung Ingrid Verbauwhede

In this paper, we present a high-speed pairing coprocessor using Residue Number System (RNS) which is intrinsically suitable for parallel computation. This work improves the design of Cheung et al. [11] using a carefully selected RNS base and an optimized pipeline design of the modular multiplier. As a result, the cycle count for a modular reduction has been halved. When combining with the lazy...

2012
Alexander Brant Aaron Severance

FPGAs are increasingly being used to implement many new applications, including pipelined processor designs. Designers often employ memories to communicate and pass data between these pipeline stages. However, one-cycle communication between sender and receiver is often required. To implement this read-immediately-after-write functionality, bypass registers are needed by most FPGA memory blocks...

2002
Eiji Oki Roberto Rojas-Cessa H. Jonathan Chao

This paper proposes a pipeline-based concurrent round-robin dispatching scheme, called PCRRD, for Clos-network switches. Our previously proposed concurrent round-robin dispatching (CRRD) scheme provides 100% throughput under uniform traffic by using simple round-robin arbiters, but it has the strict timing constraint that the dispatching scheduling has to be completed within one cell time slot....

2017
Ionel Zagan Vasile Gheorghita Gaitan

The development of CPUs and of real-time systems based on them made it possible to use time at increasingly low resolutions. Together with the scheduling methods and algorithms, time organizing has been improved so as to respond positively to the need for optimization and to the way in which the CPU is used. This presentation contains both a detailed theoretical description and the results obta...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید