Currently used parallel best rst branch-and-bound algorithms either suuer from contention at a centralized priority queue or can only approximate the best rst strategy. Bottleneck free algorithms for parallel priority queues are known but they cannot be implemented very eeciently on contemporary machines. We present quite simple randomized algorithms for parallel priority queues on distributed ...

A novel packet multiplexing technique, called Rotating-Priority-Queues (RPQ), is presented which exploits the tradeo between high e ciency, i.e., the ability to support many connections with delay bounds, and low complexity. The operations required by the RPQ multiplexer are similar to those of the simple, but ine cient, Static-Priority (SP) multiplexer. The overhead of RPQ, as compared to SP, ...

Many known efficient algorithms for computational problems can be classified into a few algorithm paradigms: greedy algorithms, divide-and-conquer, dynamic programming, linear programming and backtracking algorithms. An approach to evaluating different algorithm paradigms is to show approximability of a specific computational problem in each paradigm. A ncessary component of such evaluation is ...

countries around the world are experiencing an ever-increasing need to make choices in investments in health and healthcare. this makes it incumbent upon them to have formal processes in place to optimize the legitimacy of eventual decisions. there is now growing experience among countries of the implementation of stakeholder participation, and a developing convergence of methods to support dec...

This paper is concerned with the stability of a preemptive repeat priority queueing system with multiple types of customers and customer transfers between queues. Using the mean-drift method and matrix-analytic methods, simple conditions for the queueing system to be stable or instable are found. The conditions indicate that system stability depends only on the service rate of customers of the ...

We obtain an essentially optimal tradeoff between the amortized cost of the three basic priority queue operations insert, delete and find-min in the comparison model. More specifically, we show that A(find-min) = Ω ( n (2 + )A(insert)+A(delete) )

We study MX/G/1 nonpreemptive and preemptive-resume priority queues with/without vacations under random order of service (ROS) discipline within each class. By considering the conditional waiting times given the states of the system, which an arbitrary message observes upon arrival, we derive the Laplace-Stieltjes transforms of the waiting time distributions and explicitly obtain the first two ...

A new priority queue structure is introduced, for which the amortized time to insert a new element isO(1) while that for the minimumextraction is O(logK). K is the average, taken over all the deleted elements x, of the number of elements that are inserted during the lifespan of x and are still in the heap when x is removed. Several applications of our structure are mentioned.