Borealis is a distributed stream processing engine that has been developed at Brandeis University, Brown University, and MIT. It extends the first generation of data stream processing systems with advanced capabilities such as distributed operation, scalability with timevarying load, high availability against failures, and dynamic data and query modifications. In this paper, we focus on aspects...

Efficiently exploiting the resources of data centers is a complex task that requires efficient and reliable load balancing and resource allocation algorithms. The former are in charge of assigning jobs to servers upon their arrival in the system, while the latter are responsible for sharing server resources between their assigned jobs. These algorithms should take account of various constraints...

In this paper, we propose a new algorithm, called Dynamic DNS for Load Balancing (DDLB), embedded in DNS (Domain Name Service) servers. By applying our algorithm into a simulation model with real data and comparing its performance with the original round-robin DNS setting, we found that around 40% of the incoming requests had shorter service time and almost no incoming requests got longer servi...

the dynamic response of a transversely isotropic, linearly elastic layer bonded to the surface of a half-space of a different transversely isotropic material under arbitrary shape surface loads is considered. with the help of displacements and stresses green’s functions, an analytical formulation is presented for the determination of the displacements and stresses at any point in both surface l...

We have designed and implemented a scalable hierarchical system for dynamic load distribution of general divide&conquer applications on large heterogeneous networks of workstations, called Dynasty. Besides its practical goal of exploiting idle processor time we focus the design on eeciency, fairness, reusability, and universality. Our approach is based on economical principles with prices as th...

LiPS 1 is a system for distributed computing using idle-cycles in heterogeneous networks of workstations. Especially data-and compute-intensive applications in the eld of cryptography and computer algebra have used the system. The system provides its user with the tuple space based generative communication paradigm of parallel computing as known from the coordination language Linda 2. In LiPS, ...

The e cient usage of workstations clusters depends rst of all on the distribution of the workload The following paper introduces a method to obtain e cient load balancing for data parallel applications through dynamic data assignment and a simple priority mechanism on a heterogeneous cluster of workstations assuming no prior knowledge about the workload This model improves the performance of lo...

In this paper we study diffusion schemes for dynamic load balancing on message passing multiprocessor networks. One of the main results concerns conditions under which these dynamic schemes converge and their rates of convergence for arbitrary topologies. These results use the eigenstructure of the iteration matrices that arise in dynamic load balancing. We completely analyze the hypercube netw...

Adaptive mesh reenement is a key problem in large-scale numerical calculations. The need of adaptive mesh reenement could introduce load imbalance among processors, where the load measures the amount of work required by reenement itself as well as by numerical calculations thereafter. We present a dynamic load balancing algorithm to ensure that the work load are balanced while the communication...