scholarly journals Frequency scaling in multilevel queues

2021 ◽  
Vol 48 (3) ◽  
pp. 97-98
Author(s):  
Maryam Elahi ◽  
Andrea Marin ◽  
Sabina Rossi ◽  
Carey Williamson
Keyword(s):  
Steady State ◽  
Power Consumption ◽  
Busy Period ◽  
Queueing System ◽  
Response Times ◽  
Arrival Process ◽  
Processor Sharing ◽  
Frequency Scaling ◽  
Simulation Results ◽  
Reduced Power Consumption

In this paper, we study a variant of PS+PS multilevel scheduling, which we call the PS+IS queue. Specifically, we use Processor Sharing (PS) at both queues, but with linear frequency scaling on the second queue, so that the latter behaves like an Infinite Server (IS) queue. The goals of the system are low response times for small jobs in the first queue, and reduced power consumption for large jobs in the second queue. The novelty of our model includes the frequency scaling at the second queue, and the batch arrival process at the second queue induced by the busy period structure of the first queue which has strictly higher priority. We derive a numerical solution for the PS+IS queueing system in steady-state, and then study its properties under workloads obtained from fitting of TCP flow traces. The simulation results confirm the e

scholarly journals A discrete single server queue with Markovian arrivals and phase type group services

1995 ◽  
Vol 8 (2) ◽  
pp. 151-176 ◽  
Author(s):  
Attahiru Sule Alfa ◽  
K. Laurie Dolhun ◽  
S. Chakravarthy
Keyword(s):  
Steady State ◽  
Queueing System ◽  
State Probability ◽  
Arrival Process ◽  
Single Server ◽  
Probability Vector ◽  
Phase Type Distribution ◽  
Steady State Probability ◽  
Phase Type ◽  
Number Of Customers

We consider a single-server discrete queueing system in which arrivals occur according to a Markovian arrival process. Service is provided in groups of size no more than M customers. The service times are assumed to follow a discrete phase type distribution, whose representation may depend on the group size. Under a probabilistic service rule, which depends on the number of customers waiting in the queue, this system is studied as a Markov process. This type of queueing system is encountered in the operations of an automatic storage retrieval system. The steady-state probability vector is shown to be of (modified) matrix-geometric type. Efficient algorithmic procedures for the computation of the rate matrix, steady-state probability vector, and some important system performance measures are developed. The steady-state waiting time distribution is derived explicitly. Some numerical examples are presented.

Distribution of the busy period in a controllable M/M/2 queue operating under the triadic (0, K, N, M) policy

1990 ◽  
Vol 27 (02) ◽  
pp. 425-432
Author(s):  
Hahn-Kyou Rhee ◽  
B. D. Sivazlian
Keyword(s):  
Steady State ◽  
Busy Period ◽  
Queueing System ◽  
Service Completion ◽  
Special Cases ◽  
Service Stations ◽  
Gambler’S Ruin ◽  
Gambler's Ruin Problem ◽  
Number Of Customers ◽  
System Operating

We consider an M/M/2 queueing system with removable service stations operating under steady-state conditions. We assume that the number of operating service stations can be adjusted at customers' arrival or service completion epochs depending on the number of customers in the system. The objective of this paper is to obtain the distribution of the busy period using the theory of the gambler's ruin problem. As special cases, the distributions of the busy periods for the ordinary M/M/2 queueing system, the M/M/1 queueing system operating under the N policy and the ordinary M/M/1 queueing system are obtained.

Distribution of the busy period in a controllable M/M/2 queue operating under the triadic (0, K, N, M) policy

1990 ◽  
Vol 27 (2) ◽  
pp. 425-432 ◽  
Author(s):  
Hahn-Kyou Rhee ◽  
B. D. Sivazlian
Keyword(s):  
Steady State ◽  
Busy Period ◽  
Queueing System ◽  
Service Completion ◽  
Special Cases ◽  
Service Stations ◽  
Gambler’S Ruin ◽  
Gambler's Ruin Problem ◽  
Number Of Customers ◽  
System Operating

We consider an M/M/2 queueing system with removable service stations operating under steady-state conditions. We assume that the number of operating service stations can be adjusted at customers' arrival or service completion epochs depending on the number of customers in the system. The objective of this paper is to obtain the distribution of the busy period using the theory of the gambler's ruin problem. As special cases, the distributions of the busy periods for the ordinary M/M/2 queueing system, the M/M/1 queueing system operating under the N policy and the ordinary M/M/1 queueing system are obtained.

POLYMERIC 1 × 2 DIGITAL OPTICAL AND 2 × 2 MACH–ZEHNDER INTERFEROMETER WAVEGUIDE THERMO-OPTIC SWITCHES: DESIGN AND SIMULATION

2013 ◽  
Vol 22 (04) ◽  
pp. 1350039 ◽  
Author(s):  
GUANGYU WU ◽  
HAIBO WANG
Keyword(s):  
Refractive Index ◽  
Power Consumption ◽  
Transmission Loss ◽  
Response Times ◽  
Optical Switch ◽  
Zehnder Interferometer ◽  
Isophorone Diisocyanate ◽  
Infrared Communication ◽  
Simulation Results ◽  
Mach Zehnder Interferometer

In this paper, a polyurethane (PU) was prepared from polyether polyols, isophorone diisocyanate and 2-[4-( N , N -hydroxyethyl)-aminophenyl-azo]-6-nitrobenzothiazole. The Tg and Td (5% mass loss) are 112°C and 273°C, respectively. The refractive index, transmission loss and Sellmyer coefficients of PU were investigated. Polymeric 1 × 2 digital optical switch (DOS) and 2 × 2 Mach–Zehnder interferometer (MZI) thermo-optic switches based on PU as waveguide at the infrared communication wavelength 1.55 μm were designed and simulated. Simulation results showed that the power consumption of 1 × 2 DOS is only 0.60 mW; and the response times of 1 × 2 and MZI switches are 9 ms and 2.5 ms, respectively.

scholarly journals M/M/1 Multiple Vacation Queueing Systems with Differentiated Vacations

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Oliver C. Ibe ◽  
Olubukola A. Isijola
Keyword(s):  
Steady State ◽  
Busy Period ◽  
Queueing System ◽  
Queueing Systems ◽  
Steady State Solution ◽  
State Solution ◽  
Multiple Vacation ◽  
Service Times

We consider a multiple vacation queueing system in which a vacation following a busy period has a different distribution from a vacation that is taken without serving at least one customer. For ease of analysis it is assumed that the service times are exponentially distributed and the two vacation types are also exponentially distributed but with different means. The steady-state solution is obtained.

On the M/G/1 queue by additional inputs

1984 ◽  
Vol 21 (1) ◽  
pp. 129-142 ◽  
Author(s):  
Teunis J. Ott
Keyword(s):  
Busy Period ◽  
Queueing System ◽  
Arrival Process ◽  
Single Server ◽  
Input Process ◽  
Stochastic Monotonicity ◽  
General Process ◽  
Virtual Waiting Time ◽  
Waiting Time Process ◽  
Monotonicity Results

A single-server queueing system is studied, the input into which consists of the sum of two independent stochastic processes. One of these is an ‘M/G' type input process, the other a much more general process which need not be Markov. There are two types of busy period, depending on which arrival process started the busy period. Stochastic monotonicity results are derived and it is found that under a stationarity-like condition the probability of being in a busy period which started with an ‘M/G' arrival is independent of time and is the same it would be with the ‘M/G' process as only input process. Also, distributional results are obtained for the virtual waiting-time process, and these results are used to reduce the study of a single-server queueing system with as input the sum of independent ‘M/G' and ‘GI/G' input streams to the study of a related GI/G/1 queueing system.The purpose of this paper is to pave the way for a study of an M/G/1 queueing system with periodic arrivals of additional work, and for optimal scheduling of maintenance processes in certain real-time computer systems.

On the M/G/1 queue by additional inputs

1984 ◽  
Vol 21 (01) ◽  
pp. 129-142
Author(s):  
Teunis J. Ott
Keyword(s):  
Busy Period ◽  
Queueing System ◽  
Arrival Process ◽  
Single Server ◽  
Input Process ◽  
Stochastic Monotonicity ◽  
General Process ◽  
Virtual Waiting Time ◽  
Waiting Time Process ◽  
Monotonicity Results

A single-server queueing system is studied, the input into which consists of the sum of two independent stochastic processes. One of these is an ‘M/G' type input process, the other a much more general process which need not be Markov. There are two types of busy period, depending on which arrival process started the busy period. Stochastic monotonicity results are derived and it is found that under a stationarity-like condition the probability of being in a busy period which started with an ‘M/G' arrival is independent of time and is the same it would be with the ‘M/G' process as only input process. Also, distributional results are obtained for the virtual waiting-time process, and these results are used to reduce the study of a single-server queueing system with as input the sum of independent ‘M/G' and ‘GI/G' input streams to the study of a related GI/G/1 queueing system. The purpose of this paper is to pave the way for a study of an M/G/1 queueing system with periodic arrivals of additional work, and for optimal scheduling of maintenance processes in certain real-time computer systems.

scholarly journals A Novel Cross-Latch Shift Register Scheme for Low Power Applications

2020 ◽  
Vol 11 (1) ◽  
pp. 129
Author(s):  
Po-Yu Kuo ◽  
Ming-Hwa Sheu ◽  
Chang-Ming Tsai ◽  
Ming-Yan Tsai ◽  
Jin-Fa Lin
Keyword(s):  
Power Consumption ◽  
Supply Voltage ◽  
Electrical Power ◽  
Average Power ◽  
Leakage Power ◽  
Shift Register ◽  
Cmos Process ◽  
Average Power Consumption ◽  
Simulation Results ◽  
Layout Area

The conventional shift register consists of master and slave (MS) latches with each latch receiving the data from the previous stage. Therefore, the same data are stored in two latches separately. It leads to consuming more electrical power and occupying more layout area, which is not satisfactory to most circuit designers. To solve this issue, a novel cross-latch shift register (CLSR) scheme is proposed. It significantly reduced the number of transistors needed for a 256-bit shifter register by 48.33% as compared with the conventional MS latch design. To further verify its functions, this CLSR was implemented by using TSMC 40 nm CMOS process standard technology. The simulation results reveal that the proposed CLSR reduced the average power consumption by 36%, cut the leakage power by 60.53%, and eliminated layout area by 34.76% at a supply voltage of 0.9 V with an operating frequency of 250 MHz, as compared with the MS latch.

Reduced power consumption Current-mode ADC using SAR logic for AI application

2020 ◽  
Author(s):  
Soyoun Park ◽  
Hyungmin Kim ◽  
Daniel Juhun Lee ◽  
Taemin Nho ◽  
Seongkweon Kim ◽  
...  
Keyword(s):  
Power Consumption ◽  
Current Mode ◽  
Reduced Power Consumption
Sign in / Sign up

Export Citation Format

Share Document