Low run-time overhead, self-adapting storage policies for priority queues called Smart Priority Queue (SPQ) techniques are developed and evaluated. The proposed SPQ policies employ a lowcomplexity linear queue for near-head activities and a rapid-indexing variable bin-width calendar queue for distant events. The SPQ configuration is determined by monitoring queue access behavior using cost-scor...

Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and di erent representations for their stationary sojourn time and queue length distribution have been derived. More speci cally, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queue...

Eight synthetic and nine biogenetic surfactants were tested on their toxicity. Because of their possible application as oil dispersants against oil slicks on sea, the test organisms used were marine microorganisms (mixed and pure cultures of bacteria, microalgae, and protozoa). Bacterial growth was hardly effected or stimulated, whilst that of algae and flagellates was reduced. All substances t...

This paper describes and investigates a strict mathematical model for rotating line cameras, developed at the Institute of Photogrammetry and Remote Sensing of the Dresden University of Technology. The model accuracy was improved through considering additional parameters, which describe deviations from the basic model approach. Furthermore the mathematical model was successful implemented in di...

Increasing power dissipation has become a major constraint for future performance gains in the design of microprocessors. In this paper, we present the circuit design of an issue queue for a superscalar processor that leverages transmission gate insertion to provide dynamic low-cost configurability of size and speed. A novel circuit structure dynamically gathers statistics of issue queue activi...

Active queue management operates at network nodes to control the number of packets in the queue of nodes, by actively receiving packets when the queue is not full, removing packets when the queue is full or notifying bottlenecks even in the embryonic period of the bottlenecks due to to-be-full queue. In recent years, scientists have used fuzzy logic to improve queue management mechanisms. Overa...

A mixed s-stack q-queue layout of a graph consists linear order its vertices and partition edges into s stacks q queues, such that no two in the same stack cross queue nest. In 1992, Heath Rosenberg conjectured every planar admits 1-stack 1-queue layout. Recently, Pupyrev disproved this by demonstrating partial 3-tree does not admit note, we strengthen Pupyrev's result showing conjecture hold e...

In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and serves the customers only when the number of customers in system is at least a certain threshold value. For this queue, we first obtain the queue-length distribution just after a service completion, using the embedded M...

We study queue abandonment from a hospital emergency department. We show that abandonment is influenced by the queue length and the observable queue flows during the waiting exposure, even after controlling for wait time. For example, observing an additional person in the queue or an additional arrival to the queue leads to an increase in abandonment probability equivalent to a 25-minute or 5-m...