2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid最新文献

Runtime Estimations, Reputation and Elections for Top Performing Distributed Query Scheduling 分布式查询调度的运行时估计、声誉和选举

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.34

Rogério Luís de Carvalho Costa, P. Furtado

{"title":"Runtime Estimations, Reputation and Elections for Top Performing Distributed Query Scheduling","authors":"Rogério Luís de Carvalho Costa, P. Furtado","doi":"10.1109/CCGRID.2009.34","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.34","url":null,"abstract":"In the last few years, highly distributed, heterogeneous and dynamic environments have become usual contexts for scientific and business domains. In this work, we consider query scheduling over a grid-enabled distributed database, where the data may be partially or totally replicated into the component sites. Although there have been some previous proposals for query scheduling in distributed databases, they did not consider site reputation, which is important in autonomous and heterogeneous distributed systems. We propose a reputation-based election-inspired query scheduling strategy. Sites are autonomous concerning candidacy for answering queries, in which case they must report an expected response time commitment to those queries. A reputation system is used for ranking sites on their response time estimations. Commitment information and subsequent outcome allows the reputation-based election-inspired approach to improve the overall mean response time of the system. We compare it experimentally with other distributed schedulers to show that the use of reputation and elections improves performance in heterogeneous autonomous environments.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128997330","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

Towards a Cluster Based Incentive Mechanism for P2P Networks 基于集群的P2P网络激励机制研究

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.92

Kan Zhang, N. Antonopoulos

引用次数: 9

Domain-Specific Groupware Environment for E-research on Chemistry 面向化学电子研究领域的群件环境

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.45

Dongmei Yue, Ruisheng Zhang, Chen Zhao, Ruipeng Wei, Lian Li

引用次数: 0

Automating Malware Scanning Using Workflows 使用工作流自动化恶意软件扫描

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.90

D. Stirling, I. Welch, P. Komisarczuk, C. Seifert

引用次数: 0

EnVision: A Web-Based Tool for Scientific Visualization EnVision:一个基于网络的科学可视化工具

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.80

Gregory P. Johnson, S. Mock, Brandt M. Westing, Gregory S. Johnson

引用次数: 10

Improving Parallel Write by Node-Level Request Scheduling 通过节点级请求调度改进并行写

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.71

Kazuki Ohta, Hiroya Matsuba, Y. Ishikawa

{"title":"Improving Parallel Write by Node-Level Request Scheduling","authors":"Kazuki Ohta, Hiroya Matsuba, Y. Ishikawa","doi":"10.1109/CCGRID.2009.71","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.71","url":null,"abstract":"In a cluster of multiple processors or cpu-cores, many processes may run on each compute node. Each process tends to issue contiguous I/O requests for snapshot, checkpointing or so, however, if large number of processes enter the I/O phase at the same time, the requests from the same process may be interrupted by the requests of other processes. Then, the I/O nodes receive these requests as non-contiguous way. This interleaved access pattern causes performance degradation in parallel file systems. In order to overcome the problem, we have designed the Gather-Arrange-Scatter (GAS) I/O architecture, for optimizing the parallel write performance. The GAS is an architecture for capturing write operations, buffering them in the memory, and scheduling them to reduce I/O cost at I/O nodes. The scheduling is done per compute node, and the requests are sent to the remote disks in parallel. In this paper, after introducing the GAS architecture in detail, its efficiency and scalability are evaluated using the NAS Parallel Benchmark BTIO. GAS is 5.2%faster than ROMIO collective I/O on PVFS2 in BTIO with 16 nodes/64 processes, and 34.9% faster than MPI noncollective I/O in the same configuration.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124637169","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

Distributed Collaborative Visualization Using Light Field Rendering 使用光场渲染的分布式协同可视化

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.79

Asma Al-Saidi, N. J. Avis, I. Grimstead, O. Rana

引用次数: 7

A Hybrid Intelligent Method for Performance Modeling and Prediction of Workflow Activities in Grids 网格中工作流活动性能建模与预测的混合智能方法

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.58

Rubing Duan, F. Nadeem, Jie Wang, Yun Zhang, R. Prodan, T. Fahringer

{"title":"A Hybrid Intelligent Method for Performance Modeling and Prediction of Workflow Activities in Grids","authors":"Rubing Duan, F. Nadeem, Jie Wang, Yun Zhang, R. Prodan, T. Fahringer","doi":"10.1109/CCGRID.2009.58","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.58","url":null,"abstract":"Grid schedulers require individual activity performance predictions to map workflow activities on different Grid sites. The effectiveness of the scheduling systems is hampered by inaccurate predictions due to the inability of existing predictors to effectively model the dynamic and heterogeneous nature of Grid resources, or the wide range of problem sizes and runtime arguments. To address this deficiency, we propose a hybrid Bayesian-neural network approach to dynamically model and predict the execution time of activities in real workflow applications. Bayesian network is used for a high-level representation of activities performance probability distribution against different factors affecting the performance. The important attributes are dynamically selected by the Bayesian network and fed into a radial basis function neural network to make further predictions. Our approach is generic to any type of scientific applications, and flexible to import expert knowledge to further improve accuracies. Experimental results for activities from three realworld workflow applications are presented to show effectivenessof our approach.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124849728","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}

引用次数: 57

Memory-Mapped File Approach for On-Demand Data Co-allocation on Grids 网格上按需数据协同分配的内存映射文件方法

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.22

P. Chen, Jyh-Biau Chang, Yi-Chang Zhuang, C. Shieh, Tyng-Yeu Liang

{"title":"Memory-Mapped File Approach for On-Demand Data Co-allocation on Grids","authors":"P. Chen, Jyh-Biau Chang, Yi-Chang Zhuang, C. Shieh, Tyng-Yeu Liang","doi":"10.1109/CCGRID.2009.22","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.22","url":null,"abstract":"Grid data sharing systems usually provide a data-intensive application with either a pre-staging mechanism or an on-demand access mechanism to access shared data. Pre-staging systems simultaneously download an entire shared file from multiple data sources even when only a tiny file fragment is required. Such systems consume unnecessary data transmission time and storage space. On-demand access systems, on the other hand, download only the required fragments from a single data source. Such systems unfortunately do not fully exploit available network bandwidth. This paper presents a data sharing system, designated as the On-Demand data Co-Allocation (ODCA). ODCA facilitates an unmodified legacy applications to transparently access shared data by using native I/O system calls. ODCA transfers only the necessary fragments on user demand, thereby reducing data transmission time, avoiding wasted network bandwidth and wasted storage space. Moreover, ODCA reduces data waiting time by downloading the file fragments from multiple data sources. Experimental results show ODCA successfully reduces turnaround time in data-intensive applications.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131972267","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

An E-infrastructure to Support Collaborative Embryo Research 支持协同胚胎研究的电子基础设施

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.78

A. Barker, Jano van Hemert, R. Baldock, M. Atkinson

引用次数: 3