Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to sa...Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.展开更多
Based on the analysis of the task sizes and the load, this paper discussps the granularity ofrelation spliting in the spliting phase taking acount of task load being less than average load,andprobes into the relations...Based on the analysis of the task sizes and the load, this paper discussps the granularity ofrelation spliting in the spliting phase taking acount of task load being less than average load,andprobes into the relationship between the granularity and load balancing. The minimum number ofbuckets is determined on the basis of relation spliting granularity,and the maximum number ofproduct tuples of each node is induced under the prerequisite for ensuring load balance in paralleljoin.展开更多
实现各类预想故障下潮流转移比快速仿真分析是电网安全稳定运行的重要保证。针对现有实际运行方式中潮流转移分析困难问题,提出大规模电力系统潮流转移比多核并行批处理方法。该方法基于广泛使用的商业大系统分析工具,在参数解析分类、...实现各类预想故障下潮流转移比快速仿真分析是电网安全稳定运行的重要保证。针对现有实际运行方式中潮流转移分析困难问题,提出大规模电力系统潮流转移比多核并行批处理方法。该方法基于广泛使用的商业大系统分析工具,在参数解析分类、故障自动设置及结果解析的基础上,引入深度优先搜索(depth first search,DFS)算法进行孤立节点和孤岛区域检测以保证网络完整性,结合潮流计算合理性的自动判别以实现潮流转移比的批处理分析;同时在多核环境下,构建基于Fork/Join的并行框架,采用"分治模式"递归分解计算任务,从而实现分析方法的多核并行。算例仿真和在云南电网的实际应用验证了所提方法的有效性和快速性。展开更多
基金supported by the National Research Foundation (NRF) of Korea through contract N-14-NMIR06
文摘Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.
文摘Based on the analysis of the task sizes and the load, this paper discussps the granularity ofrelation spliting in the spliting phase taking acount of task load being less than average load,andprobes into the relationship between the granularity and load balancing. The minimum number ofbuckets is determined on the basis of relation spliting granularity,and the maximum number ofproduct tuples of each node is induced under the prerequisite for ensuring load balance in paralleljoin.
文摘实现各类预想故障下潮流转移比快速仿真分析是电网安全稳定运行的重要保证。针对现有实际运行方式中潮流转移分析困难问题,提出大规模电力系统潮流转移比多核并行批处理方法。该方法基于广泛使用的商业大系统分析工具,在参数解析分类、故障自动设置及结果解析的基础上,引入深度优先搜索(depth first search,DFS)算法进行孤立节点和孤岛区域检测以保证网络完整性,结合潮流计算合理性的自动判别以实现潮流转移比的批处理分析;同时在多核环境下,构建基于Fork/Join的并行框架,采用"分治模式"递归分解计算任务,从而实现分析方法的多核并行。算例仿真和在云南电网的实际应用验证了所提方法的有效性和快速性。
