共查询到20条相似文献,搜索用时 15 毫秒
1.
《Parallel Computing》2013,39(10):615-637
A key point for the efficient use of large grid systems is the discovery of resources, and this task becomes more complicated as the size of the system grows up. In this case, large amounts of information on the available resources must be stored and kept up-to-date along the system so that it can be queried by users to find resources meeting specific requirements (e.g. a given operating system or available memory). Thus, three tasks must be performed, (1) information on resources must be gathered and processed, (2) such processed information has to be disseminated over the system, and (3) upon users’ requests, the system must be able to discover resources meeting some requirements using the processed information. This paper presents a new technique for the discovery of resources in grids which can be used in the case of multi-attribute (e.g. {OS = Linux & memory = 4 GB}) and range queries (e.g. {50 GB < disk-space < 100 GB}). This technique relies on the use of content summarisation techniques to perform the first task mentioned before and strives at the main drawback found in proposals from literature using summarization. This drawback is related to scalability, and is tackled by means of using Peer-to-Peer (P2P) techniques, namely Routing Indices (RIs), to perform the second and third tasks.Another contribution of this work is a performance evaluation conducted by means of simulations of the EU DataGRID Testbed which shows the usefulness of this approach compared to other proposals from literature. More specifically, the technique presented in this paper improves on the scalability and produces good performance. Besides, the parameters involved in the summary creation have been tuned and the most suitable values for the presented test case have been found. 相似文献
2.
Resource overloading causes one of the main challenges in computing environments. In this case, a new resource should be discovered to transfer the extra load. However, this results in drastic performance degradation. Thus, it is of high importance to discover the appropriate resource at first. So far, several resource discovery mechanisms have been introduced to overcome this challenge, a majority of which neglect the fact that this important decision should be made in cooperation with other units existing in a computing environment. One of the units is load balancing. In this paper, we propose a model for communication between resource discovery and load balancing units in a computing environment. Based on the model, resource discovery and load balancing decisions are made cooperatively considering the behavior of running processes and resources capacities. These considerations make decisions more precise. In addition, the model presents the loosest type of coupling between resource discovery and load balancing units, i.e., message coupling. This feature provides a better scalability in size for the model. Comparative results show that the proposed model increases scalability in size by 7 to 15 %, cuts message transmission rate by 15 % and improves hit rate by 51 %. 相似文献
3.
The Journal of Supercomputing - The sensor network comprises various sensor nodes in which packet transfer requires detection of the route. The discovery of the path in such a network becomes... 相似文献
4.
We consider a new load balancing model that arises in the processing of user requests for files located on a given set of servers. The optimization criterion is the total excess of actual load over the limit load. In order to redistribute the load and minimize the criterion, files can be moved between the servers. We show that if there are no other constraints related to the stage of moving the files, then this problem is equivalent to a problem previously considered in literature. For this special case of this problem, we propose a stochastic local search scheme that combines a special procedure for fast querying of the neighborhoods and a procedure of non-aggravating modification of intermediate solutions. Results of numerical experiments show that the proposed approach is able to find high-quality solutions for instances of large dimension under tight time constraints. 相似文献
5.
We consider a well-known NP-hard server load balancing problem. We study the computational complexity of finding approximate solutions with guaranteed accuracy estimate. We show that this problem is Log-APX-hard with respect to PTAS reductions. To solve the problem, we develop an approximate method based on the ideas of genetic local search. We show results of computational experiments. 相似文献
6.
Zaher Al Aghbari Ibrahim Kamel Ahmed Mustafa 《Peer-to-Peer Networking and Applications》2011,4(4):391-409
Recently, many applications have used Peer-to-Peer (P2P) systems to overcome the current problems with client/server systems
such as non-scalability, high bandwidth requirement and single point of failure. In this paper, we propose an efficient scheme
to support efficient range query processing over structured P2P systems, while balancing both the storage load and access
load. The paper proposes a rotating token scheme to balance the storage load by placing joining nodes in appropriate locations
in the identifier space to share loads with already overloaded nodes. Then, to support range queries, we utilize an order-preserving
mapping function to map keys to nodes in order preserving way and without hashing. This may result in an access load imbalance
due to non-uniform distribution of keys in the identifier space. Thus, we propose an adaptive replication scheme to relieve
overloaded nodes by shedding some load on other nodes to balance the access load. We derive a formula for estimating the overhead
of the proposed adaptive replication scheme. In this study, we carry simulation experiments with synthetic data to measure
the performance of the proposed schemes. Our simulation experiments show significant gains in both storage load balancing
and access load balancing. 相似文献
7.
Ruixuan LiAuthor Vitae Wei SongAuthor Vitae 《Journal of Parallel and Distributed Computing》2011,71(3):407-423
Peer-to-peer (P2P) technology provides a popular way of distributing resources, sharing, and locating in a large-scale distributed environment. However, most of the current existing P2P systems only support queries over a single resource attribute, such as file name. The current multiple resource attribute search methods often encounter high maintenance cost and lack of resilience to the highly dynamic environment of P2P networks. In this paper, we propose a Flabellate overlAy Network (FAN), a scalable and structured underlying P2P overlay supporting resource queries over multi-dimensional attributes. In FAN, the resources are mapped into a multi-dimensional Cartesian space based on the consistent hash values of the resource attributes. The mapping space is divided into non-overlapping and continuous subspaces based on the peer’s distance. This paper presents strategies for managing the extended adjacent subspaces, which is crucial to network maintenance and resource search in FAN. The algorithms of a basic resource search and range query over FAN are also presented in this paper. To alleviate the load of the hot nodes, a virtual replica network (VRN) consisting of the nodes with the same replicates is proposed for replicating popular resources adaptively. The queries can be forwarded from the heavily loaded nodes to the lightly loaded ones through VRN. Theoretical analysis and experimental results show that FAN has a higher routing efficiency and lower network maintenance cost over the existing multi-attribute search methods. Also, VRN efficiently balances the network load and reduces the querying delay in FAN while invoking a relatively low overhead. 相似文献
8.
基于多级资源池的负载平衡系统的设计与实现 总被引:1,自引:2,他引:1
给出了一种基于多级资源池的负载平衡算法,采用主控节点集中分配和后台节点自治调节相结合的策略。并针对多级网络结构的集群系统的优势提出了集群系统中局部优先负载平衡的策略来降低进程迁移的代价,有效地提高了并行作业的响应时间,提高了系统的资源利用率。 相似文献
9.
Limited range spatial load balancing in non-convex environments using sampling-based motion planners
This paper analyzes the limited range, spatial load balancing problem for agents deployed in non-convex environments and subject to differential constraints which restricts how the agents can move. First, the (unlimited range) spatial load balancing problem is introduced and the minimization problem with area constraints is defined. Then, to extend the problem for limited ranges, two cost functions and a sub-partition are defined. The problems are then analyzed and the results prove the existence of a partition that satisfies the area constraints. The non-convex environment makes the problem difficult to solve in continuous-space. Therefore, a probabilistic roadmap is used to approximate agents’ cells via a graph. A distributed algorithm is proven to converge to an approximate solution. Finally, the convergence of the algorithm is shown in simulation. 相似文献
10.
Jose Luis Bosque Pablo Toharia Oscar D. Robles Luis Pastor 《The Journal of supercomputing》2013,65(3):1104-1113
This paper presents a load balancing algorithm specifically designed for heterogeneous clusters, composed of nodes with different computational capabilities. The method is based on a new index, which takes into consideration two levels of processors heterogeneity: the number of cores per node and the computational power of each core. The experimental results show that this index allows achieving balanced workload distributions even on those clusters where heterogeneity can not be neglected. 相似文献
11.
Ad hoc grids are highly heterogeneous and dynamic, in which the availability of resources and tasks may change at any time.
The paper proposes a utility based resource selection scheme for QoS satisfaction and load balancing in ad hoc grid environments.
The proposed scheme intends to maximize the QoS satisfaction of ad hoc grid users and support load balancing of grid resources.
For each candidate ad hoc grid resource, the scheme obtains values from the computations of utility function for QoS satisfaction
and benefit maximization game for ad hoc grid resource preference. The utility function for QoS satisfaction computes the
utility value based on the satisfaction of QoS requirements of the grid user request. The benefit maximization game for grid
resource node preference computes the preference value from the resource point of view. Its main goal is to achieve load balancing
and decrease the number of resource selection failure. The utility value and the preference value of each candidate ad hoc
grid resource are combined to select the most suitable grid resource for ad hoc grid user request. In the simulation, the
performance evaluation of proposed algorithm for ad hoc grid is conducted. 相似文献
12.
Disk load balancing for video-on-demand systems 总被引:5,自引:0,他引:5
For a video-on-demand computer system, we propose a scheme which balances the load on the disks, thereby helping to solve
a performance problem crucial to achieving maximal video throughput. Our load-balancing scheme consists of two components.
The static component determines good assignments of videos to groups of striped disks. The dynamic component uses these assignments,
and features a “DASD dancing” algorithm which performs real-time disk scheduling in an effective manner. Our scheme works
synergistically with disk striping. We examine the performance of the proposed algorithm via simulation experiments. 相似文献
13.
Heiner Ackermann Simon Fischer Martin Hoefer Marcel Sch?ngens 《Distributed Computing》2011,23(5-6):321-330
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decreases with the number of users that allocate the resource. In our dynamic, concurrent model, users may reallocate resources in a round-based fashion. As opposed to various settings analyzed in the literature, we assume that users have quality of service demands. A user has zero utility when falling short of a certain minimum performance threshold and having positive utility otherwise. Whereas various load-balancing protocols have been proposed for the setting without quality of service requirements, we consider protocols that satisfy an additional locality constraint: The behavior of a user depends merely on the state of the resource it currently allocates. This property is particularly useful in scenarios where the state of other resources is not readily accessible. For instance, if resources represent channels in a mobile network, then accessing channel information may require time-intensive measurements. We consider several variants of the model, where the quality of service demands may depend on the user, the resource, or both. For all cases we present protocols for which the dynamics converge to a state in which all users are satisfied. More importantly, the time to reach such a state scales nicely. It is only logarithmic in the number of users, which makes our protocols applicable in large-scale systems. 相似文献
14.
Shoukat AliAuthor Vitae Behdis EslamnourAuthor Vitae 《Journal of Parallel and Distributed Computing》2011,71(4):556-564
This paper diverges from the traditional load balancing, and introduces a new principle called the on-machine load balance rule. The on-machine load balance rule leads to resource allocations that are better in tolerating uncertainties in the processing times of the tasks allocated to the resources when compared to other resource allocations that are derived using the conventional “across-the-machines” load balancing rule. The on-machine load balance rule calls for the resource allocation algorithms to allocate similarly sized tasks on a machine (in addition to optimizing some primary performance measures such as estimated makespan and average response time). The on-machine load balance rule is very different from the usual across-the-machines load balance rule that strives to balance load across resources so that all resources have similar finishing times.We give a mathematical justification for the on-machine load balance rule requiring only liberal assumptions about task processing times. Then we validate with extensive simulations that the resource allocations derived using on-machine load balance rule are indeed more tolerant of uncertain task processing times. 相似文献
15.
一种动态的入侵检测系统负载均衡算法 总被引:2,自引:0,他引:2
目前的入侵检测不仅需要模式匹配,而且需要协议异常检测,提出了一种新动态的负载均衡算法,采用两层结构,对网络流量按照服务类型进行初步划分之后分别对每部分流量进行二次分配,并对每种类型的流量进行相应的协议异常检测。该算法能在不牺牲系统性能的前提下有效提高网络入侵检测系统的检测效率,降低误检率,并可有效地适应网络流量的变化,降低漏检率。 相似文献
16.
Dynamic load balancing and efficient load estimators for asynchronous iterative algorithms 总被引:1,自引:0,他引:1
Bahi J.M. Contassot-Vivier S. Couturier R. 《Parallel and Distributed Systems, IEEE Transactions on》2005,16(4):289-299
In a previous paper, we have shown the very high power of asynchronism for parallel iterative algorithms in a global context of grid computing. In this article, we study the interest of coupling load balancing with asynchronism in such algorithms. After proposing a noncentralized version of dynamic load balancing which is best suited to asynchronism, we verify its efficiency by some experiments on a general partial differential equation (PDE) problem. Finally, we give some general conditions for the use of load balancing to obtain good results with this kind of algorithm and discuss the choice of the residual as an efficient load estimator. 相似文献
17.
A. Corts A. Ripoll F. Ced M. A. Senar E. Luque 《Journal of Parallel and Distributed Computing》2002,62(12)
Diffusion algorithms are some of the most popular algorithms for dynamic load balancing in which loads move from heavily loaded processors to lightly loaded neighbor processors. To achieve a global load balance in a parallel computer, the algorithm is iterated until the load difference between any two processors is smaller than a specified value. Therefore, one fundamental property to be studied is algorithm convergence. Several analytical works on the convergence of different diffusion load balancing algorithms have been carried out, but they treat loads as non-negative real quantities. In this paper, we describe the Diffusion Algorithm Searching Unbalanced Domains (DASUD) algorithm, which uses loads as non-negative integer values and, unlike existing algorithms, reaches a local balance situation where the maximum load difference between any two processor in the set of neighbor processors for each processor is one load unit. The convergence property of an asynchronous implementation of DASUD using integer loads is proven theoretically. 相似文献
18.
This paper presents the design philosophy and implementation of the BALANCE system. BALANCE is a flexible, network independent and computer architecture independent load balancing system which allows the building of reusable parallel and distributed applications. By implementing related services as bi generic servers with their connection endpoints registered in BALANCE, the clients can easily access the servers by server system calls. To demonstrate the flexibility of BALANCE, several widely different applications have been implemented and evaluated, including system servers, parallel and distributed applications and a scheduling testbed. The use of generic servers to improve system modularity and code reuse is also discussed. © 1997 John Wiley & Sons, Ltd. 相似文献
19.
Resource discovery systems become more and more important as distributed systems grow and as their pool of resources becomes more variable. As such, an increasing amount of networked systems provide a discovery service. This paper provides a taxonomy for resource discovery systems by defining their design aspects. This allows comparison of the designs of the deployed discovery services and is intended as an aid to system designers when selecting an appropriate mechanism. The surveyed systems are divided into four classes that are separately described. Finally, we identify a hiatus in the design space and point out genuinely distributed resource discovery systems that support dynamic and mobile resources and use attribute-based naming as a main direction for future research in this area.
相似文献
Koen VanthournoutEmail: URL: http://www.esat.kuleuven.ac.be |
20.
Dynamic load balancing for parallel polygon rendering 总被引:2,自引:0,他引:2
Using parallel processing for visualization speeds up computer graphics rendering of complex data sets. A parallel algorithm designed for polygon scan conversion and rendering is presented which supports fast rendering of highly complex data sets using advanced lighting models. Dedicated graphics rendering engines do not necessarily suit such data sets, although they can support real-time update of moderately complex scenes using simple lighting. Advantages to using a software-based approach include the feasibility of adding special rendering features to the program and the capability of integrating a parallel scientific application with a parallel graphics renderer. A new work decomposition strategy presented, called task adaptive, is based on dynamically partitioning the amount of computational work left at a given time. The algorithm uses a heuristic for dynamic task decomposition in which image space tasks are partitioned without requiring interruption of the partitioned processor. A sophisticated memory referencing strategy lets local memory access graphics data during rendering. This permits implementation of the algorithm on a distributed memory multiprocessor. An in-depth analysis of the overhead costs accompanying parallel processing shows where performance is adequate or could be improved 相似文献