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

Analysis of query matching criteria and resource monitoring models for grid application scheduling 网格应用调度查询匹配标准及资源监控模型分析

Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) Pub Date : 2006-05-16 DOI: 10.1109/CCGRID.2006.18

Ronak Desai, S. Tilak, B. Gandhi, M. Lewis, N. Abu-Ghazaleh

{"title":"Analysis of query matching criteria and resource monitoring models for grid application scheduling","authors":"Ronak Desai, S. Tilak, B. Gandhi, M. Lewis, N. Abu-Ghazaleh","doi":"10.1109/CCGRID.2006.18","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.18","url":null,"abstract":"Making effective use of computational grids requires scheduling grid applications onto resources that best match them. Resource-related state (e.g., load, availability, and location), and demand-related state (number and distribution of application resource requests) influences scheduling decision success. The scale of the grid makes collecting and maintaining detailed up-to-date state information for all resources and requests impractical. Thus, concurrent distributed schedulers must make scheduling decisions based on incomplete resource state information. In this paper, we evaluate the effect that the criteria for selecting scheduling matches have on the success of scheduling decisions. We focus on three criteria: information freshness, resource distance from requesters, and past behavior. We evaluate the quality of the schedule for various resource monitoring models, grid load models, and grid overlay topologies. Among our findings is the counter-intuitive result that favoring freshness can sometimes harm overall system performance; a combination of resource distance and past scheduling success performs best. We also evaluate a pure resource state pull model with caching, and discover that pro-actively pushing dynamic state information to schedulers is beneficial.","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":"130391405","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}

引用次数: 16

Evaluating Performance and Scalability of Advanced Accelerator Simulations 高级加速器仿真的性能和可扩展性评估

Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) Pub Date : 2006-05-16 DOI: 10.1109/CCGRID.2006.42

Jungmin Lee, Z. Lan, J. Amundson, P. Spentzouris

{"title":"Evaluating Performance and Scalability of Advanced Accelerator Simulations","authors":"Jungmin Lee, Z. Lan, J. Amundson, P. Spentzouris","doi":"10.1109/CCGRID.2006.42","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.42","url":null,"abstract":"Advanced accelerator simulations have played a prominent role in the design and analysis of modern accelerators. Given that accelerator simulations are computational intensive and various high-end clusters are available for such simulations, it is imperative to study the performance and scalability of accelerator simulations on different production systems. In this paper, we examine the performance and scaling behavior of a DOE SciDAC funded accelerator simulation package called Synergia on three different TOP500 clusters including an IA32 Linux Cluster, an IA64 Linux Cluster, and a SGI Altix 3700 system. The main objective is to understand the impact of different high-end architectures and message layers on the performance of accelerator simulations. Experiments show that IA32 using single-CPU can provide the best performance and scalability, while SGI Altix and IA32 using dual-CPU do not scale past 128 and 256 CPUs respectively. Our analysis also indicates that the existing accelerator simulations have several performance bottlenecks which prevent accelerator simulations to take full advantage of the capabilities provided by teraflop and beyond systems.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"370 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":"116618885","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}

引用次数: 0

Calder query grid service: insights and experimental evaluation 考尔德查询网格服务:见解与实验评价

Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) Pub Date : 2006-05-16 DOI: 10.1109/CCGRID.2006.25

N. Vijayakumar, Y. Liu, Beth Plale

引用次数: 15

PACS-CS: a large-scale bandwidth-aware PC cluster for scientific computation PACS-CS:用于科学计算的大规模带宽感知PC集群

Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) Pub Date : 2006-05-16 DOI: 10.1109/CCGRID.2006.78

T. Boku, M. Sato, A. Ukawa, D. Takahashi, S. Sumimoto, K. Kumon, Takashi Moriyama, M. Shimizu

{"title":"PACS-CS: a large-scale bandwidth-aware PC cluster for scientific computation","authors":"T. Boku, M. Sato, A. Ukawa, D. Takahashi, S. Sumimoto, K. Kumon, Takashi Moriyama, M. Shimizu","doi":"10.1109/CCGRID.2006.78","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.78","url":null,"abstract":"We have been developing a large scale PC cluster named PACS-CS (Parallel Array Computer System for Computational Sciences) at Center for Computational Sciences, University of Tsukuba, for wide variety of computational science applications such as computational physics, computational material science, computational biology, etc. We consider the most important issue on the computation node is the memory access bandwidth, then a node is equipped with a single CPU which is different from ordinary high-end PC clusters. The interconnection network for parallel processing is configured as a multi-dimensional hyper-crossbar network based on trunking of Gigabit Ethernet to support large scale scientific computation with physical space modeling. Based on the above concept, we are developing an original mother board to configure a single CPU node with 8 ports of Gigabit Ethernet, which can be implemented in the half size of 19 inch rack-mountable 1U size platform. Under the preliminary performance evaluation, we confirmed that the computation part in practical Lattice QCD code will be able to achieve 30% of peak performance, and up to 600 Mbyte/sec of bandwidth at single directed neighboring communication will be achieved. PACS-CS will start its operation on July 2006 with 2560 CPUs and 14.3 Tflops of peak performance.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"18 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":"123938783","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

Actor Provenance Capture With Ganglia 演员来源捕捉与神经节

Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) Pub Date : 2006-05-16 DOI: 10.1109/CCGRID.2006.1

Ian Wootten, Shrija Rajbhandari, O. Rana, J. S. Pahwa

引用次数: 7

Design of High Performance MVAPICH2: MPI2 over InfiniBand 基于ib的高性能MVAPICH2: MPI2的设计

Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) Pub Date : 2006-05-16 DOI: 10.1109/CCGRID.2006.32

Wei Huang, G. Santhanaraman, Hyun-Wook Jin, Qi Gao, D. Panda

引用次数: 79

QoS Oriented Resource Reservation in Shared Environments 面向QoS的共享环境资源预留

Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) Pub Date : 2006-05-16 DOI: 10.1109/CCGRID.2006.82

Ming Wu, Xian-He Sun, Yong Chen

引用次数: 23

MagCat: an agent-based metadata service for data grids MagCat:用于数据网格的基于代理的元数据服务

Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) Pub Date : 2006-05-16 DOI: 10.1109/CCGRID.2006.153

B. B. D. Sousa, F. Silva, M. Teixeira, G. C. Filho

引用次数: 5

Assessing Data Virtualization for Irregularly Replicated Large Datasets 评估不规则复制大数据集的数据虚拟化

Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) Pub Date : 2006-05-16 DOI: 10.1109/CCGRID.2006.21

Bruno Diniz, D. Nogueira, André Cardoso, R. Ferreira, Dorgival Olavo Guedes Neto, Wagner Meira Jr

{"title":"Assessing Data Virtualization for Irregularly Replicated Large Datasets","authors":"Bruno Diniz, D. Nogueira, André Cardoso, R. Ferreira, Dorgival Olavo Guedes Neto, Wagner Meira Jr","doi":"10.1109/CCGRID.2006.21","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.21","url":null,"abstract":"Large volumes of data are generated every day by experiments, simulations and all sorts of applications. It is common to observe situations where portions of data are irregularly replicated and distributed in different data sources. It would be desirable to be able to handle these several pieces of irregular data (replicated or not) as a unique large dataset. This is called data virtualization and is the focus of this paper. In this paper, we present a system which is capable of dealing with irregularly replicated data and is able to create a virtual view of the union of the individual irregular portions of data hosted by each data source. Our system indexes the data intervals from each data source and allows clients to submit queries against the virtual dataset created. In order to select what server will be responsible for each data interval of a query, we use and compare three algorithms, namely Random, Round-Robin and Weighted Round-Robin. The comparison is driven by simulation and the parameters for the simulation are all taken from a real data-centered application (the Virtual Microscope).","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"69 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":"126779798","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

Distribution of a world space for real-time 3D applications 实时3D应用的世界空间分布

Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) Pub Date : 2006-05-16 DOI: 10.1109/CCGRID.2006.35

David A. Heitbrink, S. Makki

引用次数: 0