FFQ: A Fast Single-Producer/Multiple-Consumer Concurrent FIFO Queue

2017 ◽  
Author(s):  
Sergei Arnautov ◽  
Pascal Felber ◽  
Christof Fetzer ◽  
Bohdan Trach
Keyword(s):  
Fifo Queue

Regeneration in tandem queues with multiserver stations

1988 ◽  
Vol 25 (02) ◽  
pp. 391-403 ◽  
Author(s):  
Karl Sigman
Keyword(s):  
Markov Chain ◽  
Renewal Process ◽  
Single Server ◽  
Tandem Queues ◽  
Random Assignment ◽  
Tandem Queue ◽  
Ergodic Markov Chain ◽  
Fifo Queue ◽  
Harris Chain ◽  
Server System

A tandem queue with a FIFO multiserver system at each stage, i.i.d. service times and a renewal process of external arrivals is shown to be regenerative by modeling it as a Harris-ergodic Markov chain. In addition, some explicit regeneration points are found. This generalizes the results of Nummelin (1981) in which a single server system is at each stage and the result of Charlot et al. (1978) in which the FIFO GI/GI/c queue is modeled as a Harris chain. In preparing for our result, we study the random assignment queue and use it to give a new proof of Harris ergodicity of the FIFO queue.

scholarly journals USB Transceiver With a Serial Interface Engine and FIFO Queue for Efficient FPGA-to-FPGA Communication

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 69788-69799 ◽  
Author(s):  
Guo-Ming Sung ◽  
Li-Fen Tung ◽  
Hsin-Kwang Wang ◽  
Jhih-Hao Lin
Keyword(s):  
Serial Interface ◽  
Fifo Queue ◽  
Interface Engine

scholarly journals Two‐port–two‐port SI between RS485 and Ethernet with an FIFO queue for efficient PC‐to‐PC communication

IET Networks ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 102-109
Author(s):  
Guo‐Ming Sung ◽  
Yen‐Shih Shen ◽  
Chih‐Ping Yu ◽  
Cheng‐Syuan Jian
Keyword(s):  
Fifo Queue

Sengupta's invariant relationship and its application to waiting time inference

1997 ◽  
Vol 34 (03) ◽  
pp. 795-799 ◽  
Author(s):  
Hiroshi Toyoizumi
Keyword(s):  
Waiting Time ◽  
Sojourn Time ◽  
Time Distribution ◽  
Service Process ◽  
Switching Systems ◽  
Waiting Time Distribution ◽  
Call Processing ◽  
Virtual Waiting Time ◽  
Fifo Queue ◽  
Invariant Relationship

This paper presents a new proof of Sengupta's invariant relationship between virtual waiting time and attained sojourn time and its application to estimating the virtual waiting time distribution by counting the number of arrivals and departures of a G/G/1 FIFO queue. Since this relationship does not require any parametric assumptions, our method is non-parametric. This method is expected to have applications, such as call processing in communication switching systems, particularly when the arrival or service process is unknown.

scholarly journals Scalable Cache-Optimized Concurrent FIFO Queue for Multicore Architectures

2012 ◽  
Vol E95.D (12) ◽  
pp. 2956-2957 ◽  
Author(s):  
Changwoo MIN ◽  
Hyung Kook JUN ◽  
Won Tae KIM ◽  
Young Ik EOM
Keyword(s):  
Multicore Architectures ◽  
Fifo Queue

Sengupta's invariant relationship and its application to waiting time inference

1997 ◽  
Vol 34 (3) ◽  
pp. 795-799 ◽  
Author(s):  
Hiroshi Toyoizumi
Keyword(s):  
Waiting Time ◽  
Sojourn Time ◽  
Time Distribution ◽  
Service Process ◽  
Switching Systems ◽  
Waiting Time Distribution ◽  
Call Processing ◽  
Virtual Waiting Time ◽  
Fifo Queue ◽  
Invariant Relationship

This paper presents a new proof of Sengupta's invariant relationship between virtual waiting time and attained sojourn time and its application to estimating the virtual waiting time distribution by counting the number of arrivals and departures of a G/G/1 FIFO queue. Since this relationship does not require any parametric assumptions, our method is non-parametric. This method is expected to have applications, such as call processing in communication switching systems, particularly when the arrival or service process is unknown.

Sign in / Sign up

Export Citation Format

Share Document