Página 1 dos resultados de 777 itens digitais encontrados em 0.007 segundos

Estudo sobre a variação dos parâmetros do Tree Load Balancing Algorithm; Study about the variation of the Tree Load Balancing Algorithm parameters

Raphaloski, Evandro
Fonte: Biblioteca Digitais de Teses e Dissertações da USP Publicador: Biblioteca Digitais de Teses e Dissertações da USP
Tipo: Dissertação de Mestrado Formato: application/pdf
Publicado em 21/02/2006 PT
Relevância na Pesquisa
66.77%
Em um sistema localmente distribuído, quando diversas tarefas são aleatoriamente submetidas aos computadores de uma determinada rede, onde alguns ficam sobrecarregados e outros permaneçam ociosos, algoritmos de balanceamento de carga podem ser utilizados para homogeneizar e otimizar a alocação de recursos e, conseqüentemente, aumentar o desempenho computacional. Com a evolução dos sistemas distribuídos, houve a necessidade de aprimoramento desses algoritmos, a fim de suportarem sistemas distribuídos altamente escaláveis e possibilitarem o gerenciamento de ambientes heterogêneos. Visando suprir essas necessidades, recentemente foi proposto um algoritmo de balanceamento de carga denominado Tree Load Balancing Algorithm (TLBA). Para avaliar esse algoritmo foram desenvolvidos um simulador e um protótipo. Com as simulações foram comprovados seus benefícios para ambientes distribuídos heterogêneos altamente escaláveis e com o protótipo esses resultados foram validados. Este trabalho apresenta a implementação de um novo simulador, que possibilitou um estudo mais abrangente dos parâmetros de balanceamento de carga do TLBA, com base em amostras estatisticamente geradas e uma maior fidelidade em suas políticas de balanceamento. Suas novas características são simulação em tempo real...

"Balanceamento de cargas de aplicações SPMD em sistemas computacionais distribuídos" ; Load balancing of SPMD applications in distributed computational systems

Furquim, Gustavo Antonio
Fonte: Biblioteca Digitais de Teses e Dissertações da USP Publicador: Biblioteca Digitais de Teses e Dissertações da USP
Tipo: Dissertação de Mestrado Formato: application/pdf
Publicado em 04/04/2006 PT
Relevância na Pesquisa
66.45%
Este trabalho apresenta a implementação e a utilização da migração de processos SPMD (Single Program Multiple Data), a qual realiza somente a transferência dos dados, que estão sendo manipulados pelo processo, para realizar a migração. Seu principal objetivo foi o estudo do impacto do balanceamento de carga no desempenho de aplicações, desenvolvidas utilizando o modelo de programação SPMD. Depois de realizados testes com aplicações SPMD reais, em sistemas computacionais distribuídos utilizando a migração de processos SPMD, foi possível verificar que ganhos de desempenho podem ser alcançados, tanto na migração de processos quanto no tempo de execução de aplicações paralelas SPMD.; This research presents the implementation and use of the SPMD (Single Program Multiple Data) process migration, which only does the transference of the data that are being used by the process, to perform the process migration. Its main objective was the study of the load balancing impact in the performance of applications developed using the SPMD programming model. After performing the tests with real SPMD applications, in distributed computational systems using the SPMD process migration, it was achieved good performance gains, both in the process migration and in the time execution of applications SPMD parallel applications.

Dynamic load-balancing : a new strategy for weather forecast models

Rodrigues, Eduardo Rocha
Fonte: Universidade Federal do Rio Grande do Sul Publicador: Universidade Federal do Rio Grande do Sul
Tipo: Tese de Doutorado Formato: application/pdf
ENG
Relevância na Pesquisa
66.76%
Weather forecasting models are computationally intensive applications and traditionally they are executed in parallel machines. However, some issues prevent these models from fully exploiting the available computing power. One of such issues is load imbalance, i.e., the uneven distribution of load across the processors of the parallel machine. Since weather models are typically synchronous applications, that is, all tasks synchronize at every time-step, the execution time is determined by the slowest task. The causes of such imbalance are either static (e.g. topography) or dynamic (e.g. shortwave radiation, moving thunderstorms). Various techniques, often embedded in the application’s source code, have been used to address both sources. However, these techniques are inflexible and hard to use in legacy codes. In this thesis, we explore the concept of processor virtualization for dynamically balancing the load in weather models. This means that the domain is over-decomposed in more tasks than the available processors. Assuming that many tasks can be safely executed in a single processor, each processor is put in charge of a set of tasks. In addition, the system can migrate some of them from overloaded processors to underloaded ones when it detects load imbalance. This approach has the advantage of decoupling the application from the load balancing strategy. Our objective is to show that processor virtualization can be applied to weather models as long as an appropriate strategy for migrations is used. Our proposal takes into account the communication pattern of the application in addition to the load of each processor. In this text...

Tempo de convergencia para o equilibrio de Nash nos jogos empacotamento de itens e balanceamento de carga; Convergence time to the Nash equilibrium in packing and load balancing games

Andre Luis Vignatti
Fonte: Biblioteca Digital da Unicamp Publicador: Biblioteca Digital da Unicamp
Tipo: Tese de Doutorado Formato: application/pdf
Publicado em 18/03/2010 PT
Relevância na Pesquisa
66.56%
Nesta tese, estudamos versões de teoria dos jogos dos problemas de empacotamento de itens e balanceamento de carga. Consideramos que a implementação de um algoritmo centralizado de controle é inviável, fazendo com que as entidades participantes do sistema ajam de maneira egoísta. Assim, a escolha egoísta de estratégias pelas entidades pode ou não levar a um estado estável do sistema, chamado de equilíbrio de Nash. Dependendo das condições definidas pelo modelo utilizado, devemos embutir certas regras para as entidades, contanto que as entidades tenham incentivo de utilizá-las e que, além disso, façam com que o sistema alcance um equilíbrio de Nash. Os principais resultados desta tese são relativos ao tempo de convergência para o equilíbrio de Nash, ou seja, buscamos saber quantas vezes os agentes mudam suas estratégias até alcançarem o equilíbrio de Nash, seja agindo de maneira completamente egoísta ou seguindo certas regras. Para o jogo de empacotamento de itens, apresentamos limitantes teóricos para o tempo de convergência, olhando ambos os casos de atualizações seqüenciais ou simultâneas das estratégias. Para o jogo de balanceamento de carga consideramos um modelo distribuído assíncrono com entidades heterogêneas...

Load balancing optimization of capacitated networks with path protection

Sousa, A. de; Santos, D.; Matos, P.; Madeira, J.
Fonte: Elsevier Publicador: Elsevier
Tipo: Artigo de Revista Científica
ENG
Relevância na Pesquisa
66.45%
This article deals with the routing of a given set of traffic flows over a telecommunications network with given link capacities. The aim is to optimize the network load balancing. We address the case where each traffic flow is supported by two edge disjoint routing paths, a mechanism known as path protection, which guarantees full traffic protection of single link failures. We describe an exact solving method based on mathematical programming and propose a meta-heuristic algorithm. Then, we define a set of case studies arising in the context of metropolitan Ethernet networks. Finally, we present the computational results of both methods and compare them in terms of solutions optimality versus runtime.

Optimization of link load balancing in multiple spanning tree routing networks

Santos, Dorabella; Sousa, Amaro Fernandes de; Dzida, Mateusz; Pióro, Michal; Alvelos, Filipe
Fonte: Springer Verlag Publicador: Springer Verlag
Tipo: Artigo de Revista Científica
ENG
Relevância na Pesquisa
66.59%
In telecommunication networks based on the current Ethernet technology, routing of traffic demands is based on multiple spanning trees: the network operator configures different routing spanning trees and assigns each demand to be routed in one of the selected spanning trees. A major optimization issue in this solution is the combined determination of (i) a set of appropriate spanning trees, and (ii) assignment of demands to the trees, in order to achieve an optimal load balancing on the links of the network. In this paper we consider models and solving techniques for lexicographical optimization of two load balancing objective functions. The first objective is the min-max optimization of the n worst link loads (with n up to the total number of network links), and the second objective is the minimization of the average link load (when n is smaller than the total number of network links). Besides exact methods, a heuristic technique that can compute both feasible solutions and lower bounds for the addressed optimization problem is proposed. Finally, we discuss effectiveness of different solution using results of a numerical study of realistic case studies.; FCT - PTDC/ EIA/64772/2006; Bolsa pos-doc - SFRH/ BPD/41581/2007

A hybrid column generation with GRASP and path relinking for the network load balancing problem

Santos, Dorabella; Sousa, Amaro Fernandes de; Alvelos, Filipe
Fonte: Elsevier Publicador: Elsevier
Tipo: Artigo de Revista Científica
ENG
Relevância na Pesquisa
66.72%
In this paper, a hybrid meta-heuristic is proposed which combines the GRASP with path relinking method and Column Generation. The key idea of this method is to run a GRASP with path relinking search on a restricted search space, defined by Column Generation, instead of running the search on the complete search space of the problem. Moreover, column generation is used not only to compute the initial restricted search space but also to modify it during the whole algorithm. The proposed heuristic is used to solve the network load balancing problem: given a capacitated telecommunications network with single path routing and an estimated traffic demand matrix, the network load balancing problem is the determination of a routing path for each traffic commodity such that the network load balancing is optimized, i.e., the worst link load is minimized, among all such solutions, the second worst link load is minimized, and continuing in this way until all link loads are minimized. The computational results presented in this paper show that, for the network load balancing problem, the proposed heuristic is effective in obtaining better quality solutions in shorter running times.

Load balancing optimization of telecommunication networks with two differentiated services

Sousa, Amaro Fernandes de; Lopes, Carlos; Santos, Dorabella
Fonte: Elsevier Publicador: Elsevier
Tipo: Artigo de Revista Científica
ENG
Relevância na Pesquisa
66.56%
The Differentiated Services architecture is a scalable solution to provide differentiated Quality of Service. In this paper, we address the network load balancing optimization of such networks based on bandwidth differentiation between two services. We define the optimization problem as an Integer Programming model and propose a heuristic algorithm based on GRASP with Path Relinking. We present computational results showing that (i) good quality solutions can be computed and (ii) proper load balancing can efficiently obtain service differentiation.

Optimizing network load balancing: an hybridization approach of metaheuristics with column generation

Santos, Dorabella; Sousa, Amaro Fernandes de; Alvelos, Filipe; Pióro, Michal
Fonte: Springer Publicador: Springer
Tipo: Artigo de Revista Científica
ENG
Relevância na Pesquisa
66.45%
Given a capacitated telecommunications network with single path routing and an estimated traffic demand matrix, we aim to determine the routing path of each traffic commodity such that the whole set of paths provide an optimal network load balancing. In a recent paper, we have proposed a column generation based heuristic where, in the first step, we use column generation to solve a linear programming relaxation of the original problem (obtaining, in this way, a lower bound and a set of paths for each commodity) and, in the second step, we apply a multi-start local search with path relinking heuristic on the solution space defined by the paths of the first step. Here, we propose a hybridization approach of the metaheuristic with column generation that can be seen as an enhanced version of the previous approach: we run column generation not only at the beginning (to define the initial search space) but also during the search. These additional column generation steps consist in solving a perturbed problem defined by the incumbent solution. In the previous paper, we have shown that the first approach is efficient in obtaining near optimal routing solutions within short running times. With the enhanced version, we show through computational results that the additional paths...

Link load balancing optimization of telecommunication networks: a column generation based heuristic approach

Santos, Dorabella; Sousa, Amaro Fernandes de; Alvelos, Filipe; Pioro, Michal
Fonte: IEEE Publicador: IEEE
Tipo: Conferência ou Objeto de Conferência
ENG
Relevância na Pesquisa
66.45%
This paper deals with optimal load balancing in telecommunication networks. For a capacitated telecommunications network with single path routing and an estimated traffic demand matrix, we wish to determine the routing paths aiming at min-max optimization of link loads. To solve this problem, we propose a column (path) generation based heuristic. In the first step, we use column generation to solve a linear programming relaxation of the basic problem (obtaining a lower bound and a set of paths). In the second step, we apply a multi-start local search heuristic with path-relinking to the search space defined by the paths found in the first step. In order to assess the merits of this approach, we also implemented a search heuristic which is equivalent to the second step of the proposed one but with no constraints on the set of paths that can be used. Through a set of computational results, we show that the proposed heuristic is efficient in obtaining near optimal routing solutions within short running times. Moreover, the comparison of the two heuristics show that constraining the search space to the columns given by column generation gives better results since this solution space contains good quality solutions and, due to its size...

Load Balancing vs. Locality Management in Shared-Memory Multiprocessors

Markatos, Evangelos P. ; LeBlanc, Thomas J.
Fonte: University of Rochester. Computer Science Department. Publicador: University of Rochester. Computer Science Department.
Tipo: Relatório
ENG
Relevância na Pesquisa
66.73%
A parallel application executes most efficiently when its workload is evenly distributed among the available processors, and processes are located close to their data. There is often a conflict between the goals of load balancing and locality management policies however, which many existing systems resolve in favor of load balancing. In this paper we use both experimentation and simulation to investigate the relationship between load balancing and locality management in shared-memory multiprocessors. Our experiments with applications on the BBN Butterfly multiprocessor show that although both techniques can improve application performance, locality management should be done before load balancing in many cases. Our simulations show that even in cases where there is a significant variation in the completion time of processes, or where the remote-to-local access time ratio is small, maximizing locality first and balancing load second usually results in the best performance. We conclude that the scheduler should not be oblivious to the location of data, as is the case with the popular central work queue model; instead, the location of data should be the primary factor influencing the initial assignment of processes to processors.

Customized Dynamic Load Balancing for a Network of Workstations

Zaki, Mohammed Javeed ; Li, Wei ; Parthasarathy, Srinivasan
Fonte: University of Rochester. Computer Science Department. Publicador: University of Rochester. Computer Science Department.
Tipo: Relatório
ENG
Relevância na Pesquisa
66.78%
Load balancing involves assigning to each processor, work proportional to its performance, minimizing the execution time of the program. Although static load balancing can solve many problems (e.g., those caused by processor heterogeneity and non-uniform loops) for most regular applications, the transient external load due to multiple-users on a network of workstations necessitates a dynamic approach to load balancing. In this paper we examine the behavior of {em global} vs {em local}, and {em centralized} vs {em distributed}, load balancing strategies. We show that different schemes are best for different applications under varying program and system parameters. Therefore, customized load balancing schemes become essential for good performance. We present a hybrid compile-time and run-time modeling and decision process which selects (customizes) the best scheme, along with automatic generation of parallel code with calls to a runtime library for load balancing.

Roteamento em redes em malha sem fio com balanceamento de carga e caminhos mais curtos; Routing in wireless mesh networks with load-balancing and shortest paths

Mello, Micael Oliveira Massula Carvalho de
Fonte: Universidade Federal de Goiás; Brasil; UFG; Programa de Pós-graduação em Ciência da Computação (INF); Instituto de Informática - INF (RG) Publicador: Universidade Federal de Goiás; Brasil; UFG; Programa de Pós-graduação em Ciência da Computação (INF); Instituto de Informática - INF (RG)
Tipo: Dissertação Formato: application/pdf
POR
Relevância na Pesquisa
66.56%
Wireless Mesh Networks (WMNs) are infrastructures with autonomic properties, such as self-organization and self-recovery, which can be developed with widely available technologies and low cost solutions. Besides their current applications, such as community networks and broad-band Internet access, WMNs can offer contributions in the context of the Internet of Things and help to build robust infrastructures to smart energy networks, among other uses. However, WMNs usually have performance issues due to overload in certain parts of the network and interference in wireless links. In this context, it is important that solutions are used to promote load-balancing and to mitigate interference between wireless links. Research in this area shows that one of the most promising approaches are in the subject of the joint routing and channel assignment. However, most of the previous works depends on the knowledge of the network traffic and handle flows with low granularity. In this thesis, we handle the performance problem in WMNs, in particular those having multiple radios and multiple available channels, using a joint approach, but without the mentioned restrictions. Our proposal is a joint heuristic, whose main contribution is the routing...

Aplicación de la teoría de juegos en el balanceo de carga y asignación de precios en redes heterogéneas; On the use of game theory techniques for load balancing and price assignment within heterogeneous access networks

López de la Torre, Carmen
Fonte: Universidade de Cantabria Publicador: Universidade de Cantabria
Tipo: Dissertação de Mestrado
SPA
Relevância na Pesquisa
66.5%
RESUMEN. El balanceo de carga es un problema de gran importancia dentro de los entornos de comunicaciones inalámbricas ya que es el proceso mediante el cual se administran correctamente los recursos disponibles, con el fin de ofrecer un servicio adecuado a los usuarios, y de que el reparto resulte eficiente para la red. En un entorno competitivo, en el que los operadores tienen que dedicar mayores esfuerzos para evitar que sus clientes abandonen la compañía (churn rate), la gestión de las políticas de precios es asimismo un problema importante. Unas políticas de precios adecuadas permitirán ofrecer precios más competitivos a los usuarios, además de hacer sostenibles a los operadores. Por otro lado, la Teoría de Juegos es una herramienta matemática en auge, y que también se está comenzando a aplicar en el entorno de las comunicaciones. El objetivo de este proyecto es el de estudiar, de forma analítica, cuáles son las mejores estrategias de asignación de recursos y de precios para, por un lado, cursar una mayor carga de tráfico y, además, obtener el máximo beneficio posible en redes inalámbricas heterogéneas. Para solventar estos problemas se hará uso de la Teoría de Juegos. Las estrategias óptimas obtenidas serán comparadas con soluciones menos inteligentes...

Proposta e avaliação de desempenho de um algoritmo de balanceamento de carga para ambientes distribuídos heterogêneos escaláveis; Proposal and performance evaluation of a load balancing algorithm for heterogeneous scalable distributed environments

Mello, Rodrigo Fernandes de
Fonte: Biblioteca Digitais de Teses e Dissertações da USP Publicador: Biblioteca Digitais de Teses e Dissertações da USP
Tipo: Tese de Doutorado Formato: application/pdf
Publicado em 27/11/2003 PT
Relevância na Pesquisa
66.8%
Algoritmos de balanceamento de carga são utilizados em sistemas distribuídos para homogeneizar a ocupação dos recursos computacionais disponíveis. A homogeneidade na ocupação do ambiente permite otimizar a alocação de recursos e, conseqüentemente, aumentar o desempenho das aplicações. Com o advento dos sistemas distribuídos de alta escala, fazem-se necessárias pesquisas para a construção de algoritmos de balanceamento de carga que sejam capazes de gerir com eficiência esses sistemas. Essa eficiência é medida através do número de mensagens geradas no ambiente, do suporte a ambientes heterogêneos, do uso de políticas que consomem poucos recursos do sistema, da estabilidade em alta carga, da escalabilidade do sistema e dos baixos tempos de resposta. Com o objetivo de atender as necessidades dos sistemas distribuídos de alta escala, este doutorado propõe, apresenta e avalia um novo algoritmo de balanceamento de carga denominado TLBA (Tree Load Balancing Algorithm). Esse algoritmo organiza os computadores do sistema em uma topologia lógica na forma de árvore, sobre a qual são executadas operações de balanceamento de carga. Para validar o TLBA foi construído um simulador que, submetido a testes, permitiu comprovar suas contribuições...

Synchronisation for dynamic load balancing of decentralised conservative distributed simulation

Bragard, Quentin; Ventresque, Anthony; Murphy, Liam
Fonte: Association for Computing Machinery Publicador: Association for Computing Machinery
Tipo: info:eu-repo/semantics/conferenceObject; all_ul_research; ul_published_reviewed
ENG
Relevância na Pesquisa
66.5%
peer-reviewed; Synchronisation mechanisms are essential in distributed sim- ulation. Some systems rely on central units to control the simulation but central units are known to be bottlenecks [10]. If we want to avoid using a central unit to optimise the simulation speed, we lose the capacity to act on the sim- ulation at a global scale. Being able to act on the entire simulation is an important feature which allows to dynam- ically load-balance a distributed simulation. While some local partitioning algorithms exist [12], their lack of global view reduces their e ciency. Running a global partitioning algorithm without central unit requires a synchronisation of all logical processes (LPs) at the same step.We introduce in this paper two algorithms allowing to synchronise logical processes in a distributed simulation without any central unit. The rst algorithm requires the knowledge of some topological properties of the network while the second algo- rithm works without any requirement. The algorithms are detailed and compared against each other. An evaluation shows the bene ts of using a global dynamic load-balancing for distributed simulations.

Visibility-based microcells for dynamic load balancing in MMO games

SUMILA, ALEXEI
Fonte: Quens University Publicador: Quens University
Tipo: Tese de Doutorado
EN; EN
Relevância na Pesquisa
66.72%
Massively multiplayer games allow hundreds of players to play and interact with each other simultaneously. Due to the increasing need to provide a greater degree of interaction to more players, load balancing is critical on the servers that host the game. A common approach is to divide the world into microcells (small regions of the game terrain) and to allocate the microcells dynamically across multiple servers. We describe a visibility--based technique that guides the creation of microcells and their dynamic allocation. This technique is designed to reduce the amount of cross--server communication, in the hope of providing better load balancing than other load--balancing strategies. We hypothesize that reduction in expensive cross-server traffic will reduce the overall load on the system. We employ horizon counts map to create visibility based microcells, in order to emphasize primary occluders in the terrain. In our testing we consider traffic over a given quality of service threshold as the primary metric for minimization. As result of our testing we find that dynamic load balancing produces significant improvement in the frequency of quality of service failures. We find that our visibility-based micro cells do not outperform basic rectangular microcells discussed in earlier research. We also find that cross-server traffic makes up a much smaller portion of overall message load than we had anticipated...

ROBIN HOOD : um ambiente para a avaliação de políticas de balanceamento de carga; Robin Hood: an environment to load balancing policies evaluation

Nogueira, Mauro Lucio Baioneta
Fonte: Universidade Federal do Rio Grande do Sul Publicador: Universidade Federal do Rio Grande do Sul
Tipo: Dissertação Formato: application/pdf
POR
Relevância na Pesquisa
66.6%
É ponto passivo a importância dos sistemas distribuídos no desenvolvimento da computação de alto desempenho nas próximas décadas. No entanto, ainda muito se debate sobre políticas de gerenciamento adequadas para os recursos computacionais espacialmente dispersos disponíveis em tais sistemas. Políticas de balanceamento de carga procuram resolver o problema da ociosidade das maquinas(ou, por outro lado, da super-utilização) em um sistema distribuído. Não são raras situações nas quais somente algumas maquinas da rede estão sendo efetivamente utilizadas, enquanto que varias outras se encontram subutilizadas, ou mesmo completamente ociosas. Aberta a possibilidade de executarmos remotamente uma tarefa, com o intuito de reduzirmos o tempo de resposta da mesma, ainda falta decidirmos "como" fazê-lo. Das decisões envolvidas quanto a execução remota de tarefas tratam as políticas de balanceamento de carga. Tais políticas, muito embora a aparente simplicidade quanto as decisões de controle tomadas ou ao reduzido numero de parâmetros envolvidos, não possuem um comportamento fácil de se prever. Sob determinadas condições, tais políticas podem ser tomar excessivamente instáveis, tomando sucessivas decisões equivocadas e...

Simulated-annealing load balancing for resource allocation in cloud environments

Fan, Z.; Shen, H.; Wu, Y.; Li, Y.
Fonte: IEEE Computer Society; online Publicador: IEEE Computer Society; online
Tipo: Conference paper
Publicado em //2013 EN
Relevância na Pesquisa
66.64%
Recently, the development of cloud computing has received considerable attention. For cloud service providers, packing VMs onto a small number of servers is an effective way to reduce energy costs, so as to improve the efficiency of the data center. However allocating too many VMs on a physical machine may cause some hotspots which viloate the SLA of applications. Load balancing of the entire system is hence needed to guarantee the SLA. In this paper, we present a simulated-annealing load balancing algortihm for solving the resource allocation and scheduling problem in a cloud computing environment. Experimental results show that this method is able to achieve load balancing, and performs better than the roundrobin and basic simulated-annealing algorithms.; Zongqin Fan, Hong Shen, Yanbo Wu, Yidong Li

Load Balancing for Parallel Computations with the Finite Element Method

González García,José Luis; Yahyapour,Ramin; Tchernykh,Andrei
Fonte: Centro de Investigación en computación, IPN Publicador: Centro de Investigación en computación, IPN
Tipo: Artigo de Revista Científica Formato: text/html
Publicado em 01/09/2013 EN
Relevância na Pesquisa
66.62%
In this paper, we give an overview of efforts to improve current techniques of load-balancing and efficiency of finite element method (FEM) computations on large-scale parallel machines and introduce a multilevel load balancer to improve the local load imbalance. FEM is used to numerically approximate solutions of partial differential equations (PDEs) as well as integral equations. The PDEs domain is discretized into a mesh of information and usually solved using iterative methods. Distributing the mesh among the processors in a parallel computer, also known as the mesh-partitioning problem, was shown to be NP-complete. Many efforts are focused on graph-partitioning to parallelize and distribute the mesh of information. Data partitioning is important to efficiently execute applications in distributed systems. To address this problem, a variety of general-purpose libraries and techniques have been developed providing great effectiveness. But the load-balancing problem is not yet well solved. Today's large simulations require new techniques to scale on clusters of thousands of processors and to be resource aware due the increasing use of heterogeneous computing architectures as found in many-core computer systems. Existing libraries and algorithms need to be enhanced to support more complex applications and hardware architectures. We present trends in this field and discuss new ideas and approaches that take into account the new emerging requirements