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

Systematic Review:Load Balancing in Cloud Computing by Using Metaheuristic Based dynamic algorithms

Intelligent Automation & Soft Computing 2024年第3期39卷 437-476页

作者： Darakhshan Syed Ghulam Muhammad Safdar Rizvi Department of Computer Science Bahria UniversityKarachi CampusKarachiPakistan

Cloud Computing has the ability to provide on-demand access to a shared resource *** has completely changed the way businesses are managed,implement applications,and provide *** rise in popularity has led to a significant increase in the user demand for ***,in cloud environments efficient load balancing is essential to ensure optimal performance and resource *** systematic review targets a detailed description of load balancing techniques including static and dynamic load balancing ***,metaheuristic-based dynamic load balancing algorithms are identified as the optimal solution in case of increased *** a cloud-based context,this paper describes load balancing measurements,including the benefits and drawbacks associated with the selected load balancing *** also summarizes the algorithms based on implementation,time complexity,adaptability,associated issue(s),and targeted QoS ***,the analysis evaluates the tools and instruments utilized in each investigated ***,comparative analysis among static,traditional dynamic and metaheuristic algorithms based on response time by using the CloudSim simulation tool is also ***,the key open problems and potential directions for the state-of-the-art metaheuristic-based approaches are also addressed.

关键词： Cloud computing load balancing metaheuristic algorithm dynamic algorithm load balancer QoS

来源：评论

学校读者我要写书评

暂无评论

Fast RankCIus algorithm via dynamic Rank Score Tracking on Bi-type Information Networks 2019

Fast RankCIus Algorithm via Dynamic Rank Score Tracking on B...

引用

Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services

作者： Kotaro Yamazaki Shohei Matsugu Hiroaki Shiokawa Hiroyuki Kitagawa Graduate School of SIE University of Tsukuba Center for Computational Sciences University of Tsukuba

ISBN: (纸本)9781450371797

Given a bi-type information network, which is an extended model of well-known bipartite graphs, how can clusters be efficiently found in graphs? Graph clustering is now a fundamental tool to understand overviews from graph-structured data. The RankClus framework accurately performs clustering for bi-type information networks using ranking-based graph clustering techniques. It integrates a graph ranking algorithms such as PageRank or HITS into graph clustering procedures to improve the clustering quality. However, this integration incurs a high computational cost to handle large bi-type information networks since RankClus repeatedly computes the ranking algorithm for all nodes and edges until the clustering procedure converges. To overcome this runtime limitation, herein we present a novel RankClus algorithm that reduces the running time for large bi-type information networks. Our proposed method employs dynamic graph processing techniques into the ranking procedures included in RankClus. By dynamically updating ranking results, our proposal reduces the number of computed nodes and edges during repeated ranking procedures. We experimentally verify using real-world datasets that our proposed method successfully reduces the running time while maintaining the clustering quality of RankClus.

关键词： dynamic algorithm Graph Clustering

来源：评论

学校读者我要写书评

暂无评论

New lower bound techniques for dynamic partial sums and related problems

引用

SIAM JOURNAL ON COMPUTING 2003年第3期32卷 736-753页

作者： Husfeldt, T Rauhe, T Lund Univ Dept Comp Sci SE-22100 Lund Sweden Univ Copenhagen IT DK-2400 Copenhagen NV Denmark

We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We give the model access to the right answer +/-1 as an oracle and prove that the problem remains hard. This suggests which kind of information is hard to maintain. From these results, we derive a number of lower bounds for dynamic algorithms and data structures: We prove lower bounds for dynamic algorithms for existential range queries, reachability in directed graphs, planarity testing, planar point location, incremental parsing, and fundamental data structure problems like maintaining the majority of the prefixes of a string of bits. We prove a lower bound for reachability in grid graphs in terms of the graph's width. We characterize the complexity of maintaining the value of any symmetric function on the prefixes of a bit string.

关键词： cell-probe model partial sum dynamic algorithm data structure

来源：评论

学校读者我要写书评

暂无评论

A TOPOLOGICAL APPROACH TO dynamic GRAPH CONNECTIVITY

引用

INFORMATION PROCESSING LETTERS 1987年第1期25卷 65-70页

作者： REIF, JH HARVARD UNIV DIV APPL SCIAIKEN COMPUTAT LABCAMBRIDGEMA 02138

A dynamic connectivity problem consists of an initial graph, and a sequence of operations consisting of graph modifications and graph connectivity tests. The size n of the problem is the sum of the maximum number of vertices and edges of the derived graph, plus the number of operations to be executed. Each graph modification is a deletion of either an edge or an isolated vertex. Each graph connectivity test is to determine if there exists a path in the current graph between two given vertices (the vertices can vary for distinct tests). The best previously known time for this dynamic connectivity problem was Ω(n 2 ). Our main result is an O(ng+n log n) time algorithm for the dynamic connectivity problem in the case of the maximum genus of the derived graph being g.

关键词： Graph algorithm connectivity dynamic algorithm planar graph

来源：评论

学校读者我要写书评

暂无评论

dynamic Clustering to Minimize the Sum of Radii

引用

algorithmICA 2020年第11期82卷 3183-3194页

作者： Henzinger, Monika Leniowski, Dariusz Mathieu, Claire Univ Vienna Fac Comp Sci Vienna Austria Univ Paris IRIF CNRS Paris France

In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the solution must be updated efficiently while remaining competitive with respect to the current optimal solution. We call thisdynamic sum-of-radii clusteringproblem. We present a data structure that maintains a solution whose cost is within a constant factor of the cost of an optimal solution in metric spaces with bounded doubling dimension and whose worst-case update time is logarithmic in the parameters of the problem.

关键词： dynamic algorithm Clustering in metric space Approximation Doubling dimension

来源：评论

学校读者我要写书评

暂无评论

Approximating dynamic Weighted Vertex Cover with Soft Capacities

引用

algorithmICA 2022年第1期84卷 124-149页

作者： Wei, Hao-Ting Hon, Wing-Kai Horn, Paul Liao, Chung-Shou Sadakane, Kunihiko Natl Tsing Hua Univ Dept Ind Engn & Engn Management Hsinchu 30013 Taiwan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30013 Taiwan Univ Denver Dept Math Denver CO USA Univ Tokyo Dept Math Informat Tokyo Japan

This study considers the soft capacitated vertex cover problem in a dynamic setting. This problem generalizes the dynamic model of the vertex cover problem, which has been intensively studied in recent years. Given a dynamically changing vertex-weighted graph G = (V, E), which allows edge insertions and edge deletions, the goal is to design a data structure that maintains an approximate minimum vertex cover while satisfying the capacity constraint of each vertex. That is, when picking a copy of a vertex v in the cover, the number of v's incident edges covered by the copy is up to a given capacity of v. We extend Bhattacharya et al.'s work [SODA'15 and ICALP'15] to obtain a deterministic primal-dual algorithm for maintaining a constant-factor approximate minimum capacitated vertex cover with O(log n/is an element of) amortized update time, where n is the number of vertices in the graph. The algorithm can be extended to (1) a more general model in which each edge is associated with a non-uniform and unsplittable demand, and (2) the more general capacitated set cover problem.

关键词： dynamic algorithm Vertex cover Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Iterative Refinement Using dynamic Precision

引用

IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS 2018年第4期8卷 722-735页

作者： Lee, JunKyu Vandierendonck, Hans Arif, Mahwish Peterson, Gregory D. Nikolopoulose, Dimitrios S. Queens Univ Belfast Inst Elect Commun & Informat Technol Belfast BT7 1NN Antrim North Ireland Univ Tennessee Elect Engn & Comp Sci Knoxville TN 37996 USA

Mixed precision is a promising approach to save energy in iterative refinement algorithms since it obtains speed-up without necessitating additional cores and parallelization. However, conventional mixed precision methods utilize statically defined precision in a loop, thus hindering further speed-up and energy savings. We overcome this problem by proposing novel methods which allow iterative refinement to utilize variable precision arithmetic dynamically in a loop (i.e., a trans-precision approach). Our methods restructure a numeric algorithm dynamically according to runtime numeric behavior and remove unnecessary accuracy checks. We implemented our methods by extending one conventional mixed precision iterative refinement algorithm on an Intel Xeon E5-2650 2GHz core with MKL 2017 and XBLAS 1.0. Our dynamic precision approach demonstrates 2.0-2.6x speed-up and 1.8-2.4x energy savings compared with mixed precision iterative refinement when double precision solution accuracy is required for forward error and with matrix dimensions ranging from 4K to 32K.

关键词： Transprecision dynamic precision dynamic algorithm iterative refinement energy savings

来源：评论

学校读者我要写书评

暂无评论

A fully dynamic approximation scheme for shortest paths in planar graphs

引用

algorithmICA 1998年第3期22卷 235-249页

作者： Klein, PN Subramanian, S Brown Univ Providence RI 02912 USA

In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter epsilon such that 0 < epsilon, our algorithm maintains approximate all-pairs shortest paths in an undirected planar graph G with nonnegative edge lengths. The approximate paths are guaranteed to be accurate to within a 1 + epsilon factor. The time bounds for both query and update for our algorithm is O (epsilon(-1) n(2/3) log(2) n log D), where n is the number of nodes in G and D is the sum of its edge lengths. The time bound for the queries is worst case, while that for the additions is amortized. Our approximation algorithm is based upon a novel technique for approximately representing all-pairs shortest paths among a selected subset of the nodes by a sparse substitute graph.

关键词： dynamic algorithm graph algorithm shortest path minimum-cost path planar graph

来源：评论

学校读者我要写书评

暂无评论

Adaptive Scheduling of Task Graphs with dynamic Resilience

引用

IEEE TRANSACTIONS ON COMPUTERS 2017年第1期66卷 17-23页

作者： Hu, Menglan Luo, Jun Wang, Yang Veeravalli, Bharadwaj Huazhong Univ Sci & Technol Sch Elect Informat & Commun Wuhan 430074 Hubei Peoples R China Nanyang Technol Univ Sch Comp Engn 50 Nanyang Ave Singapore 639798 Singapore Chiniese Acad Sci Shenzhen Inst Adv Technol Dept Comp Sci Shenzhen 518055 Guangdong Peoples R China Natl Univ Singapore Dept Elect & Comp Engn Singapore 117576 Singapore

This paper studies a scheduling problem of task graphs on a non-dedicated networked computing platform. The networked platform is characterized by a set of fully connected processors such as a multiprocessor system that can be shared by multiple tasks. Therefore, the computation and communication capacities of the computing platform dynamically fluctuate. To deal with this fluctuations for high performance task graph computing, we propose an online dynamic resilience scheduling algorithm called Adaptive Scheduling algorithm (ASA) that bears certain distinct features compared to existing algorithms. First, the proposed algorithm deliberately assigns tasks to idle processors in multiple rounds to prevent any unfavorable decisions and also to avoid inefficient assignments of certain key tasks to slow processors. Second, the algorithm adopts task duplication as an attempt to minimize serious increase of schedule length due to unexpected processor slowdown. Finally, a look-ahead message transmission policy is applied to save communication time and further improve the overall performance. Performance evaluation results are presented to demonstrate the effectiveness and competitiveness of our approaches when compared with the existing algorithms.

关键词： dynamic algorithm dynamic resilience multiprocessor scheduling task graphs task duplication

来源：评论

学校读者我要写书评

暂无评论

Kinetic and dynamic Delaunay tetrahedralizations in three dimensions

引用

COMPUTER PHYSICS COMMUNICATIONS 2004年第1期162卷 9-23页

作者： Schaller, G Meyer-Hermann, M Tech Univ Dresden Inst Theoret Phys D-01062 Dresden Germany

We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delatmay triangulations, where the time evolution of the triangulation is not only governed by moving vertices but also by a changing number of vertices. We use three-dimensional simplex flip algorithms, a stochastic visibility walk algorithm for point location and in addition, we propose a new simple method of deleting vertices from an existing three-dimensional Delaunay triangulation while maintaining the Delaunay property. As an example, we analyse the performance in various cases of practical relevance. The dual Dirichlet tessellation can be used to solve differential equations on an irregular grid, to define partitions in cell tissue simulations, for collision detection etc. (C) 2004 Elsevier B.V. All rights reserved.

关键词： Delaunay triangulation Voronoi tessellation flips point location vertex deletion kinetic algorithm dynamic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：