检索结果-内蒙古大学图书馆

load balancing algorithms based on gradient methods and their analysis through algebraic graph theory

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2008年第2期68卷 209-220页

作者： Bronevich, Andrey G. Meyer, Wolfgang Taganrog State Univ Radio Engn Taganrog 347928 Russia Inst Automatisierungstechn D-21073 Hamburg Germany

The main results of this paper are based on the idea that most load balancing algorithms can be described in the framework of optimization theory. It enables to involve classical results linked with convergence, its speed and other elements. We emphasize that these classical results have been found independently and till now this connection has not been shown clearly. In this paper, we analyze the load balancing algorithm based on the steepest descent algorithm. The analysis shows that the speed of convergence is determined by eigenvalues of the Laplacian for the graph of a given load balancing system. This consideration also leads to the problems of choosing an optimal structure for a load balancing system. We prove that these optimal graphs have special Laplacians: the multiplicities of their minimal and maximal positive eigenvalues must be greater than one. Such a property is essential for strongly regular graphs, investigated in algebraic graph theory. (c) 2007 Elsevier Inc. All rights reserved.

关键词： load balancing algorithms gradient methods algebraic graph theory Laplacian

来源：评论

学校读者我要写书评

暂无评论

Parallel CBIR implementations with load balancing algorithms

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2006年第8期66卷 1062-1075页

作者： Bosque, Jose L. Robles, Oscar D. Pastor, Luis Rodriguez, Angel U Rey Juan Carlos Dpto Informat Estadist & Telemat Madrid 28933 Spain UPM Dept Tecnol Foton Boadilla Del Monte 28660 Spain

The purpose of content-based information retrieval (CBIR) systems is to retrieve, from real data stored in a database, information that is relevant to a query. When large volumes of data are considered, as it is very often the case with databases dealing with multimedia data, it may become necessary to look for parallel solutions in order to store and gain access to the available items in an efficient way. Among the range of parallel options available nowadays, clusters stand out as flexible and cost effective solutions, although the fact that they are composed of a number of independent machines makes it easy for them to become heterogeneous. This paper describes a heterogeneous cluster-oriented CBIR implementation. First, the cluster solution is analyzed without load balancing, and then, a new load balancing algorithm for this version of the CBIR system is presented. The load balancing algorithm described here is dynamic, distributed, global and highly scalable. Nodes are monitored through a load index which allows the estimation of their total amount of workload, as well as the global system state. load balancing operations between pairs of nodes take place whenever a node finishes its job, resulting in a receptor-triggered scheme which minimizes the system's communication overhead. Globally, the CBIR cluster implementation together with the load balancing algorithm can cope effectively with varying degrees of heterogeneity within the cluster;the experiments presented within the paper show the validity of the overall strategy. Together, the CBIR implementation and the load balancing algorithm described in this paper span a new path for performant, cost effective CBIR systems which has not been explored before in the technical literature. (C) 2006 Elsevier Inc. All rights reserved.

关键词： parallel implementations CBIR systems load balancing algorithms

来源：评论

学校读者我要写书评

暂无评论

A HIGHLY OR-PARALLEL INFERENCE MACHINE (MULTI-ASCA) AND ITS PERFORMANCE EVALUATION - AN ARCHITECTURE AND ITS load balancing algorithms

引用

IEEE TRANSACTIONS ON COMPUTERS 1994年第9期43卷 1062-1075页

作者： NAGANUMA, J OGURA, T NTT LSI Labs. Kanagawa Japan

An architecture and its four load balancing algorithms for a highly OR-parallel inference machine are proposed, and its performance is evaluated in a trace-driven simulation study. This inference machine consists of a large number of processing elements (PE's) with serial I/O links directly connected to each other in a simply modified mesh network. Each PE is a high-speed sequential Prolog processor with its own local memory. The activity of all PE's is locally controlled by four new load balancing algorithms based on purely local communication. Communication is allowed only between directly connected PE's. These load balancing algorithms reduce communication overhead in a load balancing and make it possible to accomplish highly OR-parallel execution. A software simulator using a trace-driven simulation technique based on an inference tree has been developed, and some typical OR-parallel benchmarks such as the n-queens problem have been simulated on it. The average communication per load balancing is reduced by a factor ranging from 1/30 to 1/100 by the interaction of these load balancing algorithms as compared with a conventional copying method. The inference machine (1024 PE's: 32 x 32 array) attains 300-600 times parallel speedup, assuming 1 MLIPS (mega logical inference per second) PE and a 20 MBPS (mega bit per second) each serial I/O link, which could be easily integrated on a single chip using current VLSI technology. This highly OR-parallel inference machine promises to be an important step towards the realization of a high-performance artificial intelligence system.

关键词： HIGHLY PARALLEL INFERENCE MACHINE ARCHITECTURE load balancing algorithms LOGIC PROGRAMMING LANGUAGE NONSHARED MEMORY MULTIPROCESSOR SYSTEM OR-PARALLEL EXECUTION PERFORMANCE EVALUATION PROLOG TRACE DRIVEN SIMULATION

来源：评论

学校读者我要写书评

暂无评论

Empowerment of cluster and grid load balancing algorithms to support distributed exascale computing systems with high compatibility

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING 2022年第3期25卷 235-252页

作者： Mollasalehi, Faezeh Shahrabi, Shirin Adibi, Elham Khaneghah, Ehsan Mousavi Shahed Univ Fac Engn Dept Comp Engn Tehran Iran

The nature of the scientific applications that need to be distributed exascale systems is in a way that both traditional and distributed exascale systems programs are required. As a result, the load balancer not only supports traditional mechanisms of the load balancer, but also these mechanisms should be empowered to support the states caused by the occurrence of events with a dynamic and interactive nature. In this paper, a mathematical model examines the traditional load balancer that is used in cluster and grid computing systems that should support which characteristics to manage the dynamic and interactive nature in processes and execution in distributed exascale computing systems. In cluster and grid systems that can support the specified characteristics in this article, in 60% of the cases, the load balancer can manage events with a dynamic and interactive nature and use the mathematical model as the load balancing mechanism.

关键词： distributed exascale computing load balancing events with the dynamic and interactive nature D&I load balancing algorithms cluster computing grid computing

来源：评论

学校读者我要写书评

暂无评论

Analysis of load balancing algorithms Using Cloud Analyst

Analysis of Load Balancing Algorithms Using Cloud Analyst

引用

International Conference on Emerging Trends in Expert Applications and Security (ICETEAS)

作者： Rathore, Jyoti Keswani, Bright Rathore, Vijay Singh Suresh Gyan Vihar Univ Jaipur Rajasthan India Suresh Gyan Vihar Univ Dept Comp Applicat Jaipur Rajasthan India Jaipur Engn Coll & Res Ctr Dept Comp Sci & Engn Jaipur Rajasthan India

ISBN: (纸本)9789811322853;9789811322846

Cloud computing delivers the services of cloud efficiently and effectively on pay-per usage basis to consumers. As the number of consumers and requests for the services are increasing day by day in cloud computing need of load balancing occurs. For efficient and effective management and usage of cloud service provider's resources, already many load balancing algorithms have been proposed. In this paper comparative analysis of existing algorithms has been performed using simulator, i.e., Cloud Analyst. Cloud Analyst is a GUI-based toolkit that performs testing and simulation. In this paper existing Throttled, Round Robin, ESCE, FCFS, and SJF are compared. Cloud Analyst simulation results shows significant outcomes in terms of data center processing time, total cost, and response time in cloud computing environment.

关键词： Cloud computing load balancing load balancing algorithms Cloud analyst Virtual machine Simulator Overall response time Data center processing time etc.

来源：评论

学校读者我要写书评

暂无评论

Analysis of load balancing algorithms using Cloud Analyst

引用

INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING 2016年第9期9卷 11-24页

作者： Singh, Simar Preet Sharma, Anju Kumar, Rajesh Thapar Univ Patiala 147004 Punjab India

This paper discusses the Cloudanalyst tool. Cloudanalyst tool is used to determine the better load balancing algorithm from various scheduling and load balancing techniques e.g. round robin algorithm. This learning will help valued understanding to design infrastructure services of the Cloud. Different areas like coordination between one data center and other data center, algorithms of load balancing as well as other value-added services are also kept in mind, that are possible like service broker policies, which synchronize efficiently among data centers and enhance cost and throughput which is given to the owners.

关键词： Cloud analyst and its features Data Center(DC) Virtual machines(VM) User bases(UB) load balancing algorithms service broker algorithms

来源：评论

学校读者我要写书评

暂无评论

load balancing REQUIREMENTS IN PARALLEL IMPLEMENTATIONS OF IMAGE FEATURE-EXTRACTION TASKS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1993年第9期4卷 994-1013页

作者： GEROGIANNIS, D ORPHANOUDAKIS, SC UNIV CRETE DEPT COMP SCIGR-71110 IRAKLIONGREECE INST COMP SCI GR-71110 IRAKLIONGREECE YALE UNIV DEPT ELECT ENGNNEW HAVENCT 06520

load balancing requirements in parallel image analysis are considered and results on the performance of parallel implementations of two image feature extraction tasks on the Connection Machine and the iPSC/2 hypercube are reported and discussed. A load redistribution algorithm, which makes use of parallel prefix operations and one-to-one permutations among the processors, is described and has been used in this work. The expected improvement in performance resulting from load balancing has been determined analytically and is compared to actual performance results obtained from the above implementations. The analytical results demonstrate the specific dependence of the expected improvement in performance on the computational and communication requirements of each task, characteristic machine parameters, a characterization of prior load distribution in terms of parameters which can be computed dynamically at the start of task execution, and the overhead incurred by load redistribution. Based on these results one may also define a set of rules for determining in advance the potential gains in performance to be obtained from application of this particular load balancing algorithm.

关键词： DISTRIBUTED MEMORY MULTIPROCESSOR ARCHITECTURES load balancing algorithms PARALLEL COMPUTER VISION PARALLEL PROCESSING PERFORMANCE EVALUATION

来源：评论

学校读者我要写书评

暂无评论

ALBL: an adaptive load balancing algorithm for distributed web systems

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS 2014年第2期13卷 144-168页

作者： Kontogiannis, Sotirios Karakos, Alexandros Democritus Univ Thrace Fac Software Engn Dept Elect & Comp Engn Univ campus Kimeria GR-67100 Xanthi Greece

This paper presents an adaptive load balancing algorithm (ALBL) for cluster-based web systems. The balancing policy is based on two criteria: HTTP process time and network delay. The former describes web server ability to process a forthcoming request, while the latter tries to estimate network conditions. Periodic criteria calculations are performed by agents at the web switch and the weight estimation process is transparent to web servers enhancing therefore distributed system's scalability. We put to test our implementation against known blind selection balancing algorithms used at web-farms such as: Round Robin, stateful ones such as Least Connections and adaptive ones such as Least load. We also put to test performance and scalability of previous algorithms. From our testbed scenario results we show that ALBL algorithm outperforms stateless and stateful algorithms and also presents significant performance gains towards adaptive algorithms. We also show that our algorithm scales well as the number of balancing servers and web cluster's requests rate increases. We also pinpoint ALBL algorithm ability to predict network conditions and web servers load without the use of feedback information obtained by web servers but frequent service and network probes towards web servers issued by the web switch.

关键词： distributed web systems web clusters load balancing algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimization of cloud load balancing using fitness function and duopoly theory

引用

International Journal of Intelligent Computing and Cybernetics 2021年第2期14卷 198-217页

作者： Resma K.S. Sharvani G.S. Ramasubbareddy Somula Computer Science and Engineering Research Center Affiliated to VTU BelagaviRV College of EngineeringBangaloreIndia Computer Science and Engineering RV College of EngineeringBangaloreIndiaand Information Technology VNRVJIETHyderabadIndia

Purpose-Current industrial scenario is largely dependent on cloud computing ***-demand services provided by cloud data centre are paid as per ***,it is very important to make use of the allocated resources to the *** resource utilization is highly dependent on the allocation of resources to the incoming *** allocation of requests is done with respect to the physical machines present in the *** allocating the tasks to these physical machines,it needs to be allocated in such a way that no physical machine is underutilized or over *** make sure of this,optimal load balancing is very ***/methodology/approach-The paper proposes an algorithm which makes use of the fitness functions and duopoly game theory to allocate the tasks to the physical machines which can handle the resource requirement of the incoming *** major focus of the proposed work is to optimize the load balancing in a *** optimization happens,none of the physical machine is neither overloaded nor under-utilized,hence resulting in efficient utilization of the ***-The performance of the proposed algorithm is compared with different existing load balancing algorithms such as round-robin load(RR)ant colony optimization(ACO),artificial bee colony(ABC)with respect to the selected parameters response time,virtual machine migrations,host shut down and energy *** the four parameters gave a positive result when the algorithm is ***/value-The contribution of this paper is towards the domain of cloud load *** paper is proposing a novel approach to optimize the cloud load balancing *** results obtained show that response time,virtual machine migrations,host shut down and energy consumption are reduced in comparison to few of the existing algorithms selected for the *** proposed algorithm based on the duopoly function and fitness function brings in an optimized performance

关键词： Cloud computing load balancer load balancing algorithms Duopoly game theory Fitness functions Response time Virtual machine migrations Host shut down Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Dynamic Combination of Improved Max-Min and Ant Colony Algorithm for load balancing in Cloud System 6

Dynamic Combination of Improved Max-Min and Ant Colony Algor...

引用

6th International Conference on Computing, Communication and Networking Technologies (ICCCNT)

作者： Ghumman, Navtej Singh Kaur, Rajwinder SBS State Tech Campus CSE Dept Ferozepur India

ISBN: (纸本)9781479979837

Cloud Computing is a new technology. Cloud Computing provides many facilities like on demand self-services, unlimited resources, rapid elasticity and measured services to end users. All users access these resources directly through internet. Users can use these resources and services as they want on pay per use concept. In cloud computing architecture load balancing is a very important issue. There are many algorithms for load balancing in cloud computing. All algorithms work different ways. We proposed a Improved Max-Min Ant colony Algorithm. Improved Max-Min used the concept of original Max-Min. Improved Max-Min is based on the execution time not on completion time as a selection basis. The main motive of our work is to balance the total load of cloud system. We try to minimizing the total makespan. We simulated results using the CloudSim toolkit. Results show the comparison between improved max min and new hybrid improved Max-Min ant approach. It mainly focuses on total processing time and processing cost.

关键词： Cloud computing load balancing algorithms Improved Max- Min algorithm ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：