基于DSVM和消息传递的并行哈希连接算法的性能分析

Performance Analysis for Parallel Hash Join Algorithms Based on DSVM and Message Passing

基于分布式共享虚拟存储器（ＤＳＶＭ） 的软件设计方法是运行在网络工作站（ＮＯＷ） 上的支持并行计算与分布处理的新途径，它与传统的消息传递的编程方法不同·描述了在面向对象的分布式数据库系统ＳｈｕｓｓｅＵｏ 上，用ＤＳＶＭ 和消息传递两种方式分别实现并行哈希连接操作的３种算法；设计了测试数据库和３ 种不同的负载；并分析了ＤＳＶＭ 和消息传递这两种设计方法的性能·大量的测试结果表明，基于ＤＳＶＭ 的算法的性能比传统的消息传递的算法稍差，但ＤＳＶＭ 具有易编程等优点，因此在并行处理上仍是一项很有研究和开发价值的技术·

DSVM is a new way to support parallel computing and distributed processing in NOW environment. It is different from traditional method of message passing. Three parallel hash join algorithms using these two ideas were implemented in the distributed object oriented database system Shusse Uo; Special test database and three different loads were designed. The performance of parallel hash join algorithms based on DSVM and message passing was analyzed in detail. The performance of algorithm based on DSVM is a little worse than that of algorithm using message passing; but it is easy for users to program in DSVM environment, so DSVM is still a valuable technology and worth further studying in parallel processing.