2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing最新文献

Self Protecting Data Sharing Using Generic Policies 使用通用策略的自我保护数据共享

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2015-07-09 DOI: 10.1109/CCGrid.2015.84

Shiping Chen, Danan Thilakanathan, Donna Xu, S. Nepal, R. Calvo

引用次数: 8

MIC-Tandem: Parallel X!Tandem Using MIC on Tandem Mass Spectrometry Based Proteomics Data MIC-Tandem:平行X!基于串联质谱的蛋白质组学数据串联使用MIC

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2015-07-09 DOI: 10.1109/CCGrid.2015.31

Pinjie He, Kenli Li

{"title":"MIC-Tandem: Parallel X!Tandem Using MIC on Tandem Mass Spectrometry Based Proteomics Data","authors":"Pinjie He, Kenli Li","doi":"10.1109/CCGrid.2015.31","DOIUrl":"https://doi.org/10.1109/CCGrid.2015.31","url":null,"abstract":"The widespread use of mass spectrometry for protein identification has created an urgent demand for improving computational efficiency of matching mass spectrometry data to protein databases. With the rapid development of chip technology and parallel computing technique, such as multi-core processor, many-core coprocessor and cluster of multi-node, the speed and performance of the major mass spectral search engines are continuously improving. In recent ten years, X!Tandem as a popular and representative open-source program in searching mass spectral has extended several parallel versions and obtains considerable speedups. However, because these parallel strategies are mainly based on cluster of nodes, higher costs (e.g., charge of electricity and maintenance) is needed to get limited speedups. Fortunately, Intel Many Integrated Core (MIC) architecture and Graphics Processing Unit (GPU) are ideal for this problem. In this paper, we present and implement a parallel strategy to X!Tandem using MIC called MIC-Tandem, That shows excellent speedups on commodity hardware and produces the same results as the original program.","PeriodicalId":6664,"journal":{"name":"2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"42 1","pages":"717-720"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90329808","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

Partition-Aware Routing to Improve Network Isolation in Infiniband Based Multi-tenant Clusters 分区感知路由改善Infiniband多租户集群中的网络隔离

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2015-07-09 DOI: 10.1109/CCGrid.2015.96

Feroz Zahid, Ernst Gunnar Gran, Bartosz Bogdanski, Bjørn Dag Johnsen, T. Skeie

{"title":"Partition-Aware Routing to Improve Network Isolation in Infiniband Based Multi-tenant Clusters","authors":"Feroz Zahid, Ernst Gunnar Gran, Bartosz Bogdanski, Bjørn Dag Johnsen, T. Skeie","doi":"10.1109/CCGrid.2015.96","DOIUrl":"https://doi.org/10.1109/CCGrid.2015.96","url":null,"abstract":"InfiniBand (IB) is a widely used network interconnect for modern high-performance computing systems. In large IB fabrics, isolation of nodes is provided through partitioning. The routing algorithm, however, is unaware of these partitions in the network, Traffic flows belonging to different partitions might share links inside the network fabric. This sharing of intermediate links creates interference, which is particularly critical to avoid in multi-tenant environments like a cloud. In such systems, each tenant should experience predictable network performance, unaffected by the workload of other tenants. In addition, using current routing schemes, routes crossing partition boundaries are considered when distributing routes onto links in the network, despite the fact that these routes will never be used. The result is degraded load-balancing. In this paper, we present a novel partition-aware fat-tree routing algorithm, pFTree. The pFTree algorithm utilizes several mechanisms to provide network-wide isolation of partitions belonging to different tenant groups. Given the available network resources, pFTree starts by isolating partitions at the physical link level, and then moves on to utilize virtual lanes, if needed. Our experiments and simulations show that pFTree is able to significantly reduce the affect of inter-partition interference without any additional functional overhead. Furthermore, pFTree also provides improved load-balancing over the de facto standard IB fat-tree routing algorithm.","PeriodicalId":6664,"journal":{"name":"2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"28 1","pages":"189-198"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88473759","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}

引用次数: 10

F/M-CIP: Implementing Flash Memory Cache Using Conservative Insertion and Promotion F/M-CIP:使用保守插入和提升实现闪存缓存

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2015-05-04 DOI: 10.1109/CCGrid.2015.119

J. Yang, Q. Yang

{"title":"F/M-CIP: Implementing Flash Memory Cache Using Conservative Insertion and Promotion","authors":"J. Yang, Q. Yang","doi":"10.1109/CCGrid.2015.119","DOIUrl":"https://doi.org/10.1109/CCGrid.2015.119","url":null,"abstract":"Flash memory SSD has emerged as a promising storage media and fits naturally as a cache between the system RAM and the disk due to its performance/cost characteristics. Managing such an SSD cache is challenging and traditional cache replacements do not work well because of SSDs asymmetric read/write performances and wearing issues. This paper presents a new cache replacement algorithm referred to as F/M-CIP that accelerates disk I/O greatly. The idea is dividing the traditional LRU list into 4 parts: candidate-list, SSD-list, RAM-list and eviction-buffer-list. Upon a cache miss, the metadata of the missed block is conservatively inserted into the candidate-list but the data itself is not cached. The block in the candidate-list is then conservatively promoted to the RAM-list upon the k-th miss. At the bottom of the RAM-list, the eviction-buffer accumulates LRU blocks to be written into the SSD cache in batches to exploit the internal parallelism of SSD. The SSD-list is managed using a combination of regency and frequency replacement policies by means of conservative promotion upon hits. To quantitatively evaluate the performance of F/M-CIP, a prototype has been built on Linux kernel at the generic block layer. Experimental results on standard benchmarks and real world traces have shown that F/M-CIP accelerates disk I/O performance up to an order of magnitude compared to the traditional hard disk storage and up to a factor of 3 compared to the traditional SSD cache algorithm in terms of application execution time. Furthermore, F/M-CIP substantially reduces write operations to the SSD implying prolonged durability.","PeriodicalId":6664,"journal":{"name":"2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"256 1","pages":"81-90"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73554132","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

Towards Self Adaptable Security Monitoring in IaaS Clouds 迈向IaaS云中的自适应安全监控

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2015-05-04 DOI: 10.1109/CCGrid.2015.133

Anna Giannakou, Louis Rilling, Jean-Louis Pazat, Frédéric Majorczyk, C. Morin

引用次数: 5

Predicting the Performance of Parallel Computing Models Using Queuing System 利用排队系统预测并行计算模型的性能

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2015-05-04 DOI: 10.1109/CCGrid.2015.92

Chao Shen, W. Tong, Samina Kausar

引用次数: 8

ProRenaTa: Proactive and Reactive Tuning to Scale a Distributed Storage System ProRenaTa:扩展分布式存储系统的主动和被动调优

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2015-05-04 DOI: 10.1109/CCGrid.2015.26

Y. Liu, N. Rameshan, Enric Monte-Moreno, Vladimir Vlassov, Leandro Navarro-Moldes

引用次数: 20

Reconfigurations for Processor Arrays with Faulty Switches and Links 具有故障开关和链路的处理器阵列的重新配置

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2015-05-04 DOI: 10.1109/CCGrid.2015.47

W. Jigang, Longting Zhu, Peilan He, Guiyuan Jiang

{"title":"Reconfigurations for Processor Arrays with Faulty Switches and Links","authors":"W. Jigang, Longting Zhu, Peilan He, Guiyuan Jiang","doi":"10.1109/CCGrid.2015.47","DOIUrl":"https://doi.org/10.1109/CCGrid.2015.47","url":null,"abstract":"Large scale multiprocessor array suffers from frequent hardware defects or soft faults due to overheating, overload or occupancy by other running applications. To obtain fault-free logical array, reconfiguration techniques are proposed to reuse the fault-free PEs by changing the interconnection among PEs. Previous research has worked on this topic but assume that switches and links are fault-free. In this paper, we consider faults not only on the processing elements (PEs) but also on the switches and links, and develop efficient algorithms to construct as large as possible logical arrays with optimized networks length. To deal with the faults on switches and links, an efficient pre-processing procedure is designed, in which switch faults are transformed into link faults, and then faulty links are classified into several categories to handle. Then, we propose an efficient algorithm, A-MLA, to produce as many as possible logical columns which are then combined to form a two dimensional processor array. After that, we propose an algorithm A-TMLA to reduce the interconnection length of the logical array obtained by algorithm A-MLA, as short interconnect leads to small communication latency and power consumption. Extensive experimental results show that, even with switch faults and link faults, our approach can produce larger logical fault-free arrays with shorter interconnection length, compared to the state-of-the-art.","PeriodicalId":6664,"journal":{"name":"2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"86 1","pages":"141-148"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74536934","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

YARNsim: Simulating Hadoop YARN YARNsim:模拟Hadoop YARN

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2015-05-04 DOI: 10.1109/CCGrid.2015.61

Ning Liu, Xi Yang, Xian-He Sun, John Jenkins, R. Ross

{"title":"YARNsim: Simulating Hadoop YARN","authors":"Ning Liu, Xi Yang, Xian-He Sun, John Jenkins, R. Ross","doi":"10.1109/CCGrid.2015.61","DOIUrl":"https://doi.org/10.1109/CCGrid.2015.61","url":null,"abstract":"Despite the popularity of the Apache Hadoop system, its success has been limited by issues such as single points of failure, centralized job/task management, and lack of support for programming models other than MapReduce. The next generation of Hadoop, Apache Hadoop YARN, is designed to address these issues. In this paper, we propose YARNsim, a simulation system for Hadoop YARN. YARNsim is based on parallel discrete event simulation and provides protocol-level accuracy in simulating key components of YARN. YARNsim provides a virtual platform on which system architects can evaluate the design and implementation of Hadoop YARN systems. Also, application developers can tune job performance and understand the tradeoffs between different configurations, and Hadoop YARN system vendors can evaluate system efficiency under limited budgets. To demonstrate the validity of YARNsim, we use it to model two real systems and compare the experimental results from YARNsim and the real systems. The experiments include standard Hadoop benchmarks, synthetic workloads, and a bioinformatics application. The results show that the error rate is within 10% for the majority of test cases. The experiments prove that YARNsim can provide what-if analysis for system designers in a timely manner and at minimal cost compared with testing and evaluating on a real system.","PeriodicalId":6664,"journal":{"name":"2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"21 1","pages":"637-646"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73403525","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}

引用次数: 18

Parallel Solving Method of SOR Based on the Numerical Marine Forecasting Model 基于数值海洋预报模型的SOR并行求解方法

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2015-05-04 DOI: 10.1109/CCGrid.2015.117

Renbo Pang, Jianliang Xu, Yunquan Zhang

引用次数: 2