Using available remote memory dynamically for parallel data mining application on ATM-connected PC cluster

M. Oguchi, M. Kitsuregawa
{"title":"Using available remote memory dynamically for parallel data mining application on ATM-connected PC cluster","authors":"M. Oguchi, M. Kitsuregawa","doi":"10.1109/IPDPS.2000.846014","DOIUrl":null,"url":null,"abstract":"Personal computer/Workstation (PC/WS) clusters are promising candidates for future high performance computers, because of their good scalability and cost performance ratio. Data intensive applications, such as data mining and ad hoc query processing in databases, are considered very important for massively parallel processors, as well as conventional scientific calculations. Thus, investigating the feasibility of data intensive applications on a PC cluster is meaningful. Association rule mining, one of the best-known problems in data mining, differs from conventional scientific calculations in its usage of main memory. It allocates many small data areas in main memory, and the number of those areas suddenly grows enormously during execution. As a result, the contents of memory must be swapped out if the requirement for memory space exceeds the real memory size. However, because the size of each data area is rather small and the elements are accessed almost at random, swapping out to a storage device must degrade the performance severely. In this paper, we investigate the feasibility of using available remote nodes' memory as a swap area when application execution nodes need to swap out their real memory contents during the execution of parallel data mining on PC clusters. We report our experiments in which application execution nodes acquire extra memory dynamically from several available remote nodes through an ATM network. A method of remote memory utilization with remote update operations is proposed and evaluated. The experimental results on our PC cluster show that the proposed method is expected to be considerably better than using hard disks as a swapping device. The dynamic decision mechanism for remote memory availability and the migration operations are also evaluated.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPS.2000.846014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Personal computer/Workstation (PC/WS) clusters are promising candidates for future high performance computers, because of their good scalability and cost performance ratio. Data intensive applications, such as data mining and ad hoc query processing in databases, are considered very important for massively parallel processors, as well as conventional scientific calculations. Thus, investigating the feasibility of data intensive applications on a PC cluster is meaningful. Association rule mining, one of the best-known problems in data mining, differs from conventional scientific calculations in its usage of main memory. It allocates many small data areas in main memory, and the number of those areas suddenly grows enormously during execution. As a result, the contents of memory must be swapped out if the requirement for memory space exceeds the real memory size. However, because the size of each data area is rather small and the elements are accessed almost at random, swapping out to a storage device must degrade the performance severely. In this paper, we investigate the feasibility of using available remote nodes' memory as a swap area when application execution nodes need to swap out their real memory contents during the execution of parallel data mining on PC clusters. We report our experiments in which application execution nodes acquire extra memory dynamically from several available remote nodes through an ATM network. A method of remote memory utilization with remote update operations is proposed and evaluated. The experimental results on our PC cluster show that the proposed method is expected to be considerably better than using hard disks as a swapping device. The dynamic decision mechanism for remote memory availability and the migration operations are also evaluated.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
动态利用可用的远程内存实现连接atm的PC集群上的并行数据挖掘
个人计算机/工作站(PC/WS)集群具有良好的可扩展性和性价比,是未来高性能计算机的理想选择。数据密集型应用程序,例如数据库中的数据挖掘和临时查询处理,对于大规模并行处理器以及传统的科学计算来说非常重要。因此,研究数据密集型应用在PC集群上的可行性是有意义的。关联规则挖掘是数据挖掘中最著名的问题之一,它与传统的科学计算在使用主存方面的不同。它在主存中分配了许多小的数据区域,并且这些区域的数量在执行期间突然急剧增长。因此,如果对内存空间的需求超过了实际内存大小,就必须将内存的内容交换出来。但是,由于每个数据区域的大小相当小,并且几乎是随机访问元素,因此换出到存储设备必须严重降低性能。在本文中,我们研究了当应用程序执行节点在PC集群上执行并行数据挖掘时需要交换其实际内存内容时,使用可用的远程节点内存作为交换区域的可行性。我们报告了我们的实验,其中应用程序执行节点通过ATM网络从几个可用的远程节点动态获取额外内存。提出并评估了一种具有远程更新操作的远程内存利用方法。在我们的PC集群上的实验结果表明,所提出的方法比使用硬盘作为交换设备要好得多。对远程内存可用性和迁移操作的动态决策机制进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Predicting performance on SMPs. A case study: the SGI Power Challenge An optimal parallel algorithm for computing moments on arrays with reconfigurable optical buses Parallel performance study of Monte Carlo photon transport code on shared-, distributed-, and distributed-shared-memory architectures Replicating the contents of a WWW multimedia repository to minimize download time Efficiency of dynamic load balancing based on permanent cells for parallel molecular dynamics simulation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1