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

Dynamic affinity cluster allocation in a shared disks cluster

JOURNAL OF SUPERCOMPUTING 2006年第1期37卷 47-69页

作者： Ohn, Kyungoh Cho, Haengrae Yeungnam Univ Dept Comp Engn Gyongsan 712749 Gyungbuk South Korea

A shared disks (SD) cluster couples multiple computing nodes for high performance transaction processing, and all nodes share a common database at the disk level. In the SD cluster, a front-end router selects a node for an incoming transaction to be executed. An affinity-based routing can increase the buffer hit ratio of each node by clustering transactions referencing similar data to be executed on the same node. However, the affinity-based routing is non-adaptive to the changes of the system load. This means that a specific node would be overloaded if corresponding transactions rush into the system. In this paper, we propose a new transaction routing algorithm, named Dynamic Affinity Cluster Allocation (DACA). DACA can make an optimal balance between the affinity-based routing and indiscriminate sharing of load in the SD cluster. As a result, DACA can increase the buffer hit ratio and reduce the frequency of inter-node buffer invalidations while achieving the dynamic load balancing.

关键词： cluster computing shared disks transaction processing transaction routing cache coherency affinity clustering load balancing

来源：评论

学校读者我要写书评

暂无评论

Parallel hash join algorithms for dynamic load balancing in a shared disks cluster

Parallel hash join algorithms for dynamic load balancing in ...

引用

International Conference on Computational Science and Its Applications (ICCSA 2006)

作者： Moon, Aekyung Cho, Haengrae ETRI Software Robot Res Team Taejon 305350 South Korea Yeungnam Univ Dept Comp Engn Kyongsan 712749 South Korea

ISBN: (纸本)3540340793

Most of previous parallel join algorithms assume a shared nothing (SN) cluster, where each database partition is owned by a single processing node. While SN cluster can interconnect a large number of nodes and support a geographically distributed environment, it may suffer from poor facility for load balancing and system availability compared to a shared disks sharing (SD) cluster. In this paper, we first propose a dynamic load balancing strategy by exploiting the characteristics of SD cluster. Then we parallelize conventional hash join algorithms using the dynamic load balancing strategy. We also explore the performance of parallel join algorithms using a simulation model of SD cluster. The experiment results show that the proposed parallel join algorithms can achieve higher potential for dynamic load balancing with the inherent flexibility of SD cluster.

关键词： cluster computing shared disks hash join load balancing

来源：评论

学校读者我要写书评

暂无评论

Affinity-based dynamic transaction routing in shared disks clusters

Affinity-based dynamic transaction routing in shared disks c...

引用

International Conference on Parallel and Distributed Processing Techniques and Applications

作者： Ohn, K Cho, H Ahn, B Yeungnam Univ Dept Comp Engn Kyongsan 712749 Kyongbuk South Korea

ISBN: (纸本)1892512459

Coupling multiple nodes for high performance transaction processing has become increasingly attractive for reasons of capacity, availability and cost. The shared disks (SD). cluster couples computing nodes via a highspeed network and share a common database at the disk level. This paper proposes a transaction routing algorithm that exploits access affinities of transactions to rationalize workload on computing nodes in the SD cluster. The proposed algorithm is novel in the sense that it can achieve an optimal balance between affinity-based routing and dynamic load balancing. The simulation results show that the proposed algorithm exhibits substantial performance improvement when transaction workload is changed dynamically.

关键词： cluster computing shared disks transaction routing performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of real-time transaction processing algorithms in shared disks clusters

Performance evaluation of real-time transaction processing a...

引用

International Conference on Parallel and Distributed Processing Techniques and Applications

作者： Lee, S Ohn, K Cho, H Yeungnam Univ Dept Comp Engn Kyongsan 712749 South Korea

ISBN: (纸本)1932415262

A real-time database system (RTDBS) must not only preserve the consistency of concurrent transactions but also meet their deadlines. This means that the RTDBS needs deadline conscious transaction processing algorithms. Moreover, the growth of real-time transaction processing applications makes the high performance RTDBS develop. Although a lot of studies indicate that a shared disks (SD) cluster is suitable to develop the high performance transaction processing system, it cannot guarantee whether the SD cluster is applicable to a real-time transaction processing. In this paper, we investigate the cross effect of real-time transaction processing algorithms and SD cluster algorithms to develop a real-time database system in SD clusters (SD-RTDBS). We analyze the aggregate performance of each algorithm suggested in the real-time transaction processing and the SD cluster by various experiments using the SD-RTDBS simulation model.

关键词： real-time cluster computing shared disks transaction processing performance evaluation

来源：评论

学校读者我要写书评

暂无评论

DB2's use of the coupling facility for data sharing

引用

IBM SYSTEMS JOURNAL 1997年第2期36卷 327-351页

作者： Josten, JW Mohan, C Narang, I Teng, JZ IBM CORP ALMADEN RES CTR SAN JOSE CA 95120 USA

We examine the problems encountered in extending DATABASE 2(TM) (DB2(R)) for Multiple Virtual Storage/Enterprise Systems Architecture (MVS/ESA(TM)), also called DB2 for OS/390(TM), an industrial-strength relational database management system originally designed for a single-system environment, to support the multisystem shared-data architecture. The multisystem data sharing function was delivered in DB2 Version 4. DB2 data sharing requires a System/390(R) Parallel Sysplex(TM) environment because DB2's use of the coupling facility technology plays a central role in delivering highly efficient and scalable data sharing functions. We call this the shared-data architecture because the coupling facility is a unique feature that it employs.

关键词： .portion data sharing DBMS coupling facility single-system multisystem Sysplex SDa architecture bufferpool shared disks buffer pool

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：