In canonical parallel processing, the operating system (OS) assigns a processing core to a single thread from a multithreaded server application. Since different threads from the same application often carry out similar computation, albeit at different times, we observe extensive code reuse among different processors, causing redundancy (e.g., in our server workloads, 45–65% of all instruction ...

in this research, both resource allocation and reactive resource allocation problems in multi-server dynamic pert networks are analytically modeled, where new projects are expected to arrive according to a poisson process, and activity durations are also known as independent random variables with exponential distributions. such system is represented as a queuing network, where multi servers at ...

A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.  

Maintaining the availability of critical network servers is an important concern for many organizations. Server redundancy is the traditional approach to provide availability in the presence of failures. From the client perspective, a network-accessible service is resolved via a set of public IP addresses specified for this service. Therefore, the continued availability of a service via these I...

Even though the PMIP provides mobility solutions, there are many issues of user identity, mobility context of users from a home network to the visiting network, the assignment of home address to a user terminal in a visiting network, identification of the user terminal’s mobility, and identification of MPA and HA. In this paper, we propose a new mechanism with proxy mobile IPv4, as a mobility s...

in this paper a single server queuing production system is considered which is subject to gradual deterioration. the system is discussed under two different deteriorating conditions. a planning horizon is considered and server which is a d/m/1 queuing system is gradually deteriorates through time periods. a maintenance policy is taken into account whereby the server is restored to its initial c...

The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...

Motivated by the dispatching of trucks to shovels in surface mines, we study optimal routing in a Markovian finite-source, multi-server queueing system with heterogeneous servers, each with a separate queue. We formulate the problem of routing customers to servers to maximize the system throughput as a Markov Decision Process. When the servers are homogenous, we demonstrate that the Shortest Qu...

In this lecture, we analyze the problem of scheduling n equal size tasks arriving online to n different machines. This could easily be solved with a centralized server that knows which machines are occupied and assigns all n tasks to unique machines. Instead, we want to see if it’s possible to distribute the tasks without without such coordination among the tasks. In this problem, the metric we...