2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing最新文献_第8页

Overview of Medical Data Management Solutions for Research Communities 研究社区医疗数据管理解决方案概述

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.55

S. Camarasu-Pop, F. Cervenansky, Yonny Cardenas, Jean-Yves Nief, H. Benoit-Cattin

引用次数: 4

Team-Based Message Logging: Preliminary Results 基于团队的消息记录:初步结果

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.110

Esteban Meneses, C. Mendes, L. Kalé

{"title":"Team-Based Message Logging: Preliminary Results","authors":"Esteban Meneses, C. Mendes, L. Kalé","doi":"10.1109/CCGRID.2010.110","DOIUrl":"https://doi.org/10.1109/CCGRID.2010.110","url":null,"abstract":"Fault tolerance will be a fundamental imperative in the next decade as machines containing hundreds of thousands of cores will be installed at various locations. In this context, the traditional checkpoint/restart model does not seem to be a suitable option, since it makes all the processors roll back to their latest checkpoint in case of a single failure in one of the processors. In-memory message logging is an alternative that avoids this global restoration process and instead replays the messages to the failed processor. However, there is a large memory overhead associated with message logging because each message must be logged so it can be played back if a failure occurs. In this paper, we introduce a technique to alleviate the demand of memory in message logging by grouping processors into teams. These teams act as a failure unit: if one team member fails, all the other members in that team roll back to their latest checkpoint and start the recovery process. This eliminates the need to log message contents within teams. The savings in memory produced by this approach depend on the characteristics of the application, the number of messages sent per computation unit and size of those messages. We present promising results for multiple benchmarks. As an example, the NPB-CG code running class D on 512 cores manages to reduce the memory overhead of message logging by 62%.","PeriodicalId":444485,"journal":{"name":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116444139","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}

引用次数: 39

Dynamic Job-Clustering with Different Computing Priorities for Computational Resource Allocation 不同计算优先级的动态作业聚类计算资源分配

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.119

M. Hussin, Young Choon Lee, Albert Y. Zomaya

引用次数: 6

Generalized Spot-Checking for Sabotage-Tolerance in Volunteer Computing Systems 志愿计算系统中破坏容忍度的广义抽查

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.97

Kanno Watanabe, Masaru Fukushi

{"title":"Generalized Spot-Checking for Sabotage-Tolerance in Volunteer Computing Systems","authors":"Kanno Watanabe, Masaru Fukushi","doi":"10.1109/CCGRID.2010.97","DOIUrl":"https://doi.org/10.1109/CCGRID.2010.97","url":null,"abstract":"While volunteer computing (VC) systems reach the most powerful computing platforms, they still have the problem of guaranteeing computational correctness, due to the inherent unreliability of volunteer participants. Spot-checking technique, which checks each participant by allocating spotter jobs, is a promising approach to the validation of computation results. The current spot-checking technique and associated sabotage-tolerance methods are based on the implicit assumption that participants never detect the allocation of spotter jobs, however generating such spotter jobs is still an open problem. Hence, in the real VC environment where the implicit assumption does not always hold, spot-checking-based sabotage-tolerance methods (such as well-known credibility-based voting) become almost impossible to guarantee the computational correctness. In this paper, we generalize the spot-checking technique by introducing the idea of imperfect checking. Using our new technique, it becomes possible to estimate the correct credibility for participant nodes even if they may detect spotter jobs. Moreover, by the idea of imperfect checking, we propose a new credibility-based voting which does not need to allocate spotter jobs. Simulation results show that the proposed method reduces the computation time compared to the original credibility-based voting, while guaranteeing the same level of computational correctness.","PeriodicalId":444485,"journal":{"name":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","volume":"414 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132413779","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}

引用次数: 8

Programming Challenges for the Implementation of Numerical Quadrature in Atomic Physics on FPGA and GPU Accelerators 在FPGA和GPU加速器上实现原子物理数值正交的编程挑战

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.30

C. Gillan, T. Steinke, J. Bock, S. Borchert, I. Spence, N. Scott

引用次数: 3

Gridifying a Diffusion Tensor Imaging Analysis Pipeline 扩散张量成像分析管道的网格化

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.99

M. Caan, F. Vos, A. V. Kampen, S. Olabarriaga, L. Vliet

引用次数: 8

Towards Trust in Desktop Grid Systems 迈向桌面网格系统中的信任

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.73

Yvonne Bernard, Lukas Klejnowski, J. Hähner, C. Müller-Schloer

{"title":"Towards Trust in Desktop Grid Systems","authors":"Yvonne Bernard, Lukas Klejnowski, J. Hähner, C. Müller-Schloer","doi":"10.1109/CCGRID.2010.73","DOIUrl":"https://doi.org/10.1109/CCGRID.2010.73","url":null,"abstract":"The Organic Computing (OC) Initiative deals with technical systems, that consist of a large number of distributed and highly interconnected subsystems. In such systems, it is impossible for a designer to foresee all possible system configurations and to plan an appropriate system behaviour completely at design time. The aim is to endow such technical systems with the so-called self-X properties, such as self-organisation, self-configuration or self-healing. In such dynamic systems, trust is an important prerequisite to enable the usage of Organic Computing systems and algorithms in market-ready products in the future. The OC-Trust project aims at introducing trust mechanisms to improve and assure the interoperability of subsystems. In this paper, we deal with aspects of organic systems regarding trustworthiness on the subsystem level (agents) in a desktop grid system. We develop an agent-based simulation of a desktop grid to show, that the introduction of trust concepts improves the system's performance, in such that they speed up the processes on the agent level. Specifically, we investigate a bottom-up self-organised development of trust structures that create coalition groups of agents that work more efficiently than standard algorithms. Here, an agent can determine individually to what extent it belongs to a Trusted Community.","PeriodicalId":444485,"journal":{"name":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133664961","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}

引用次数: 37

Decentralized Resource Availability Prediction for a Desktop Grid 桌面网格的分散式资源可用性预测

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.54

Karthick Ramachandran, H. Lutfiyya, M. Perry

引用次数: 9

Framework for Efficient Indexing and Searching of Scientific Metadata 科学元数据高效索引与检索框架

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.120

Chaitali Gupta, M. Govindaraju

{"title":"Framework for Efficient Indexing and Searching of Scientific Metadata","authors":"Chaitali Gupta, M. Govindaraju","doi":"10.1109/CCGRID.2010.120","DOIUrl":"https://doi.org/10.1109/CCGRID.2010.120","url":null,"abstract":"A seamless and intuitive data reduction capability for the vast amount of scientific metadata generated by experiments is critical to ensure effective use of the data by domain specific scientists. The portal environments and scientific gateways currently used by scientists provide search capability that is limited to the pre-defined pull-down menus and conditions set in the portal interface. Currently, data reduction can only be effectively achieved by scientists who have developed expertise in dealing with complex and disparate query languages. A common theme in our discussions with scientists is that data reduction capability, similar to web search in terms of ease-of-use, scalability, and freshness/accuracy of results, is a critical need that can greatly enhance the productivity and quality of scientific research. Most existing search tools are designed for exact string matching, but such matches are highly unlikely given the nature of metadata produced by instruments and a user’s inability to recall exact numbers to search in very large datasets. This paper presents research to locate metadata of interest within a range of values. To meet this goal, we leverage the use of XML in metadata description for scientific datasets, specifically the NeXus datasets generated by the SNS scientists. We have designed a scalable indexing structure for processing data reduction queries. Web semantics and ontology based methodologies are also employed to provide an elegant, intuitive, and powerful free-form query based data reduction interface to end users.","PeriodicalId":444485,"journal":{"name":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132042546","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}

引用次数: 2

Representing Eager Evaluation in a Demand Driven Model of Streams on Cloud Infrastructure 在云基础设施流的需求驱动模型中表示急切评估

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.88

P. Martinaitis, A. Wendelborn

引用次数: 0