✦ LIBER ✦

Dynamic load-balancing mechanism for distributed Java applications

✍ Scribed by Violeta Felea; Bernard Toursel

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 416 KB
Volume: 18
Category: Article
ISSN: 1532-0626
DOI: 10.1002/cpe.921

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Program environments or operating systems generally leave the decision on the allocation of program entities to the developer, offering either placement directives, or tools available through the manipulation of a graphical interface. These approaches cannot always take into account the dynamic behavior of applications, dynamicity in the execution environment or the heterogeneity of the execution platform. Transparent deployment algorithms are necessary for automizing and optimizing application distribution. The Adaptive Distributed Applications in Java (ADAJ) project deals with placement and migration of Java objects. It automatically deploys parallel Java applications on a cluster of workstations using monitoring information about the application behavior. The transparency obtained through the integration of these tools in the middleware makes such an environment easy to use and improves efficiency. Copyright © 2005 John Wiley & Sons, Ltd.

📜 SIMILAR VOLUMES

Data Allocation and Dynamic Load Balanci

Data Allocation and Dynamic Load Balancing for Distributed Video Storage Server

✍ Shiao-Li Tsao; Meng Chang Chen; Ming-Tat Ko; Jan-Ming Ho; Yueh-Min Huang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 319 KB

A dynamic load balancing method based on

A dynamic load balancing method based on network delay for large distributed systems

✍ Kenji Nishimura; Hitoshi Ueno; Miki Yamamoto; Hiromasa Ikeda 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB 👁 2 views

The authors propose two dynamic load balancing methods which give consideration to network delays in a large-scale, wide-area distributed system. In general in load balancing, the number of candidate computers for transfers increases as the number of computers being used increases, and so efforts ar

An optimal migration algorithm for dynam

An optimal migration algorithm for dynamic load balancing

✍ HU, Y. F.; BLAKE, R. J.; EMERSON, D. R. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 2 views

The problem of redistributing the work load on parallel computers is considered. An optimal redistribution algorithm, which minimises the Euclidean norm of the migrating load, is derived. The relationship between this algorithm and some existing algorithms is discussed and the convergence of the new

Call for Papers: Special Issue of theJou

Call for Papers: Special Issue of theJournal of Parallel and Distributed Computingon Dynamic Load Balancing

📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 11 KB

## CALL FOR PAPERS Special Issue of the Journal of Parallel and Distributed Computing on Dynamic Load Balancing Papers are solicited for a special issue of the Journal of Parallel and Distributed Computing (JPDC) to be tentatively scheduled for publication in January 1988. Dynamic load balancing

Load-Balancing Schemes for High-Throughp

Load-Balancing Schemes for High-Throughput Distributed Fault-Tolerant Servers

✍ Roy Friedman; Daniel Mosse 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Customized Dynamic Load Balancing for a

Customized Dynamic Load Balancing for a Network of Workstations

✍ Mohammed Javeed Zaki; Wei Li; Srinivasan Parthasarathy 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Load balancing involves assigning to each processor work proportional to its performance, thereby minimizing the execution time of a program. Although static load balancing can solve many problems (e.g., those caused by processor heterogeneity and nonuniform loops) for most regular applications, the