International Symposium on Design and Implementation of Symbolic Computation Systems最新文献

A case study of MapReduce speculation for failure recovery MapReduce对故障恢复的推测案例研究

International Symposium on Design and Implementation of Symbolic Computation Systems Pub Date : 2015-11-15 DOI: 10.1145/2831244.2831245

Huansong Fu, Yue Zhu, Weikuan Yu

引用次数: 4

Efficient disk-to-disk sorting: a case study in the decoupled execution paradigm 高效的磁盘到磁盘排序:解耦执行范例中的一个案例研究

International Symposium on Design and Implementation of Symbolic Computation Systems Pub Date : 2015-11-15 DOI: 10.1145/2831244.2831249

Hassan Eslami, Anthony Kougkas, Maria Kotsifakou, T. Kasampalis, Kun Feng, Yin Lu, W. Gropp, Xian-He Sun, Yong Chen, R. Thakur

{"title":"Efficient disk-to-disk sorting: a case study in the decoupled execution paradigm","authors":"Hassan Eslami, Anthony Kougkas, Maria Kotsifakou, T. Kasampalis, Kun Feng, Yin Lu, W. Gropp, Xian-He Sun, Yong Chen, R. Thakur","doi":"10.1145/2831244.2831249","DOIUrl":"https://doi.org/10.1145/2831244.2831249","url":null,"abstract":"Many applications foreseen for exascale era should process huge amount of data. However, the IO infrastructure of current supercomputing architecture cannot be generalized to deal with this amount of data due to the need for excessive data movement from storage layers to compute nodes leading to limited scalability. There has been extensive studies addressing this challenge. Decoupled Execution Paradigm (DEP) is an attractive solution due to its unique features such as available fast storage devices close to computational units and available programmable units close to file system.\u0000 In this paper we study the effectiveness of DEP for a well-known data-intensive kernel, disk-to-disk (aka out-of-core) sorting. We propose an optimized algorithm that uses almost all features of DEP pushing the performance of sorting in HPC even further compared to other existing solutions. Advantages in our algorithm are gained by exploiting programming units close to parallel file system to achieve higher IO throughput, compressing data before sending it over network or to disk, storing intermediate results of computation close to compute nodes, and fully overlapping IO with computation. We also provide an analytical model for our proposed algorithm. Our algorithm achieves 30% better performance compared to the theoretically optimal sorting algorithm running on the same testbed but not designed to exploit the DEP architecture.","PeriodicalId":166804,"journal":{"name":"International Symposium on Design and Implementation of Symbolic Computation Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116244764","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

Experimental evaluation of a flexible I/O architecture for accelerating workflow engines in cloud environments 云环境中用于加速工作流引擎的灵活I/O架构的实验评估

International Symposium on Design and Implementation of Symbolic Computation Systems Pub Date : 2015-11-15 DOI: 10.1145/2831244.2831248

Francisco Rodrigo Duro, Francisco Javier García Blas, Florin Isaila, J. Carretero

{"title":"Experimental evaluation of a flexible I/O architecture for accelerating workflow engines in cloud environments","authors":"Francisco Rodrigo Duro, Francisco Javier García Blas, Florin Isaila, J. Carretero","doi":"10.1145/2831244.2831248","DOIUrl":"https://doi.org/10.1145/2831244.2831248","url":null,"abstract":"In the current scientific computing scenario storage systems are one of the main bottlenecks in computing platforms. This issue affects both traditional high performance computing systems and modern systems based on cloud platforms. Accelerating the I/O subsystems can improve the overall performance of the applications. In this paper, we present Hercules as an I/O accelerator specially designed for improving I/O access in workflow engines deployed over cloud-based infraestructures. Hercules provides a dynamic and flexible in-memory storage platform based on NoSQL-based distributed memory systems. In addition, Hercules offers a user-level interface based on POSIX for facilitating its usage on existing solutions and legacy applications. We have evaluated the proposed solution in a public cloud environment, in this case Amazon EC2. The results show that Hercules provides a scalable I/O solution with remarkable performance, especially for write operations, compared with classic I/O approaches for high performance computing in cloud environments.","PeriodicalId":166804,"journal":{"name":"International Symposium on Design and Implementation of Symbolic Computation Systems","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128093679","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}

引用次数: 4

Performance evaluation and tuning of BioPig for genomic analysis 用于基因组分析的BioPig性能评估和调整

International Symposium on Design and Implementation of Symbolic Computation Systems Pub Date : 2015-11-15 DOI: 10.1145/2831244.2831252

Lizhen Shi, Zhong Wang, Weikuan Yu, Xiandong Meng

引用次数: 2

SJM: an SCM-based journaling mechanism with write reduction for file systems SJM:一种基于scm的日志记录机制，用于文件系统的写减少

International Symposium on Design and Implementation of Symbolic Computation Systems Pub Date : 2015-11-15 DOI: 10.1145/2831244.2831246

Lingfang Zeng, Binbing Hou, D. Feng, K. Kent

引用次数: 8

A low-cost adaptive data separation method for the flash translation layer of solid state drives 一种用于固态硬盘闪存转换层的低成本自适应数据分离方法

International Symposium on Design and Implementation of Symbolic Computation Systems Pub Date : 2015-11-15 DOI: 10.1145/2831244.2831250

Wei Xie, Yong Chen, P. Roth

引用次数: 1

Route-aware independent MPI I/O on the blue gene/Q 蓝色基因/Q上的路由感知独立MPI I/O

International Symposium on Design and Implementation of Symbolic Computation Systems Pub Date : 2015-11-15 DOI: 10.1145/2831244.2831251

Preeti Malakar, V. Vishwanath

引用次数: 1

Supporting online analytics with user-defined estimation and early termination in a MapReduce-like framework 在类似mapreduce的框架中，支持用户自定义估计和早期终止的在线分析

International Symposium on Design and Implementation of Symbolic Computation Systems Pub Date : 2015-11-15 DOI: 10.1145/2831244.2831247

Yi Wang, Linchuan Chen, G. Agrawal

引用次数: 4

Big data analytics on traditional HPC infrastructure using two-level storage 基于两级存储的传统HPC基础设施的大数据分析

International Symposium on Design and Implementation of Symbolic Computation Systems Pub Date : 2015-08-08 DOI: 10.1145/2831244.2831253

Pengfei Xuan, Jeffrey Denton, Feng Luo, P. Srimani

引用次数: 19

Enhancing both fairness and performance using rate-aware dynamic storage cache partitioning 使用速率感知的动态存储缓存分区增强公平性和性能

International Symposium on Design and Implementation of Symbolic Computation Systems Pub Date : 2013-11-18 DOI: 10.1145/2534645.2534650

Yong Li, D. Feng, Zhan Shi

{"title":"Enhancing both fairness and performance using rate-aware dynamic storage cache partitioning","authors":"Yong Li, D. Feng, Zhan Shi","doi":"10.1145/2534645.2534650","DOIUrl":"https://doi.org/10.1145/2534645.2534650","url":null,"abstract":"In this paper, we investigate the problem of fair storage cache allocation among multiply competing applications with diversified access rates. Commonly used cache replacement policies like LRU and most LRU variants are inherently unfair in cache allocation for heterogenous applications. They implicitly give more cache to the applications that has high access rate and less cache to the applications of slow access rate. However, applications of fast access rate do not always gain higher performance from the additional cache blocks. In contrast, the slow application suffer poor performance with a reduced cache size. It is beneficial in terms of both performance and fairness to allocate cache blocks by their utility.\u0000 In this paper, we propose a partition-based cache management algorithm for a shared cache. The goal of our algorithm is to find an allocation such that all heterogenous applications can achieve a specified fairness degree, while maximizing the overall performance. To achieve this goal, we present an adaptive partition framework, which partitions the shared cache among competing applications and dynamic adjusts the partition size based on predicted utility on both fairness and performance. We implemented our algorithm in a storage simulator and evaluated the fairness and performance with various workloads. Experimental results show that, compared with LRU, our algorithm achieves large improvement in fairness and slightly in performance.","PeriodicalId":166804,"journal":{"name":"International Symposium on Design and Implementation of Symbolic Computation Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128827695","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