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

Fuzzy Decision and graph algorithms Aided Adaptive Protection of Microgrid

Energy Procedia 2017年 117卷 1078-1084页

作者： O.V. Gnana Swathika S. Angalaeswari V. Anantha Krishnan K. Jamuna J.L. Febin Daya VIT University Chennai-127 India

Consumer power demand is an ever increasing component in distribution networks. A solution to meet this bridge between conventional source availability and load demands is using microgrids. The microgrid is an assortment of loads and distributed generators (DGs). The dynamicity of microgrids is a key challenge for protection engineers. The purpose of this paper is to develop a central protection system (CPS) for a microgrid with fuzzy based monitoring and graph algorithms based protection control features. Hence the CPS provides suitable overcurrent relay coordination to the microgrid which may cause minimum portion of the network disconnection.

关键词： Microgrid Adaptive Protection graph algorithms Fuzzy

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Task Migration for graph algorithms using Processing in Memory 30

Fine-Grained Task Migration for Graph Algorithms using Proce...

引用

30th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Aguilera, Paula Zhang, Dong Ping Kim, Nam Sung Jayasena, Nuwan Univ Wisconsin Dept Elect & Comp Engn Madison WI 53706 USA AMD Res Sunnyvale CA USA Univ Illinois Dept Elect & Comp Engn Champaign IL USA

ISBN: (纸本)9781509036820

graphs are used in a wide variety of application domains, from social science to machine learning. graph algorithms present large numbers of irregular accesses with little data reuse to amortize the high cost of memory accesses, requiring high memory bandwidth. Processing in memory (PIM) implemented through 3D die-stacking can deliver this high memory bandwidth. In a system with multiple memory modules with PIM, the in-memory compute logic has low latency and high bandwidth access to its local memory, while accesses to remote memory introduce high latency and energy consumption. Ideally, in such a system, computation and data are partitioned among the PIM devices to maximize data locality. But the irregular memory access patterns present in graph applications make it difficult to guarantee that the computation in each PIM device will only access its local data. A large number of remote memory accesses can negate the benefits of using PIM. In this paper, we examine the feasibility and potential of fine-grained work migration to reduce remote data accesses in systems with multiple PIM devices. First, we propose a data-driven implementation of our study algorithms: breadth-first search (BFS), single source shortest path (SSSP) and betweenness centrality (BC) where each PIM has a queue where the vertices that it needs to process are held. New vertices that need to be processed are enqueued at the PIM device co-located with the memory that stores those vertices. Second, we propose hardware support that takes advantage of PIM to implement highly efficient queues that improve the performance of the queuing framework by up to 16.7%. Third, we develop a timing model for the queueing framework to explore the benefits of work migration vs. remote memory accesses. And, finally, our analysis using the above framework shows that naive task migration can lead to performance degradations and identifies trade-offs among data locality, redundant computation, and load balance among PI

关键词： graph algorithms Processing In Memory

来源：评论

学校读者我要写书评

暂无评论

Elastic Partition Placement for Non-stationary graph algorithms 16

Elastic Partition Placement for Non-stationary Graph Algorit...

引用

16th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)

作者： Dindokar, Ravikant Simmhan, Yogesh Indian Inst Sci Dept Computat & Data Sci Bangalore Karnataka India

ISBN: (纸本)9781509024537

Distributed graph platforms like Pregel have used vertex-centric programming models to process the growing corpus of graph datasets using commodity clusters. However, the irregular structure of graphs causes load imbalances across machines, and this is exacerbated for non-stationary graph algorithms where not all parts of the graph are active at the same time. As a result, such graph platforms do not make efficient use of distributed resources. In this paper, we decouple graph partitioning from placement on hosts, and introduce strategies for elastic placement of graph partitions on Cloud VMs to reduce the cost of execution compared to a static placement, even as we minimize the increase in makespan. These strategies are innovative in modeling the graph algorithm's non-stationary behavior a priori using a metagraph sketch. We validate our strategies for several real-world graphs, using runtime traces for approximate Betweenness Centrality (BC) algorithm on our subgraph-centric GoFFish graph platform. Our strategies are able to reduce the cost of execution by up to 54%, compared to a static placement, while achieving a makespan that is within 25% of the optimal.

关键词： graph algorithms Elastic Scheduling Big Data Cloud Computing Distributed Systems

来源：评论

学校读者我要写书评

暂无评论

The Comparison of Large-Scale graph Processing algorithms Implementation Methods for Intel KNL and NVIDIA GPU 3rd

The Comparison of Large-Scale Graph Processing Algorithms Im...

引用

3rd Russian Supercomputing Days (RuSCDays)

作者： Afanasyev, Ilya Voevodin, Vladimir Lomonosov Moscow State Univ Moscow Russia

ISBN: (纸本)9783319712543;9783319712550

The paper describes implementation approaches to large-graph processing on two modern high-performance computational platforms: NVIDIA GPU and Intel KNL. The described approach is based on a deep a priori analysis of algorithm properties that helps to choose implementation method correctly. To demonstrate the proposed approach, shortest paths and strongly connected components computation problems have been solved for sparse graphs. The results include detailed description of the whole algorithm's development cycle: from algorithm information structure research and selection of efficient implementation methods, suitable for the particular platforms, to specific optimizations for each of the architectures. Based on the joint analysis of algorithm properties and architecture features, a performance tuning, including graph storage format optimizations, efficient usage of the memory hierarchy and vectorization is performed. The developed implementations demonstrate high performance and good scalability of the proposed solutions. In addition, a lot of attention was paid to profiling implemented algorithms with NVIDIA Visual Profiler and Intel (R) VTune (TM) Amplifier utilities. This allows current paper to present a fair comparison, demonstrating advantages and disadvantages of each platform for large-scale graph processing.

关键词： graph algorithms GPU KNL CUDA Vectorization SSSP SCC Large-scale graph processing

来源：评论

学校读者我要写书评

暂无评论

Real-time parallel routing for telecom networks, - graph algorithms and bulk-synchronous parallel acceleration

Real-time parallel routing for telecom networks, - Graph alg...

引用

IEEE Canadian Conference on Electrical and Computer Engineering

作者： Gaetan Hains Alain Dominguez Central Software Institute French R&D Center Huawei Technologies Paris France

ISBN: (纸本)9781467387224

The fixed-time constrainted routing problem (FTCRP) is an engineering variant of the multicommodity network-flow problem where flows represent unsplittable telecommunication routes, and global solutions should be computed in at most one millisecond per route. Algorithmic solutions based on integer linear programming (ILP) lead to column generation (CG) heuristics to cope lazily with the exponential number of paths. In this paper we present experimental evidence that solving FTCRP with ILP leads to explosive time and memory consumption, while many innovative algorithms can alleviate this combinatorial explosion, and are also amenable to highly scalable bulk-synchronous (BSP) algorithms. We show several new solution methods tested on realistic instances with up to hundreds of thousands of routes and many dozens of computational cores with high efficiency.

关键词： constrainted unsplittable network flows real-time algorithms bulk-synchronous parallelism graph algorithms

来源：评论

学校读者我要写书评

暂无评论

A visual methodology to assess spatial graph vertex ordering algorithms 37

A visual methodology to assess spatial graph vertex ordering...

引用

37th SIBGRAPI Conference on graphics, Patterns and Images (SIBGRAPI)

作者： Salinas, Karelia Barella, Victor Vieira, Thales Nonato, Luis Gustavo Univ Sao Paulo ICMC USP Inst Math & Comp Sci Sao Carlos Brazil Fed Univ Alagoas UFAL Inst Comp Maceio Alagoas Brazil

ISBN: (纸本)9798350376043;9798350376036

graph vertex ordering is crucial for various graph-related applications, especially in spatial and urban data analysis where graphs represent real-world locations and their connections. The task is to arrange vertices along a single axis while preserving spatial relationships, but this often results in distortions due to the complexity of spatial data. Existing methods mostly assess ordering quality using a global metric, which may not capture specific use case needs or localized variations. This work proposes a new methodology to visually evaluate and compare vertex ordering techniques on spatial graphs. Two quantitative comparison mechanisms are proposed. Experiments on urban data from various cities demonstrate the methodology's effectiveness in tuning hyperparameters and comparing well-known vertex ordering techniques. The visual approach reveals nuanced spatial patterns that global metrics might miss, providing deeper insights into the behavior of different vertex ordering methods.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Prediction of instruction SDC vulnerability in routing algorithms based on graph convolutional network 4

Prediction of instruction SDC vulnerability in routing algor...

引用

4th International Conference on Network Communication and Information Security, ICNCIS 2024

作者： Liu, Zhijun Zhuang, Yi Nanjing University of Aeronautics and Astronautics Jiangsu Province Nanjing211100 China

ISBN: (数字)9781510688261

ISBN: (纸本)9781510688254

The transient faults caused by high-energy particles in the space radiation environment impact the reliability of routing algorithms in network communication mechanisms, where SDC (Silent Data Corruption) poses a significant threat to space-based network systems due to its insidious nature. Given that existing SDC fault tolerance methods do not incorporate the characteristics of space-based network communication mechanisms and require time-consuming fault injections, this paper proposes a method for strengthening the SDC vulnerability of network routing algorithms based on GCN (graph Convolutional Networks). First, the impact of transient faults on routing algorithms is analyzed, and a fault model of the routing algorithm is constructed. Next, the instruction features and instruction dependencies of the routing algorithm are extracted to construct an instruction dependency graph. Then, a GCN-based instruction SDC vulnerability prediction model is constructed and trained to predict the SDC vulnerability of the routing algorithm instructions. Finally, the routing algorithm is reinforced to enable self-detection and fault tolerance of SDC. Experimental results show that, compared to existing methods, the proposed method achieves higher accuracy in SDC vulnerability prediction and detection rates without requiring large-scale fault injection. © 2025 SPIE.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

algorithms for Optimally Shifting Intervals Under Intersection graph Models 18th

Algorithms for Optimally Shifting Intervals Under Intersect...

引用

18th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom, IJTCS-FAW 2024

作者： Honorato-Droguett, Nicolás Kurita, Kazuhiro Hanaka, Tesshu Ono, Hirotaka Nagoya University Nagoya Japan Kyushu University Fukuoka Japan

ISBN: (纸本)9789819777518

We propose a new model for graph editing problems on intersection graphs. In well-studied graph editing problems, adding and deleting vertices and edges are used as graph editing operations. As a graph editing operation on intersection graphs, we propose moving objects corresponding to vertices. In this paper, we focus on interval graphs as an intersection graph. We give a linear-time algorithm to find the total moving distance for transforming an interval graph into a complete graph. The concept of this algorithm can be applied for (i) transforming a unit square graph into a complete graph over L1 distance and (ii) attaining the existence of a k-clique on unit interval graphs. In addition, we provide LP-formulations to achieve several properties in the associated graph of unit intervals. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Influence of graph Characteristics on Parallel algorithms for Derived graph Structures 31

Evaluating the Influence of Graph Characteristics on Paralle...

引用

31st IEEE International Conference on High Performance Computing, Data, and Analytics Workshops, HiPCW 2024

作者： Pathak, Maulein Kapila, Samarth Sabharwal, Yogish Gupta, Neelima Dept of Computer Science University of Delhi India Keshav Mahavidyalaya University of Delhi India University Of British Columbia Vancouver Canada IBM Research India India Dept of Computer Science University of Delhi India

ISBN: (纸本)9798331509118

This work investigates how graph characteristics affect the quality of derived graphs, specifically focusing on graph spanners. graph spanners retain all vertices and a subset of edges while preserving shortest distances with an allowable stretch, making them essential for efficiently approximating graph structures. We emphasize recent advancements in parallel algorithms for constructing spanners in sparse graphs, building on the work of Miller et al. and Forster et al. By extracting key graph properties and employing data analysis techniques-such as correlation analysis, linear regression, and random forest regression-we examine the relationships between these characteristics and the size of the derived graphs, which is vital for optimizing spanner construction in real-world applications. © 2024 IEEE

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Spherical graph Layout for Force-Directed algorithms 17

Spherical Graph Layout for Force-Directed Algorithms

引用

17th IEEE International Scientific Conference on Informatics, INFORMATICS 2024

作者： Mazuch, Martin Brezani, Alexander Kostolny, Jozef University of Žilina Faculty of Management Science and Informatics Žilina Slovakia

ISBN: (纸本)9798350387674

This article explores the difficulties and approaches related to arranging graphs in a spatial context, namely through the utilization of force-driven algorithms. These algorithms strive to decrease the overall energy of the system by strategically placing the vertices. An important difficulty arises when nodes are located outside the camera's field of view as a result of the application of different forces. One potential approach entails connecting a threads to each node, pulling it towards a central reference point to ensure that the complete network is visible inside the camera's field of view. The paper also underscores the intricacies of converting these algorithms from a two-dimensional to a three-dimensional context, underscoring the importance of preserving user comprehension while avoiding the concealment of information. The technique that is based on forces and connects the input graph with the physical system of forces is also referenced. © 2024 IEEE.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：