Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)最新文献_第10页

A Parallel P2P Branch-and-Bound Algorithm for Computational Grids 计算网格的并行P2P分支定界算法

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.7

A. Bendjoudi, N. Melab, E. Talbi

引用次数: 7

Detecting, Managing and Querying Replicas and Versions in a Peer-to-Peer Environment 在对等环境中检测、管理和查询副本和版本

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.39

Deise de Brum Saccol, Nina Edelweiss, R. Galante

引用次数: 5

Reparallelization and Migration of OpenMP Programs OpenMP程序的再并行化和迁移

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.96

Michael Klemm, Matthias Bezold, Stefan Gabriel, R. Veldema, M. Philippsen

{"title":"Reparallelization and Migration of OpenMP Programs","authors":"Michael Klemm, Matthias Bezold, Stefan Gabriel, R. Veldema, M. Philippsen","doi":"10.1109/CCGRID.2007.96","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.96","url":null,"abstract":"Typical computational grid users target only a single cluster and have to estimate the runtime of their jobs. Job schedulers prefer short-running jobs to maintain a high system utilization. If the user underestimates the runtime, premature termination causes computation loss; overestimation is penalized by long queue times. As a solution, we present an automatic reparallelization and migration of OpenMP applications. A reparallelization is dynamically computed for an OpenMP work distribution when the number of CPUs changes. The application can be migrated between clusters when an allocated time slice is exceeded. Migration is based on a coordinated, heterogeneous checkpointing algorithm. Both reparallelization and migration enable the user to freely use computing time at more than a single point of the grid. Our demo applications successfully adapt to the changed CPU setting and smoothly migrate between, for example, clusters in Erlangen, Germany, and Amsterdam, the Netherlands, that use different processors. Benchmarks show that reparallelization and migration impose average overheads of about 4% and 2%.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134400541","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}

引用次数: 7

Specification-correct and Scalable Coordination of Scientific Applications in Grid Environments 网格环境中科学应用规范正确和可扩展的协调

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.108

R. Prodan

引用次数: 4

Reliability Analysis of Self-Healing Network using Discrete-Event Simulation 基于离散事件仿真的自愈网络可靠性分析

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.95

T. Angskun, G. Bosilca, G. Fagg, Jelena Pjesivac-Grbovic, J. Dongarra

{"title":"Reliability Analysis of Self-Healing Network using Discrete-Event Simulation","authors":"T. Angskun, G. Bosilca, G. Fagg, Jelena Pjesivac-Grbovic, J. Dongarra","doi":"10.1109/CCGRID.2007.95","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.95","url":null,"abstract":"The number of processors embedded on high performance computing platforms is continuously increasing to accommodate user desire to solve larger and more complex problems. However, as the number of components increases, so does the probability of failure. Thus, both scalable and fault-tolerance of software are important issues in this field. To ensure reliability of the software especially under the failure circumstance, the reliability analysis is needed. The discrete-event simulation technique offers an attractive a ternative to traditional Markovian-based analytical models, which often have an intractably large state space. In this paper, we analyze reliability of a self-healing network developed for parallel runtime environments using discrete-event simulation. The network is designed to support transmission of messages across multiple nodes and at the same time, to protect against node and process failures. Results demonstrate the flexibility of a discrete-event simulation approach for studying the network behavior under failure conditions and various protocol parameters, message types, and routing algorithms.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133513006","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

Hot-Spot Avoidance With Multi-Pathing Over InfiniBand: An MPI Perspective 热点避免与多路径在InfiniBand:一个MPI的观点

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.60

Abhinav Vishnu, Matthew J. Koop, A. Moody, A. Mamidala, S. Narravula, D. Panda

{"title":"Hot-Spot Avoidance With Multi-Pathing Over InfiniBand: An MPI Perspective","authors":"Abhinav Vishnu, Matthew J. Koop, A. Moody, A. Mamidala, S. Narravula, D. Panda","doi":"10.1109/CCGRID.2007.60","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.60","url":null,"abstract":"Large scale InfiniBand clusters are becoming increasingly popular, as reflected by the TOP 500 supercomputer rankings. At the same time, fat tree has become a popular interconnection topology for these clusters, since it allows multiple paths to be available in between a pair of nodes. However, even with fat tree, hot-spots may occur in the network depending upon the route configuration between end nodes and communication pattern(s) in the application. To make matters worse, the deterministic routing nature of InfiniBand limits the application from effective use of multiple paths transparently and avoid the hot-spots in the network. Simulation based studies for switches and adapters to implement congestion control have been proposed in the literature. However, these studies have focussed on providing congestion control for the communication path, and not on utilizing multiple paths in the network for hot-spot avoidance. In this paper, we design an MPI functionality, which provides hot-spot avoidance for different communications, without a priori knowledge of the pattern. We leverage LMC (LID mask count) mechanism of InfiniBand to create multiple paths in the network and present the design issues (scheduling policies, selecting number of paths, scalability aspects) of our design. We implement our design and evaluate it with Pallas collective communication and MPI applications. On an InfiniBand cluster with 48 processes, MPI All-to-all personalized shows an improvement of 27%. Our evaluation with NAS parallel benchmarks on 64 processes shows significant improvement in execution time with this functionality.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114181263","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}

引用次数: 43

Token Exchange System as incentive mechanism for e-Science Grid 代币交换系统作为e-Science Grid的激励机制

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.114

Arun Anandasivam, Dirk Neumann

引用次数: 0

A Computer-Aided Diagnostic System using a Global Data Grid Repository for the Evaluation of Ultrasound Carotid Images 使用全球数据网格库评估超声颈动脉图像的计算机辅助诊断系统

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.2

M. A. Gutierrez, S. Lage, Jasper Lee, Zheng Zhou

引用次数: 0

Scheduling Data-IntensiveWorkflows onto Storage-Constrained Distributed Resources 调度数据密集型工作流到存储受限的分布式资源

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.101

Arun Ramakrishnan, Gurmeet Singh, Henan Zhao, E. Deelman, R. Sakellariou, K. Vahi, K. Blackburn, D. Meyers, M. Samidi

引用次数: 153

Study of Different Replica Placement and Maintenance Strategies in Data Grid 数据网格中不同副本放置与维护策略的研究

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.111

R. Rahman, K. Barker, R. Alhajj

{"title":"Study of Different Replica Placement and Maintenance Strategies in Data Grid","authors":"R. Rahman, K. Barker, R. Alhajj","doi":"10.1109/CCGRID.2007.111","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.111","url":null,"abstract":"Data replication is an excellent technique to move and cache data close to users. By replication, data access performance can be improved dramatically. One of the challenges in data replication is to select the candidate sites where replicas should be placed. We use a multi-objective model to address the replica placement problem. The multi-objective model considers the objectives of p-median and p-center models simultaneously to select the candidate sites that will host replicas. The objective of the p-median model is to find the locations of p possible candidate replication sites by optimizing total (or average) response time; where the p-center model finds p candidate sites by optimizing maximum response time. A grid environment is highly dynamic so user requests and network latency vary constantly. Therefore, candidate sites currently holding replicas may not be the best sites to fetch replica on subsequent requests. We propose a dynamic replica maintenance algorithm that re-allocates to new candidate sites if a performance metric degrades significantly over last K time periods. Simulation results demonstrate that the dynamic maintenance algorithm with multi-objective static placement decision performs best in dynamic environments like data grids.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122047094","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}

引用次数: 27