Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)最新文献

筛选
英文 中文
IPMI-based Efficient Notification Framework for Large Scale Cluster Computing 基于ipmi的大规模集群计算高效通知框架
C. Leangsuksun, T. Rao, Anand Tikotekar, S. Scott, Richard Libby, J. Vetter, Yung-Chin Fang, H. Ong
{"title":"IPMI-based Efficient Notification Framework for Large Scale Cluster Computing","authors":"C. Leangsuksun, T. Rao, Anand Tikotekar, S. Scott, Richard Libby, J. Vetter, Yung-Chin Fang, H. Ong","doi":"10.1109/CCGRID.2006.150","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.150","url":null,"abstract":"The demand for an efficient faith tolerance system has led to the development of complex monitoring infrastructure, which in turn has created an overwhelming task of data and event management. The increasing level of details at the hardware and software layer clearly affects the scalability and performance of monitoring and management tools. In this paper, we propose a problem notification framework that directly addresses the issue of monitor scalability. We first present the design and implementation of our step-by-step approach to analyzing, filtering, and classifying the plethora of node statistics. Then, we present experimental results to show that our approach only needs minimal system resource and thus has low overhead. Finally, we introduce our Web-based cluster management system that provides hardware controls at both cluster and nodal levels","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"41 S1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131549194","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
Applying Trust Mechanisms in an agent-based P2P Network of Service Providers and Requestors 基于代理的P2P服务提供者和请求者网络信任机制的应用
Electra Tamani, P. Evripidou
{"title":"Applying Trust Mechanisms in an agent-based P2P Network of Service Providers and Requestors","authors":"Electra Tamani, P. Evripidou","doi":"10.1109/CCGRID.2006.123","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.123","url":null,"abstract":"Building an agent-based network of service providers and requestors requires the effective management of the interactions among peers. These interactions, as in real life, require the mutual trust of the peers participating in a negotiation process. Trust quantification is a complex process that involves many parameters. Applying trust mechanisms in a P2P network is essential for guarantee the trustworthiness of participating peers and eventually the success of the negotiation. In this paper, we propose an agent-based community-centric P2P organization of service providers, clients and intermediaries that effectively and securely collaborate with each other, by considering common context in their negotiations, to discover trustworthy request-relevant services. The paper defines the formalisms for: 1) the roles of peers, and 2) the trust model which considers peers' reputation and secure message exchanges","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131375657","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}
引用次数: 5
Improving a Local Learning Technique for QueueWait Time Predictions 改进队列等待时间预测的局部学习技术
Hui Li, Juan Chen, Ying Tao, D. Groep, L. Wolters
{"title":"Improving a Local Learning Technique for QueueWait Time Predictions","authors":"Hui Li, Juan Chen, Ying Tao, D. Groep, L. Wolters","doi":"10.1109/CCGRID.2006.57","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.57","url":null,"abstract":"Local learning has been proposed as a common framework to predict both application run times and queue wait times based on workload traces [8]. The queue wait time is shown to be more difficult and expensive to predict because its distance calculations typically involve not only job attributes but also resource states. In this paper methods and algorithms are investigated to improve prediction accuracy and prediction performance for queue wait times. Firstly, the so-called \"local tuning\" is adopted to tune parameters for each training subset divided by a pivot attribute (e.g., group or queue name). Bias-variance analysis of error is conducted on local tuning and its global counterparts - tuning parameters on the whole training set. A method is then developed to select tuning type adaptively based on the generalization error and bias-variance decomposition. Secondly, an efficient search tree structure called \"M-Tree\" is integrated into our algorithm to speed up k-nearest neighbor search. Experimental studies are conducted to evaluate the proposed methods and algorithms using real-world workload traces, which are collected from the NIKHEF production cluster on the LHC Computing Grid and Blue Horizon in the San Diego Supercomputer Center (SDSC). The results show that adaptive tuning can reduce the average prediction error by 3 to 10 percents compared to global tuning, and that the M-Tree nearest neighbor search is up to 8 times faster than the sequential search.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130630623","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}
引用次数: 42
Enabling Transparent Data Sharing in Component Models 在组件模型中启用透明数据共享
Gabriel Antoniu, Hinde-Lilia Bouziane, Landry Breuil, M. Jan, Christian Pérez
{"title":"Enabling Transparent Data Sharing in Component Models","authors":"Gabriel Antoniu, Hinde-Lilia Bouziane, Landry Breuil, M. Jan, Christian Pérez","doi":"10.1109/CCGRID.2006.40","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.40","url":null,"abstract":"The fast growth of high-bandwidth unde-area networks has encouraged the development of computational grids. To deal with the increasing complexity of grid applications, the software component technology seems very appealing since it emphasizes software composition and re-use. However, current software component models only support explicit data transfers between components. The distributed shared memory paradigm has demonstrated its utility by enabling a transparent access to data via a globally shared data space. This paper proposes to extend software component models with shared memory capabilities, enabling tmnsparent access to shared data across components and leading to further decreased software complexity.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121681058","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}
引用次数: 15
Group-based dynamic computational replication mechanism in peer-to-peer grid computing 点对点网格计算中基于组的动态计算复制机制
SungJin Choi, MaengSoon Baik, Joon-Min Gil, Chan Yeol Park, S. Jung, C. Hwang
{"title":"Group-based dynamic computational replication mechanism in peer-to-peer grid computing","authors":"SungJin Choi, MaengSoon Baik, Joon-Min Gil, Chan Yeol Park, S. Jung, C. Hwang","doi":"10.1109/CCGRID.2006.142","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.142","url":null,"abstract":"A peer-to-peer grid computing is complicated by heterogeneous capabilities, failures, volatility, and lack of trust because it is based on desktop computers at the edge of the Internet. In order to improve the reliability of computation and gain better performance, a replication mechanism must adapt to these distinct features. In other words, it is required to classify volunteers into groups that have similar properties and then dynamically apply different replication algorithms to each group. However, existing mechanisms do not provide such a replication mechanism on a per group basis. As a result, they cause a high overhead and poor performance. To solve the problems, we propose a new group-based computational replication mechanism to adapt to an unstable, untrusted, dynamic peer-to-peer grid computing environment. Our mechanism can reduce the number of redundancy and therefore complete many tasks by adaptively replicating computations on the basis of the properties of volunteer group such as availability, credibility, and volunteering service time","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114901743","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}
引用次数: 26
Solving the Protein Folding Problem with a Bicriterion Genetic Algorithm on the Grid 用双准则遗传算法求解网格上的蛋白质折叠问题
Alexandru-Adrian Tantar, N. Melab, E. Talbi, B. Toursel
{"title":"Solving the Protein Folding Problem with a Bicriterion Genetic Algorithm on the Grid","authors":"Alexandru-Adrian Tantar, N. Melab, E. Talbi, B. Toursel","doi":"10.1109/CCGRID.2006.172","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.172","url":null,"abstract":"The exploration of potential multidimensional surfaces in protein folding is a non-trivial problem of extreme importance in computational biology. An evolutionary bicriterion grid-enabled protein folding approach is reported, classical molecular mechanics equations being employed for modeling inter-atomic interactions. Afferent computations were distributed on a nation-wide grid - GRID5000. A layered software design composed of dedicated frameworks is adopted due to the highly complex aspects inherent for the underlying volatile and dynamic execution environment. A brief insight on the existing approaches and the mathematical basis describing physical molecular interactions is offered, including derived semi-empirical and purely-empirical models. Introductory multicriterion formalisms enclosing the exposed approach are also presented","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121626908","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
Scalable Grid Application Scheduling via Decoupled Resource Selection and Scheduling 通过解耦资源选择和调度的可伸缩网格应用程序调度
Yang Zhang, A. Mandal, H. Casanova, A. Chien, Yang-Suk Kee, K. Kennedy, C. Koelbel
{"title":"Scalable Grid Application Scheduling via Decoupled Resource Selection and Scheduling","authors":"Yang Zhang, A. Mandal, H. Casanova, A. Chien, Yang-Suk Kee, K. Kennedy, C. Koelbel","doi":"10.1109/CCGRID.2006.89","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.89","url":null,"abstract":"Over the past years grid infrastructures have been deployed at larger and larger scales, with envisioned deployments incorporating tens of thousands of resources. Therefore, application scheduling algorithms can become unscalable (albeit polynomial) and thus unusable in large-scale environments. One reason for unscalability is that these algorithms perform implicit resource selection. One can achieve better scalability by performing explicit resource selection independently from scheduling in a \"decoupled' approach. Furthermore, we hypothesize that one can achieve similar or even better performance as with the non-decoupled approach, which we call the \"one step\" approach, by selecting resources judiciously. Leveraging the Virtual Grid abstraction, we demonstrate that the decoupled approach is indeed both scalable and effective in large-scale and highly heterogeneous resource environments.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115077043","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}
引用次数: 30
A relaxed-criteria bargaining protocol for grid resource management 一种网格资源管理的放宽标准议价协议
K. Sim, Ka Fung Ng
{"title":"A relaxed-criteria bargaining protocol for grid resource management","authors":"K. Sim, Ka Fung Ng","doi":"10.1109/CCGRID.2006.113","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.113","url":null,"abstract":"Since participants in a computational grid may be independent bodies, some mechanisms are necessary for resolving their differences. The contribution of this work is designing a bargaining protocol for agents representing grid participants in negotiating for computational resources. The protocol in this work discerns from existing protocols because agents in this work are programmed to follow a set of fuzzy rules for relaxing bargaining terms with the hope of increasing their chance of successfully acquiring resources before their deadlines. This relaxed-criteria bargaining protocol and an agent-based testbed for simulating grid resource allocation were implemented in Java 1.5. A series of simulations was carried out using the testbed, and favorable (preliminary) empirical results show that following the relaxed-criteria bargaining protocol, agents achieved higher success rates in negotiating for resources","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124747258","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}
引用次数: 24
A portable grid infrastructure for resource-aware applications 用于资源感知应用程序的便携式网格基础设施
Michal Wegiel, G. Czajkowski, L. Daynès, K. Palacz
{"title":"A portable grid infrastructure for resource-aware applications","authors":"Michal Wegiel, G. Czajkowski, L. Daynès, K. Palacz","doi":"10.1109/CCGRID.2006.7","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.7","url":null,"abstract":"Modern, resource-intensive enterprise and scientific applications are increasingly architected using parallel and distributed components deployed on grid platforms. Grid environments are typically heterogeneous and subject to large load variations. Such characteristics require a portable programming infrastructure and comprehensive support for resource management as well as dynamic adaptation to varying resource availability. Resource-aware applications pro-actively monitor and dynamically adapt their behavior to accommodate to changing resource consumption constraints. Strategies such as internal load-balancing and job re-submission can correct sub-optimal scheduling decisions and thus enhance performance. As utilizing the potential of resource awareness requires close interaction with resource management subsystems, implementations often rely on low-level, platform-specific features, which impair portability. What is needed is uncompromised portability of all aspects of resource management in grid systems. We demonstrate that the Java platform, equipped with the APIs for distributed resource management, can be used for building a portable grid infrastructure. In particular, we describe the design and implementation of a cluster management system capable of controlled execution of parallel, resource-aware Java applications. We empirically show that our solution allows for efficient, fine-grained resource management, sufficient for tapping the performance benefits promised by the resource-conscious applications.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130093080","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}
引用次数: 1
Supporting the collaborative construction of learning objects using the grid 支持使用网格协同构建学习对象
M. Rosatelli, H. Senger, Fabrício A. B. Silva, S. Stanzani, Cesar Nunes
{"title":"Supporting the collaborative construction of learning objects using the grid","authors":"M. Rosatelli, H. Senger, Fabrício A. B. Silva, S. Stanzani, Cesar Nunes","doi":"10.1109/CCGRID.2006.100","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.100","url":null,"abstract":"This paper presents the collaborative construction of learning objects (LOs) supported by grid services. The needs of the different users (e.g. teachers, designers, and developers) are taken into account to analyse the cycle of LOs production. The analysis identifies the functionalities that should be made available and the services that enable a grid platform to support the collaboration among these users. The grid infrastructure and respective set of services provide uniform access to distributed and heterogeneous resources for geographically dispersed users in the collaborative construction of LOs. The proposed infrastructure is implemented in a prototype.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127681773","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}
引用次数: 3
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学术官方微信