Production parallel systems are space-shared and hence employ batch queues in which the jobs submitted to the systems are made to wait before execution. Thus, jobs submitted to parallel batch systems incur queue waiting times in addition to the execution times. Prediction of these queue waiting times is important to provide overall estimates to the users and can also help metaschedulers make sc...

This paper evaluates the delay of the issue queue in a superscalar processor to aid microarchitectural design, where quick quantification of the complexity of the issue queue is needed to consider the tradeoff between clock cycle time and instructions per cycle. Our study covers two aspects. First, we introduce banking tag RAM, which comprises the issue queue, to reduce the delay. Unlike normal...

We consider a discrete-time multi-server queue for which the moments of the stationary queue length can be expressed in terms of series over the zeros in the closed unit disk of a queue-specific characteristic function. In many important cases these zeros can be considered to be located on a queue-specific curve, called generalized Szegö curve. By adopting a special parametrization of these Sze...

We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. A setup at a queue is incurred only if there are customers waiting at the polled queue. We obtain the transforms of the queue length and sojourn time di...

Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack layout of a dag is similar to a stack layout of an undirected graph, with the additional requirement...

This paper considers access control in a target multiserver loss queue fed by a set of upstream parallel multiserver loss queues and by a stream of new customers. The target queue faces a choice of how many servers to reserve for each stream. Revenue is gained by each station when it serves a customer, but the amount of revenue at the target queue depends on the source of the customer. We prove...

The queue size at a bottleneck would impact the performance of TCP protocols, especially when running a single TCP flow in networks with a large bandwidth-delay product. However, queue size has been not well considered in experiments. This paper shows how bottleneck queue size influences TCP protocols performance. Bursityness of advanced TCPs is examined. Ways of estimating queue size are intro...

In this paper, we consider a discrete-time finite-buffer queue with correlated arrivals and service interruptions and the corresponding infinite-buffer queue. Under some assumptions, we derive an exact relation holding between the loss probability in the finite-buffer queue and the queue length distribution in the corresponding infinite-buffer queue. The exact relation is considered as an integ...

The proposed model helps mining frequent patterns in large databases by implementing queue data structure. The whole database is scanned only once and the data is compressed in the form of patterns in the queue structure. The frequent patterns are mined from this compressed database of queue structure. This queue approach brings efficiency in mining as the number of database scans is effectivel...

This paper presents a concurrent FIFO queue. The queue is designed to support high, scalable performance through both partitioning its representation , and the removal of locks. A proof of the consistency properties of the queue operations is developed, based on the Linearizability consistency condition. Linearizability is of interest because of its compositional properties , providing a strong...