A comparison study of evolutive algorithms for solving the partitioning problem in distributed virtual environment systems

Authors:
P. Morillo;J. M. Orduña;M. Fernández
Affiliations:
Instituto de Robótica, Universidad de Valencia, Av. Vicent Andrés Estellés s/n 46100 Burjassot, Valencia, Spain;Departamento de Informática, Universidad de Valencia, Av, Vicent Andrés Estellés s/n 46100 Burjassot, Valencia, Spain;Instituto de Robótica, Universidad de Valencia, Av. Vicent Andrés Estellés s/n 46100 Burjassot, Valencia, Spain
Venue:
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Year:
2004

Citing 17
Cited 3

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Alternatives in automatic function definition: a comparison of performance

Advances in genetic programming
Networked virtual environments: design and implementation

Networked virtual environments: design and implementation
Practical genetic algorithms

Practical genetic algorithms
Introduction

Communications of the ACM - Internet abuse in the workplace and Game engines in scientific research
An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems

IEEE Transactions on Parallel and Distributed Systems
ATLAS: a scalable network framework for distributed virtual environments

Proceedings of the 4th international conference on Collaborative virtual environments
Evolutionary Algorithms for Solving Multi-Objective Problems

Evolutionary Algorithms for Solving Multi-Objective Problems
Building Multiuser Interactive Multimedia Environments at MERL

IEEE MultiMedia
A Taxonomy for Networked Virtual Environments

IEEE MultiMedia
Exploiting Reality with Multicast Groups

IEEE Computer Graphics and Applications
mWorld: A Multiuser 3D Virtual Environment

IEEE Computer Graphics and Applications
An ACS-Based Partitioning Method for Distributed Virtual Environment Systems

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A GRASP-Based Algorithm for Solving DVE Partitioning Problem

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
A comparison study of modern heuristics for solving the partitioning problem in distributed virtual environment systems

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

A partitioning method of balancing CPU utilization of servers in DVE

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Cluster based partitioning for agent-based crowd simulations

Winter Simulation Conference
A dynamic hierarchical map partitioning for MMOG

ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environment (DVE) systems very common nowadays. However, there are several key issues in these systems that should still be improved in order to design a scalable and cost-effective system. One of these key issues is the partitioning problem. This problem consists of efficiently assigning clients (3D avatars) to the servers in the system. In this paper, we present a comparison study of different modern heuristics for solving the partitioning problem in DVE systems, as an alternative to the ad hoc heuristic proposed in the literature. Performance evaluation results show that some of the heuristic methods can greatly improve the performance of the partitioning method, particularly for large DVE systems. In this way, efficiency and scalability of DVE systems can be significantly improved.