Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Dedicated service gateways provide Network services which direct traffic flows. Currently many researchers focus on gateway selection on the Shortest Route, Closest Gateway and not much on the congestion and network traffic in this route. In this paper, we have proposed a novel approach called Optimal Closest Gateway Mechanism with load balancing technique for traffic engineering. Instead of only...
Grid networks take advantage of the resources available by many computers connected within the network to solve large-scale computational problems. To achieve a scalable and reliable Grid network system, the workload needs to be efficiently distributed among the computing resources accessible on the network. Therefore, a distributed and scalable load-balancing scheme for Grid Networks is proposed...
As the IEEE 1516 standard for distribution simulation, High Level Architecture (HLA) framework does not solve the issues of scalability, dynamic load-balance and fault tolerance. HLA does not support federation migration, which would balance the system workload on heterogeneous distributed resources and consequently improve simulation's performance either. In this paper, a Grid based Advanced Distributed...
To solve the problem of grid resource allocation for tasks, an allocation algorithm based on improved particle swarm optimization was proposed. This algorithm leaded the cross operation, variation operation and select operation of the GA to the Particle Swarm Optimization Algorithm, it effectively overcame the inherent flaw of getting local optimal value by particle swarm algorithm and find the global...
High-speed routers rely on well-designed packet buffers that support multiple queuing, large capacity and short response times. Some researchers suggested a combined SRAM/DRAM hierarchical buffer architecture to meet these challenges. However, both the SRAM and DRAM need to maintain a large number of dynamic queues which is a real challenge in practice and limits the scalability of these approaches...
Based on analyzing the problem of task scheduling and load balancing for parallel applications in P2P computing environment that can be broken down into independent subtasks, a tree-based task scheduling model for P2P computing is proposed. The hierarchical approach is introduced to the model so as to schedule a large number of parallel tasks and the mathematical analysis for this model shows a good...
Oil reservoir simulators depend on numerical solvers to solve reservoir algebraic equations which represent the reservoir characteristics. Conjugate Gradient (CG) method is one of the most popular iterative linear solvers used. Parallelizing CG is then an essential step to increase the performance of the simulator using it. In this paper, we introduce an automatic parallel computational loading balancing...
A self-organizing load balancing framework is proposed in this paper. It provides self-optimizing load balancing policies to improve adaptation and robustness of Fixed Relay Station (FRS) based cellular networks. The framework proposes a Self-organizing Cooperative Partner Cluster (SCPC) concept to dynamically select optimal partners of each BS and RS. A novel Comprehensive Load Balancing Policy Stack...
The cell manufacturing was played close attention widely by the enterprises and academe in the last 30 years. And cell formation is a key factor to implement cell manufacturing effectively. In the recently research of cell formation problem, the researchers mainly focus on the parts families and machines grouping, but forget another important factor-operators. A multi-objective dual resource-constrained...
In structured peer-to-peer (p2p) systems, distributed hash tables (DHTs) often partition the ID space into disjoint intervals with each interval assigned to the corresponding node. While nodes join and leave dynamically, one of the hard challenges posed by DHTs is load balancing across the ID space. Tries are known to be a viable data structure such that a balanced trie implies balanced intervals...
Advances in device technology and dense wavelength division multiplexing have enabled modern optical backbones to provide high data rate services in a cost-effective manner. At the same time, applications are emerging with the potential to leverage these capabilities for short time spans: load migration for Internet clouds, integrated computational grids, and remote surgery. Until such applications...
We re-examine the problem of load balancing in conservatively synchronized parallel, discrete- event simulations executed on high-performance computing clusters, focusing on simulations where computational and messaging load tend to be spatially clustered. Such domains are frequently characterized by the presence of geographic "hot-spots'' - regions that generate significantly more simulation...
The fine two-phase routing (F-TPR) scheme, an IP finely-distributed load-balanced routing scheme based on two-phase routing over shortest paths, was previously presented to improve routing performances. F-TPR distributes traffic from a source node to intermediate nodes simply by using IP tunnels. F-TPR provides comparable routing performance to the sophisticated traffic engineering (TE) scheme of...
With number of I/O servers increasing, the load imbalance among them becomes an emerging challenge in using high-end computing system effectively. But most of contemporary file systems like PVFS2 and Lustre lack load balancing to optimize parallel I/O performance when facing large number of I/O servers. To address this problem, this paper proposes self-acting load balancing for parallel file systems...
Next-generation Network wireless Communication System has a variety of access modes. In order to solute how to select a proper access network under this feature and to realize the load balancing, A ubiquitous networks configuration based on multi-agent is proposed in this paper, use multi-agent Q-learning to realize the load balancing in Ubiquitous Networks with heterogeneous Radio Access Technologies...
Cloud Storage is an important part of Cloud Computing, and it provides a way to achieve large scale storage architecture. And virtual storage is a strategy for Cloud Storage. A load balancing virtual storage strategy (LBVS) is proposed in this paper. The contribution of this strategy is that, it provides a large scale net data storage model and Storage as a Service model based on Cloud Storage. Three...
The computational power provided by many-core graphics processing units (GPUs) has been exploited in many applications. The programming techniques supported and employed on these GPUs and Multi-GPUs systems are not sufficient to address problems exhibiting irregular, and unbalanced workload such as Molecular Dynamic (MD) simulations of systems with non-uniform densities. In this paper, we propose...
This paper is a description of our efforts to create a queueing model for parallel connection servers with different dispatch probabilities, so that we can estimate the system response time of parallel Web servers. First, we calculate the system response time of the parallel connection servers with different dispatch probabilities. Second, we simulate the queueing model of the parallel connection...
We consider the online data gathering problem in wireless sensor networks and examine the key issues of load balancing the nodes to achieve longer network lifetime, and that of load balancing the network links to achieve greater reliability in the network. We model the given network as a shortest-path DAG D, which defines a set of parent nodes for each node that determine the minimum-hops paths from...
In this paper, we present a dynamic load-balancing algorithm for optimistic gate level simulation making use of a machine learning approach. We first introduce two dynamic load-balancing algorithms oriented towards balancing the computational and communication load respectively in a Time Warp simulator. In addition, we utilize a multi-state Q-learning approach to create an algorithm which is a combination...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.