In this paper, we present a new extension and reinterpretation of one of the most successful models of awareness in Computer Supported Cooperative Work (CSCW), called the Spatial Model of Interaction (SMI), which manage awareness of interaction through a set of key concepts, to manage task delivery in collaborative distributed systems. This model , called AMBLE (Awareness Model for Balancing th...

Using the matrix factorization technique in machine learning is very common mainly in areas like recommender systems. Despite its high prediction accuracy and its ability to avoid over-fitting of the data, the Bayesian Probabilistic Matrix Factorization algorithm (BPMF) has not been widely used on large scale data because of the prohibitive cost. In this paper, we propose a distributed high-per...

The Common Object Request Broker Architecture (CORBA) compliant load balancing mechanism has caught the attention of many researchers in recent years. Load balancing is an issue, which has to be concerned in CORBA architecture. In this paper, we provide an overview of CORBA-based load balancing mechanism. We discuss its requirements, policies, strategies, as well as the pros and cons. We addres...

This paper discusses load balancing in Multi-Agent Systems (MAS) through a generic algorithm based on agent’s distribution. The need is born from the observation of frequent load-balancing problems over simulations based on multiagent systems. Miro which is a software system developed for scalable urban mobility simulation is a concrete example of this type of problems. The difficulty of this w...

The implementation of a load balancing policy on a continuous basis in a delay-limited distributed computing environment may not only drain the computational resources of each computational element (CE), but can also lead to an unnecessary exchange of loads between the CEs. This degrades the system performance, measured by the overall completion time of the total tasks in the system. Thus, for ...

Abstmcl-The implementation of a load balancing policy on a continuous basis in a delay-limited distributed computing environment may not only drain the computational resources of each computational element (CE), hut can also lead to an unnecessary exchange of loads between the CEs. This degrades the system performance, measured by the overall completion time of the total tasks in the system. Th...

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...

This paper presents an unbalanced tree search (UTS) benchmark designed to evaluate the performance and ease of programming for parallel applications requiring dynamic load balancing. We describe algorithms for building a variety of unbalanced search trees to simulate different forms of load imbalance. We created versions of UTS in two parallel languages, OpenMP and Unified Parallel C (UPC), usi...

In this paper, we develop a new mathematical model that integrates layout configuration and production planning in the design of dynamic distributed layouts. The model incorporates a number of important manufacturing attributes such as demand fluctuation, system reconfiguration, lot splitting, work load balancing, alternative routings, machine capability and tooling requirements. In addition, t...

Cloud computing has become very popular in last few years. As a part of its services, it provides a flexible and easy way to keep and retrieve data and files. In cloud computing load balancing is a key issue. It would consume a lot of cost to maintain load information. Good load balancing makes cloud computing more efficient and improves user satisfaction. Many algorithms were suggested to prov...