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

Accurate Scoring of Drug Conformations at the Extreme Scale 极端尺度下药物构象的准确评分

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

Boyu Zhang, Trilce Estrada, Pietro Cicotti, P. Balaji, M. Taufer

引用次数: 6

Analyzing the Impact of CPU Pinning and Partial CPU Loads on Performance and Energy Efficiency 分析CPU固定和部分CPU负载对性能和能效的影响

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

Andrej Podzimek, L. Bulej, L. Chen, Walter Binder, P. Tůma

{"title":"Analyzing the Impact of CPU Pinning and Partial CPU Loads on Performance and Energy Efficiency","authors":"Andrej Podzimek, L. Bulej, L. Chen, Walter Binder, P. Tůma","doi":"10.1109/CCGrid.2015.164","DOIUrl":"https://doi.org/10.1109/CCGrid.2015.164","url":null,"abstract":"While workload collocation is a necessity to increase energy efficiency of contemporary multi-core hardware, it also increases the risk of performance anomalies due to workload interference. Pinning certain workloads to a subset of CPUs is a simple approach to increasing workload isolation, but its effect depends on workload type and system architecture. Apart from common sense guidelines, the effect of pinning has not been extensively studied so far. In this paper we study the impact of CPU pinning on performance interference and energy efficiency for pairs of collocated workloads. Besides various combinations of workloads, virtualization and resource isolation, we explore the effects of pinning depending on the level of background load. The presented results are based on more than 1000 experiments carried out on an Intel-based NUMA system, with all power management features enabled to reflect real-world settings. We find that less common CPU pinning configurations improve energy efficiency at partial background loads, indicating that systems hosting collocated workloads could benefit from dynamic CPU pinning based on CPU load and workload type.","PeriodicalId":6664,"journal":{"name":"2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"81 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81342324","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}

引用次数: 46

Contiguity and Locality in Backfilling Scheduling 回填调度中的邻近性和局部性

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

Giorgio Lucarelli, F. Mendonca, D. Trystram, Frédéric Wagner

{"title":"Contiguity and Locality in Backfilling Scheduling","authors":"Giorgio Lucarelli, F. Mendonca, D. Trystram, Frédéric Wagner","doi":"10.1109/CCGrid.2015.143","DOIUrl":"https://doi.org/10.1109/CCGrid.2015.143","url":null,"abstract":"We consider the classical First Come First Served / backfilling algorithm which is commonly used in actual batch schedulers. As HPC platforms grow in size and complexity, an interesting question is how to enhance this algorithm in order to improve global performance by reducing the overall amount of communications. In this direction, we are interested in studying the impact of contiguity and locality allocation constraints on the behavior of batch scheduler. We provide a theoretical analysis of the cost of enforcing contiguity and locality properties. More specifically, we show that both properties do not impose strong limit on achievable make span performance while comparing feasible optimal solutions under different settings, we describe here the existing results on this topic and complete them with all combinations of constraints. We also propose a range of different allocation algorithms for backfilling by choosing between a strict or a soft enforcing of locality and contiguity. Our approach is validated through an extensive series of simulations based on batch scheduler traces. Experiments show that our algorithms do not increase the make span in average when comparing to actual practices. Interestingly, we observe that enforcing contiguity efficiently improves locality.","PeriodicalId":6664,"journal":{"name":"2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"106 1","pages":"586-595"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81652010","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

PIONEER: A Solution to Parallel I/O Workload Characterization and Generation 先锋:并行I/O工作负载表征和生成的解决方案

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

Weiping He, D. Du, Sai B. Narasimhamurthy

引用次数: 6

A Novel Query Caching Scheme for Dynamic InfiniBand Subnets 一种新的ib动态子网查询缓存方案

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

Evangelos Tasoulas, Ernst Gunnar Gran, Bjørn Dag Johnsen, T. Skeie

引用次数: 4

Towards a High Level Programming Paradigm to Deploy e-Science Applications with Dynamic Workflows on Large Scale Distributed Systems 面向在大规模分布式系统上部署具有动态工作流的电子科学应用的高级编程范式

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

M. B. Belgacem, N. Abdennadher

引用次数: 2

An Availability-on-Demand Mechanism for Datacenters 数据中心的可用性随需应变机制

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

S. Shen, A. Iosup, A. Israel, W. Cirne, D. Raz, D. Epema

{"title":"An Availability-on-Demand Mechanism for Datacenters","authors":"S. Shen, A. Iosup, A. Israel, W. Cirne, D. Raz, D. Epema","doi":"10.1109/CCGrid.2015.58","DOIUrl":"https://doi.org/10.1109/CCGrid.2015.58","url":null,"abstract":"Data enters are at the core of a wide variety of daily ICT utilities, ranging from scientific computing to online gaming. Due to the scale of today's data enters, the failure of computing resources is a common occurrence that may disrupt the availability of ICT services, leading to revenue loss. Although many high availability (HA) techniques have been proposed to mask resource failures, datacenter users' -- who rent datacenter resources and use them to provide ICT utilities to a global population' -- still have limited management options for dynamically selecting and configuring HA techniques. In this work, we propose Availability-on-Demand (AoD), a mechanism consisting of an API that allows datacenter users to specify availability requirements which can dynamically change, and an availability-aware scheduler that dynamically manages computing resources based on user-specified requirements. The mechanism operates at the level of individual service instance, thus enabling fine-grained control of availability, for example during sudden requirement changes and periodic operations. Through realistic, trace-based simulations, we show that the AoD mechanism can achieve high availability with low cost. The AoD approach consumes about the same CPU hours but with higher availability than approaches which use HA techniques randomly. Moreover, comparing to an ideal approach which has perfect predictions about failures, it consumes 13% to 31% more CPU hours but achieves similar availability for critical parts of applications.","PeriodicalId":6664,"journal":{"name":"2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"84 1","pages":"495-504"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86709807","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}

引用次数: 17

Quantifying the Energy Efficiency Challenges of Achieving Exascale Computing 量化实现百亿亿次计算的能源效率挑战

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

J. Mair, Zhiyi Huang, D. Eyers, Yawen Chen

引用次数: 25

Discovering and Leveraging Content Similarity to Optimize Collective on-Demand Data Access to IaaS Cloud Storage 发现和利用内容相似性来优化对IaaS云存储的集体按需数据访问

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

Bogdan Nicolae, Andrzej Kochut, A. Karve

{"title":"Discovering and Leveraging Content Similarity to Optimize Collective on-Demand Data Access to IaaS Cloud Storage","authors":"Bogdan Nicolae, Andrzej Kochut, A. Karve","doi":"10.1109/CCGrid.2015.156","DOIUrl":"https://doi.org/10.1109/CCGrid.2015.156","url":null,"abstract":"A critical feature of IaaS cloud computing is the ability to quickly disseminate the content of a shared dataset at large scale. In this context, a common pattern is collective on-demand read, i.e., accessing the same VM image or dataset from a large number of V Minstances concurrently. There are various techniques that avoid I/Ocontention to the storage service where the dataset is located without relying on pre-broadcast. Most such techniques employ peer-to-peer collaborative behavior where the VM instances exchange information about the content that was accessed during runtime, such that it impossible to fetch the missing data pieces directly from each other rather than the storage system. However, such techniques are often limited within a group that performs a collective read. In light of high data redundancy on large IaaS data centers and multiple users that simultaneously run VM instance groups that perform collective reads, an important opportunity arises: enabling unrelated VMinstances belonging to different groups to collaborate and exchange common data in order to further reduce the I/O pressure on the storage system. This paper deals with the challenges posed by such absolution, which prompt the need for novel techniques to efficiently detect and leverage common data pieces across groups. To this end, we introduce a low-overhead fingerprint based approach that we evaluate and demonstrate to be efficient in practice for a representative scenario on dozens of nodes and a variety of group configurations.","PeriodicalId":6664,"journal":{"name":"2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"1 1","pages":"211-220"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76872731","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}

引用次数: 9

Hamiltonian Path Strategy for Deadlock-Free and Adaptive Routing in Diametrical 2D Mesh NoCs 直径二维网格noc中无死锁自适应路由的hamilton路径策略

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

Poona Bahrebar, D. Stroobandt

引用次数: 3