This paper extended a mathematical technique to model the behaviour of token-passing protocol in a star-coupled wavelength-division multiplexing (WDM) optical network for traffic multiplicity, based on a semi-Markov process. This analytical model is able to predict the results accurately. It is found that the proposed static priority scheme performs reasonably well in relatively stable and pred...

Parallel Priority Queue (PPQ) data structure supports parallel operations for manipulating data items with keys, such as inserting n new items, deleting n items with the smallest keys, creating a new PPQ that contains a set of items, and melding tow PPQ into one. In this article, we present some recent research works on PPQ which support the simultaneous operations of the k smallest elements, k...

Grid, Replication, Consistency Maintenance, Limd Refer ences Satyarth Kumar Singh 2008, Efficient grid scheduling algorithm based on priority queues, Thapar University, Patiala. Kavitha Ranganathan and Ian Foster 2007, Identifying Dynamic Replication Strategies for a High-Performance Data Grid, the University of Chicago.

We extend the Faulty RAM model by Italiano and Finocchi (2008) by adding a safe memory of arbitrary size S, and we then derive tradeoffs between the performance of resilient algorithmic techniques and the size of the safe memory. In particular, we describe a resilient algorithm for sorting n entries in O (n logn+ α(δ/S + logS)) time using Θ (S) safe memory locations, where α ≤ δ denotes the act...

We propose an algorithm to compute a counter-example of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nested breadth-first searches guided by a priority queue. It works in time O(n log n) and is linear in memory.

In Asynchronous Transfer Mode (ATM) network, Variable Bit Rate (VBR) service category has been defined to support any application for which the end-system can benefit from statistical multiplexing, by sending information at a variable rate, and can tolerate or recover from a potentially small random loss ratio. Due to its burst characteristic, bandwidth allocation strategy is necessary in order...

Parallel subregion-adaptive integration often exhibits sequential behavior when applied to functions with diicult local problems such as boundary singularities. To correct this, one needs to balance the loads of the processors by providing all of them with a reasonably diicult part of the problem. In this paper, we present two distributed adaptive integration methods: one based on a global heap...

For maximum efficiency in a multiprocessor system the load should be shared evenly over all processors, that is, there should be no idle processors when tasks are available. The delay in a load sharing algorithm is the larger of the maximum time that any processor can be idle before a task is assigned to it, and the maximum time that it must wait to be relieved of an excess task. A simple paral...

Large scale web caches are in fact localized sources of web contents. Besides replacement policies, which decide the contents of a cache, the management of such contents is an issue of special significance to web caching. This paper introduces our ongoing work on the research of cache content management. We propose a multicache based content management scheme in which web contents are distribut...

This paper describes a novel cost-driven disk scheduling algorithm for environments consisting of multi-priority requests. An example application is a video-on-demand system that provides high and low quality services, termed priority 2 and 1, respectively. Customers ordering a high quality (priority 2) service pay a higher fee and are assigned a higher priority by the underlying system. Our pr...