Reducing energy consumption is part of the main concerns in cloud and HPC environments. Today servers energy consumption is far from ideal, mostly because it remains very high even with low usage state. An energy consumption proportional to the server load would bring important savings in terms of electricity consumption and then financial costs for a datacenter infrastructure. In this paper, w...

Although load balancing is a fundamental and well-studied problem in resource allocation, the ever changing scenarios and technologies in distributed systems demand new approaches and algorithms. In this context, we consider a real world scenario where servers are heterogeneous and have dynamic background loads not controlled by the load balancer. In such scenarios, classic round robin policy o...

In this paper, we present the first end-to-end fairness analysis of a network of fair servers. We argue that it is difficult to extend existing single-node fairness analysis to an end-to-end analysis of a network where each node may employ a different fair scheduling algorithm. We then present a two-step approach for end-to-end fairness analysis of heterogeneous networks. First, we define a cla...

Abstract We consider the load balancing problem in large-scale heterogeneous systems with multiple dispatchers. introduce a general framework called Local-Estimation-Driven (LED). Under this framework, each dispatcher keeps local (possibly outdated) estimates of queue lengths for all servers, and dispatching decision is made purely based on these estimates. The are updated via infrequent commun...

We consider a heterogeneous distributed service system consisting of n servers with unknown and possibly different processing rates. Jobs unit mean arrive as renewal process rate proportional to are immediately dispatched one several queues associated the servers. assume that dispatching decisions made by central dispatcher ability exchange messages endowed finite memory used store information ...

The current work aims to investigate the M/M/2 heterogeneous server retrial queueing system with breakdown and repair, considering discouragement of customers. An arriving customer will enter service facility check for availability servers. On finding either servers free, avail at available server. If both are busy upon arrival, then into orbit or leave without joining facility. customers await...

A heterogeneous computing environment has been widely used with UAVs, edge servers, and cloud servers operating in tandem. Various applications can be allocated linked to the nodes that constitute this environment. Efficiently offloading allocating computational tasks is essential, especially these environments differentials processing power, network bandwidth, latency. In particular, such as d...

With high throughput networks acquiring a crucial role in supporting data-intensive applications, a variety of data center network topologies have been proposed to achieve high capacity at low cost. While this work explores a large number of design points, even in the limited case of a network of identical switches, no proposal has been able to claim any notion of optimality. The case of hetero...

Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...

Performance tuning often involves consideration of adding another server to the system. Owing to changes in technology, the additional server may be of a service rate different from that of the existing servers. Moreover, with heterogeneous servers, consideration must be given to what service discipline should be employed. An analysis is provided of the effect on waiting time using two service ...