Economic-based dynamic load distribution in large workstation networks

Backschat, Martin; Pfaffinger, Alexander; Zenger, Christoph

doi:10.1007/bfb0024758

Cited by 19 publications

(14 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An AMP is the whole program. Thus, AMPs represent a radical point in distributed decision making when not a location server [27], or a load balancing coordinator [28], or a cluster manager [25] decide where and when to move but each agent itself.…”

Section: Mobile Agent Load Balancingmentioning

confidence: 99%

See 1 more Smart Citation

Redundant movements in autonomous mobility: Experimental and theoretical analysis

Chechina¹,

King²,

Trinder³

2011

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Distributed load balancers exhibit thrashing where tasks are repeatedly moved between locations due to incomplete global load information. This paper shows that systems of Autonomous Mobile Programs (AMPs) exhibit the same behaviour, and identifies two types of redundant movement (greedy effect). AMPs are unusual in that, in place of some external load management system, each AMP periodically recalculates network and program parameters and may independently move to a better execution environment. Load management emerges from the behaviour of collections of AMPs.The paper explores the extent of greedy effects by simulating collections of AMPs and proposes negotiating AMPs (NAMPs) to ameliorate the problem. We present the design of AMPs with a competitive negotiation scheme (cNAMPs), and compare their performance with AMPs by simulation. We establish new properties of balanced networks of AMPs, and use these to provide a theoretical analysis of greedy effects.

show abstract

Section: Mobile Agent Load Balancingmentioning

confidence: 99%

“…Substituting (27) and (28) in (22) gives the following probability of the greedy effect after a cNAMP termination from a near-optimally balanced homogeneous network:…”

Section: Lemma 7 a Redundant Movement Occurs Only In Two Cases: Of Amentioning

confidence: 99%

Redundant movements in autonomous mobility: Experimental and theoretical analysis

Chechina¹,

King²,

Trinder³

2011

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…They satisfy some basic requirements for a Grid setting [20], namely: 1) they are naturally decentralized, 2) decisions about whether to consume or provide resources are taken locally by the clients or service providers, 3) the use of currency provides incentives for service providers to contribute resources, and 4) clients have to act responsibly and cannot afford to waste resources due to their limited budget. A number of systems [1], [3], [10], [16], [26] have been built using a market mechanism to allocate the computational resources. However, all of them make the inherent assumption that a market-based approach is per se better, which is ad hoc, as the allocation depends on many factors besides demand and supply, such as communication delays, bandwidth, server speeds, etc.…”

Section: Related Workmentioning

confidence: 99%

“…Spawn [26], POPCORN [16], and CPM [4] are examples of systems which employ decentralized auctions with resource accounting. Dynasty [3] pursues a different approach: avoiding the communication overhead of auctions, it uses brokering without any ongoing negotiation. Prices are periodically fixed and there are fees for migration and data transport services.…”

Section: Related Workmentioning

confidence: 99%

“…The resource management systems for such grids should provide mechanisms and tools that facilitate the realization of the goals of both resource owners and users. Most of the existing work on resource management and scheduling problems in grids adopts a conventional style where a scheduling component decides which jobs are to be executed at which site based on certain cost functions (AppLeS [3], Netsolve [6], Legion [9]). Such cost functions are often driven by systemcentric parameters that enhance system throughput and utilization rather than improving the utility of application processing.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation

Khan

Ahmad

2006

Proceedings 20th IEEE International Parallel &Amp; Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

A taxonomy of market‐based resource management systems for utility‐driven cluster computing

Yeo

Buyya

2006

Softw Pract Exp

View full text Add to dashboard Cite

In utility‐driven cluster computing, cluster Resource Management Systems (RMSs) need to know the specific needs of different users in order to allocate resources according to their needs. This in turn is vital to achieve service‐oriented Grid computing that harnesses resources distributed worldwide based on users' objectives. Recently, numerous market‐based RMSs have been proposed to make use of real‐world market concepts and behavior to assign resources to users for various computing platforms. The aim of this paper is to develop a taxonomy that characterizes and classifies how market‐based RMSs can support utility‐driven cluster computing in practice. The taxonomy is then mapped to existing market‐based RMSs designed for both cluster and other computing platforms to survey current research developments and identify outstanding issues. Copyright © 2006 John Wiley & Sons, Ltd.

show abstract

Economic-based dynamic load distribution in large workstation networks

Cited by 19 publications

References 0 publications

Redundant movements in autonomous mobility: Experimental and theoretical analysis

Redundant movements in autonomous mobility: Experimental and theoretical analysis

Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation

A taxonomy of market‐based resource management systems for utility‐driven cluster computing

Contact Info

Product

Resources

About