Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
213
A Multi-resolution AHB Bus Tracer for Real-time Compression of Forward/Backward Traces in a Circular Buffer
"... The forward/backward trace refers to the trace captured af-ter/before a target point is reached, respectively. Real time compression of the backward trace in a circular buffer is a challenging problem since the initial state of the trace cur-rently under compression might be overwritten when wrap-pi ..."
Abstract
- Add to MetaCart
The forward/backward trace refers to the trace captured af-ter/before a target point is reached, respectively. Real time compression of the backward trace in a circular buffer is a challenging problem since the initial state of the trace cur-rently under compression might be overwritten when wrap
3. Time Switching, Multi-Queue Memories, Shared Buffers, Output Queueing Family 3.1 TDM, Time Switching, Cut-Through 3.2 Wide Memories for High Thruput, Segm’tn Ovrhd 3.3 Multiple Queues within a Buffer Memory 3.4 Queueing for Multicast Traffic 3.5 Shared
"... Table of Contents: • 3.3 Multiple Queues within a Buffer Memory – partitioned queue space: circular-buffer queue – shared queue space: linked-list queues ..."
Abstract
- Add to MetaCart
Table of Contents: • 3.3 Multiple Queues within a Buffer Memory – partitioned queue space: circular-buffer queue – shared queue space: linked-list queues
Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction
- Processing”, IBM Research Report RC 17225, Yorktown Heights
, 1991
"... The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approx-imate the performance of the Least Recently Used (LRU) re-placement policy. The Generalized Clock (GCLOCK) buffer replacement policy usesa circular buffer and a weight asso-ciated with ea ..."
Abstract
-
Cited by 34 (3 self)
- Add to MetaCart
The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approx-imate the performance of the Least Recently Used (LRU) re-placement policy. The Generalized Clock (GCLOCK) buffer replacement policy usesa circular buffer and a weight asso
3.3 Multiple Queues 3.4 Multicast Queues
"... Table of Contents: • 3.3 Multiple Queues within a Buffer Memory – partitioned queue space: circular-buffer queue – shared queue space: linked-list queues ..."
Abstract
- Add to MetaCart
Table of Contents: • 3.3 Multiple Queues within a Buffer Memory – partitioned queue space: circular-buffer queue – shared queue space: linked-list queues
Circular dichroism
"... About 10 μM of proteins were freshly prepared in 10 mM potassium phosphate buffer containing 50 mM (NH4)2SO4 at pH 7.4. CD experiments were carried out on a JASCO J-815 circular dichroism spectrometer using a quartz cuvette with a path length of 1 mm at room temperature and scanned from 190 to 260 n ..."
Abstract
- Add to MetaCart
About 10 μM of proteins were freshly prepared in 10 mM potassium phosphate buffer containing 50 mM (NH4)2SO4 at pH 7.4. CD experiments were carried out on a JASCO J-815 circular dichroism spectrometer using a quartz cuvette with a path length of 1 mm at room temperature and scanned from 190 to 260
IEEE TRANS. ON SPEECH AND AUDIO, 2000. ACCEPTED FOR PUBLICATION. 1 Fractionally-addressed delay lines
, 2000
"... Abstract — While traditional implementations of variablelength digital delay lines are based on a circular buffer accessed by two pointers, we propose an implementation where a single fractional pointer is used both for read and write operations. On modern general-purpose architectures, the proposed ..."
Abstract
- Add to MetaCart
Abstract — While traditional implementations of variablelength digital delay lines are based on a circular buffer accessed by two pointers, we propose an implementation where a single fractional pointer is used both for read and write operations. On modern general-purpose architectures
unknown title
"... Abstract — This paper discusses circular buffer rate matching (CBRM) algorithms for the turbo code in the Long Term Evolution (LTE) of the WCDMA-based air interface. To enhance performance at high code rates, systematic bit puncturing is incorporated in conjunction with the CBRM. The RM algorithm is ..."
Abstract
- Add to MetaCart
Abstract — This paper discusses circular buffer rate matching (CBRM) algorithms for the turbo code in the Long Term Evolution (LTE) of the WCDMA-based air interface. To enhance performance at high code rates, systematic bit puncturing is incorporated in conjunction with the CBRM. The RM algorithm
Shift buffering technique for automatic code synthesis from synchronous dataflow graphs
- In (CODES+ISSS’05
, 2005
"... This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer management methods, linear buffering and modulo (or circular) buffering, assume that samples are queued in the arc buffers i ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer management methods, linear buffering and modulo (or circular) buffering, assume that samples are queued in the arc buffers
Buffer Allocation in Regular Dataflow Networks: An Approach Based on Coloring Circular-Arc Graphs
"... In this paper we discuss a method to perform compile-time buffer allocation, allowing efficient buffer sharing among the arcs of a special form of dataflow graphs -- known as regular stream flow graphs -- commonly used in Digital Signal Processing applications. We relate the buffer sharing problem t ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
to that of finding independent sets in weighted circular arc graph. An important difference between the traditional graph coloring/register allocation problem and our buffer sharing problem is that in our problem the aim is to minimize the sum of the weights of the independent sets, rather than the number
Fractionally-Addressed Delay Lines
- in Proc. Workshop On Digital Audio Effects (DAFX-98
, 1998
"... While traditional implementations of digital delay lines are based on a circular buffer accessed by two pointers, we propose an implementation where a single fractional pointer is used both for reading and writing operations. On modern general-purpose architectures, the proposed method is nearly ..."
Abstract
- Add to MetaCart
While traditional implementations of digital delay lines are based on a circular buffer accessed by two pointers, we propose an implementation where a single fractional pointer is used both for reading and writing operations. On modern general-purpose architectures, the proposed method is nearly
Results 1 - 10
of
213
