发布求助
文献互助 智能选刊 最新文献

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.最新文献

筛选
英文 中文
Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm 并行分支定界算法的分层主工模式分布式计算
CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199364
K. Aida, Wataru Natsume, Y. Futakata
{"title":"Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm","authors":"K. Aida, Wataru Natsume, Y. Futakata","doi":"10.1109/CCGRID.2003.1199364","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199364","url":null,"abstract":"This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and bound algorithm on a distributed computing system. The application program, which this paper addresses, solves the BMI Eigenvalue Problem, which is an optimization problem to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel branch and bound algorithm to solve the BMI Eigenvalue Problem with the hierarchical master-worker paradigm. The experimental results showed that the conventional algorithm with the master-worker paradigm significantly degraded performance on a Grid test bed, where computing resources were distributed on WAN via a firewall; however, the hierarchical master-worker paradigm sustained good performance.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129611844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 77
A gaming framework for a transactional DSM system 事务性DSM系统的博弈框架
CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199407
M. Schöttner, M. Wende, R. Göckelmann, T. Bindhammer, U. Schmid, P. Schulthess
{"title":"A gaming framework for a transactional DSM system","authors":"M. Schöttner, M. Wende, R. Göckelmann, T. Bindhammer, U. Schmid, P. Schulthess","doi":"10.1109/CCGRID.2003.1199407","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199407","url":null,"abstract":"State-of-the-art middleware like .NET or J2EE offers transparent access to distributed objects and services but lack support for consistency between groups of objects. Distributed Shared Memory (DSM) is an interesting alternative to build distributed applications because it maintains consistency among object groups. Although DSM has been used in the past only for special number crunching programs we expect it to be a good foundation to simplify the development of multi-player games and virtual reality applications. In this paper we present the relevant parts of our transactional DSM operating system (OS). Subsequently, we describe the gaming framework built on top of the DSM system. Finally we evaluate the framework with a sample game.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123320393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
A tree model for structured peer-to-peer protocols 结构化点对点协议的树模型
CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199385
Hung-Chang Hsiao, C. King
{"title":"A tree model for structured peer-to-peer protocols","authors":"Hung-Chang Hsiao, C. King","doi":"10.1109/CCGRID.2003.1199385","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199385","url":null,"abstract":"Peer-to-Peer (P2P) systems are emerging Internet applications that exploit the resources distributed in the network edges. The resources are aggregated through ad hoc communication among the participating peers, instead of being provided from the centralized servers. The distributed nature of P2P systems avoids performance bottleneck, single points of failure, and censorship of centralized servers. P2P systems also accommodate dynamics in the network and exploit unused resources. P2P systems can generally be classified into unstructured and structured systems. In this paper, we focus on structured P2P systems and review some well-known systems. Their essential features are abstracted, which leads to a tree model to characterize a major family of structured P2P systems.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124346057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Explore the "Small world phenomena" in pure P2P information sharing systems 探讨纯P2P信息共享系统中的“小世界现象”
CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199373
Yi Ren, Chaofeng Sha, Weining Qian, Aoying Zhou, B. Ooi, K. Tan
{"title":"Explore the \"Small world phenomena\" in pure P2P information sharing systems","authors":"Yi Ren, Chaofeng Sha, Weining Qian, Aoying Zhou, B. Ooi, K. Tan","doi":"10.1109/CCGRID.2003.1199373","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199373","url":null,"abstract":"Pure Peer-to-peer architecture is becoming an important model for information sharing among dynamic groups of users with its low cost of entry and its natural model for resource scaling with the community size. Recent studies on several pure P2P information-sharing systems have posed new questions and challenges in this area. By identifying two key factors in such an environment, we propose a new heuristic search algorithm to make better use of the \"small world phenomena\" among the peers in order to find the \"six degrees of separation\" more efficiently. We show by experiment that our heuristic algorithm out-performs the traditional BFS algorithm with an over 10% performance-increase when querying related information, and a 20% increase when a shift of interest lakes place. The heuristic algorithm also has a better control over the number of node-to-visit using our Node-Count feature than the existing TTL mechanism.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121893823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信