We give a polynomial time reduction from vector scheduling problem (VS) to generalized load balancing problem (GLB). This reduction gives the first non-trivial online algorithm for VS where vectors come in an online fashion. The online algorithm is very simple in that each vector only needs to minimize the Lln(md) norm of the resulting load when it comes, where m is the number of partitions and...

In the load balancing (or job scheduling) problem, introduced by Graham in the 1960s (SIAM J. of Appl. Math. 1966, 1969), jobs arriving online have to be assigned to machines so to minimize an objective defined on machine loads. A long line of work has addressed this problem for both the makespan norm and arbitrary lq-norms of machine loads. Recent literature (e.g., Azar et al., STOC 2013; Im e...

This paper considers the non-preemptive on-line load balancing problem where tasks have limited duration in time. Upon arrival, each task has to be immediately assigned to one of the machines, increasing the load on this machine for the duration of the task by an amount that depends on both the machine and the task. The goal is to minimize the maximum load. Azar, Broder and Karlin studied the u...

The growing popularity of peer-to-peer (P2P) systems has necessitated the need for managing huge volumes of data efficiently to ensure acceptable user response times. Dynamically changing popularities of data items and skewed user query patterns in P2P systems may cause some of the peers to become bottlenecks, thereby resulting in severe load imbalance and consequently increased user response t...

Online games and location-based services now form the potential application domains for the P2P paradigm. In P2P systems, balancing the workload is essential for overall performance. However, existing load balancing techniques for P2P systems were designed for stationary data. They can produce undesirable workload allocations for moving objects that is continuously updated. In this paper, we pr...

In load-balancing problems there is a set of clients, each wishing to select resource from permissible ones execute certain task. Each has latency function, which depends on its workload, and client’s cost the completion time her chosen resource. Two fundamental variants are selfish load balancing (a.k.a. games ), where clients non-cooperative players aimed at minimizing their own solely, onlin...

Consider that one job after another arrives online and must be placed on machines immediately, without knowing which jobs might arrive later. The goal is to balance the load of – sizes divided by machine speed. Each contributes a migration potential proportional its size, can used relocate some previously jobs. This paper presents results with improved competitiveness compared pure case using o...

This poster introduces the Grid-based IT’s applications which are designed and developed to improve the service quality by using Grid technology. During the last several years, the Grid technology had focused on the science application field like ST, NT and BT, but recently is extended to IT area and is used in various fields by integrating with IT technology. We developed Grid-based prototypes...

Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are all of cardinality h. To w-orient a hyperedge, we assign exactly w of its vertices positive signs with respect to the hyperedge, and the rest negative. A (w, k)-orientation of H consists of a w-orientation of all hyperedges of H, such that each vertex receives at most k positive signs from its incident hypere...