An Amended Partitioning Algorithm for Multi-server DVE

Yanhua Wu () and Xiaoming Xu ()
Additional contact information
Yanhua Wu: Shanghai Jiaotong University, Dept. of Computer Science
Xiaoming Xu: Shanghai Jiaotong University, Dept. of Computer Science

A chapter in Current Trends in High Performance Computing and Its Applications, 2005, pp 521-525 from Springer

Abstract: Abstract In this paper, We present an amended algorithm named AMD algorithm base on DLS partition algorithm. AMD algorithm keeps the advantage of the DLS algorithm and gets rid of its drawbacks. In our algorithm, All the servers take the highest possibility to handled the loads averagely, which keeps the system run stably. All the server get a fair load scare at any time. At the same time our amend algorithm can also reduce the overload times of the whole system. This will improve the system’s security and stability.

Keywords: Partition; distributed virtual environments; network load (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-27912-9_71

Ordering information: This item can be ordered from
http://www.springer.com/9783540279129

DOI: 10.1007/3-540-27912-1_71

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().