We propose the design and an implementation of a bulkparallel external memory priority queue to take advantage of both sharedmemory parallelism and high external memory transfer speeds to parallel disks. To achieve higher performance by decoupling item insertions and extractions, we offer two parallelization interfaces: one using “bulk” sequences, the other by defining “limit” items. In the des...

This paper examines the Bernoulli admission control policy for the two phase bulk arrival retrial queueing system wherein the customers has the option either to take second phase of service or to leave the system after completing first essential phase of service. In addition, the arrival rate of the customers depends upon the server status. After the service completion of each individual custom...

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

Motivated by the fault tolerance for manufacturing, we investigate a renewal input bulk arrival queue with fault-tolerant server, in which server can keep working low service rate even if partial failure occurs. Only when there are no customers system, be removed. To explore performance measures of queue, more generic and simpler algorithm based on right shift operator method solving difference...

The “Horizontal Y” shaped queuing model in which there is bulk infinite arrival of patients, but available M services are limited. discrete flow patients the system reduced continuous and a diffusion equation used. In terms means variances inter-arrival time distribution, this process number servers used, imposing reflecting boundaries. inspiration for analysis came from Aradhye Kallurkar [2], ...

In this paper we introduce two efficient priority queues. For both, insert requires O(1) amortized time and extract-min O(lgn) worstcase time including at most lgn+O(1) element comparisons, where n is the number of elements stored. One priority queue is based on a weak heap (array-based) and the other on a weak queue (pointer-based). In both, the main idea is to temporarily store the inserted e...

We consider a bulk service G I / M / l queue with service rates depending on service batch size. If there are n customers waiting at the completion of service, min(n, I\) customers enter service. We show that the queue size and the service batch size at points of arrivals form an embedded Markov chain and the steady-state probabilities of this Markov chain have the matrix geometric form. We des...

In this paper, we consider a discrete-time single-server finite-buffer batch arrival queue in which customers are served in batches according to a general bulk-service rule, that is, at least ‘a’ customers are needed to start a service with a maximum serving capacity of ‘b’ customers. The server takes a (single and multiple) vacation as soon as the queue length falls below ‘a’ at the completion...