近几年,分布式计算领域出现了两个研究热点:网格计算(Grid Computing)和对等计算(Peer to Peer Com-puting)。网格计算和对等计算以不同的方法组织大规模分布式的资源,包括计算能力、存储资源和带宽等。两者的研究领域有一定的重叠,又...近几年,分布式计算领域出现了两个研究热点:网格计算(Grid Computing)和对等计算(Peer to Peer Com-puting)。网格计算和对等计算以不同的方法组织大规模分布式的资源,包括计算能力、存储资源和带宽等。两者的研究领域有一定的重叠,又有很好的互补性,融合将是必然趋势。我们构想了一个广域网虚拟平台,全世界的计算机连接成一个整体,任何人随时随地都可以得到所需的资源和服务。正是这一理想,驱动着网格计算和对等计算技术的快速进步。展开更多
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.展开更多
文摘近几年,分布式计算领域出现了两个研究热点:网格计算(Grid Computing)和对等计算(Peer to Peer Com-puting)。网格计算和对等计算以不同的方法组织大规模分布式的资源,包括计算能力、存储资源和带宽等。两者的研究领域有一定的重叠,又有很好的互补性,融合将是必然趋势。我们构想了一个广域网虚拟平台,全世界的计算机连接成一个整体,任何人随时随地都可以得到所需的资源和服务。正是这一理想,驱动着网格计算和对等计算技术的快速进步。
基金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.
