Results 161 to 170 of about 13,594 (209)
Some of the next articles are maybe not open access.

FIFO Stable Control Systems

IFAC Proceedings Volumes, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vladimír Kucera, Frantisek J. Kraus
openaire   +2 more sources

MASH{fifo}

Proceedings of the 51st Annual Design Automation Conference, 2014
Cache memories have become an essential component in modern processors. To find the cache configuration that best fits the targeted power, timing and cost criteria of the system, designers conventionally run a lengthy cache simulation in software. In this paper we present MASH{fifo}, the first Multiple cAche Simulator in Hardware (MASH) supporting the ...
Josef Schneider   +2 more
openaire   +2 more sources

A modular synchronizing FIFO for NoCs

2009 3rd ACM/IEEE International Symposium on Networks-on-Chip, 2009
Systems-on-chip designs often use functional blocks operating at different clock frequencies. This motivates the use of an asynchronous network-on-chip (NoC) with synchronizing FIFOs interfacing between the NoC and the functional blocks. To minimize design time, these FIFOs should be constructed from cells available in a standard cell library and ...
Tarik Ono-Tesfaye, Mark R. Greenstreet
openaire   +2 more sources

A taxonomy of Semi-FIFO policies

2012 IEEE 31st International Performance Computing and Communications Conference (IPCCC), 2012
Modern network processors (NPs) increasingly deal with packets that require heterogeneous processing. We consider the problem of managing a bounded size input queue buffer where each packet requires several rounds of processing before it can be transmitted out.
Kirill Kogan   +3 more
openaire   +2 more sources

Squaring the FIFO in GasP

Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001, 2002
This paper presents a method for designing a special type of asynchronous circuits, called GasP circuits, and illustrates the method by a novel design of a low-latency, high-throughput FIFO, called a square FIFO. The design method includes a graphical notation that permits the specification not only of circuit topology but also of the time separation ...
openaire   +1 more source

Testing of Synchronizers in Asynchronous FIFO

Journal of Electronic Testing, 2013
This paper presents a test method for testing two-D-flip-flop synchronizers in an asynchronous first-in-first-out (FIFO) interface. A faulty synchronizer can have different fault behaviors depending on the input application time, the fault location, the fault mechanism, and the applied clock frequency.
Hyoung-Kook Kim   +3 more
openaire   +2 more sources

FIFO indexes for decomposable problems

Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2011
This paper studies first-in-first-out (FIFO) indexes, each of which manages a dataset where objects are deleted in the same order as their insertions. We give a technique that converts a static data structure to a FIFO index for all decomposable problems, provided that the static structure can be constructed efficiently.
Cheng Sheng 0001, Yufei Tao 0001
openaire   +3 more sources

A FIFO ring performance experiment

Proceedings Third International Symposium on Advanced Research in Asynchronous Circuits and Systems, 2002
We describe a high-speed FIFO circuit intended to compare the performance of an asynchronous FIFO with that of a clocked shift register using the same data path. The FIFO uses a pulse-like protocol to advance data along the pipeline. Use of this protocol requires careful management of circuit delays within its control circuits, as well as in the ...
Charles E. Molnar   +3 more
openaire   +1 more source

Steady Solutions for FIFO Networks

Moscow Mathematical Journal, 2001
Summary: We consider the fluid model of a reentrant line with FIFO discipline and look for solutions with constant flows (steady solutions). In the case of constant viscosities we prove the uniqueness of such a solution. If viscosities are different, we present an example with multiple steady solutions.
Khanin, K.   +3 more
openaire   +2 more sources

FIFO Service with Differentiated Queueing

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems, 2011
This paper presents a novel approach to minimally invasive service differentiation in packet-switched networks. Instead of actively managing service allocation, a simple differentiated queueing algorithm provides traffic classes with essentially the same best-effort service that would result from plain FIFO service using a single queue for all traffic.
openaire   +2 more sources

Home - About - Disclaimer - Privacy