2014 International Symposium on Computer Architecture and High Performance Computing Workshop最新文献

筛选
英文 中文
A Parallel Maximum Subarray Algorithm on GPUs gpu上的并行最大子阵列算法
Cleber S. Ferreira, R. Camargo, S. W. Song
{"title":"A Parallel Maximum Subarray Algorithm on GPUs","authors":"Cleber S. Ferreira, R. Camargo, S. W. Song","doi":"10.1109/SBAC-PADW.2014.15","DOIUrl":"https://doi.org/10.1109/SBAC-PADW.2014.15","url":null,"abstract":"This paper presents a parallel algorithm for the maximum sub array problem implemented on a machine with GPUs. Given a sequence of numbers, the maximum subsequence is a contiguous subsequence with maximum sum. The maximum sub array problem is a 2-D version of the maximum subsequence problem. Given a 2-D array of numbers, the maximum sub array is the sub array with maximum sum of its elements. The main difficulty lies in the complex memory organization of the GPU architecture, as well as its more restricted SIMD computing paradigm. Efficient ways to distribute the tasks among threads should be devised. We ran the experiments on a machine with two NVIDIA Geforce GTX 680 graphics units and an Intel i7 CPU. For large input arrays, the parallel algorithm using CPU and two GPUs was able to run about 590 times faster than the sequential counterpart when only one CPU core is used.","PeriodicalId":293862,"journal":{"name":"2014 International Symposium on Computer Architecture and High Performance Computing Workshop","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114669401","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
A Minimalistic Dataflow Programming Library for Python 一个简约的Python数据流编程库
Tiago A. O. Alves, Brunno F. Goldstein, F. França, L. A. J. Marzulo
{"title":"A Minimalistic Dataflow Programming Library for Python","authors":"Tiago A. O. Alves, Brunno F. Goldstein, F. França, L. A. J. Marzulo","doi":"10.1109/SBAC-PADW.2014.20","DOIUrl":"https://doi.org/10.1109/SBAC-PADW.2014.20","url":null,"abstract":"Current work on parallel programming models are trending towards the dataflow paradigm. Previous works on that topic have shown that dataflow programming is indeed a natural way to exploit parallelism in programs. However, there is still a gap in terms of ease of programming between high level languages adopted by the scientific community and the languages and tools available for dataflow programming. In this paper we present Sucuri: a minimalistic Python library that provides dataflow programming with reasonably simple syntax. To parallelize applications using our library, the programmer needs only to identify functions of his code that are good candidates for parallelization and instantiate a dataflow graph where each node is associated with one of such functions, and the edges between nodes describe data dependencies between functions. We then proceed to implement two benchmarks that represent important parallel programming patterns using our library and execute them on a cluster of multicores. Experimental results are promising, proving that our library can be an interesting first option for parallelization.","PeriodicalId":293862,"journal":{"name":"2014 International Symposium on Computer Architecture and High Performance Computing Workshop","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116135435","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
Energy Evaluation for Applications with Different Thread Affinities on the Intel Xeon Phi Intel Xeon Phi处理器上不同线程关联应用的能量评估
Gary Lawson, M. Sosonkina, Yuzhong Shen
{"title":"Energy Evaluation for Applications with Different Thread Affinities on the Intel Xeon Phi","authors":"Gary Lawson, M. Sosonkina, Yuzhong Shen","doi":"10.1109/SBAC-PADW.2014.12","DOIUrl":"https://doi.org/10.1109/SBAC-PADW.2014.12","url":null,"abstract":"The Intel Xeon Phi coprocessor offers high parallelism on energy-efficient hardware to minimize energy consumption while maintaining performance. Dynamic frequency and voltage scaling is not accessible on the Intel Xeon Phi. Hence, saving energy relies mainly on tuning application performance. One general optimization technique is thread affinity, which is an important factor in multi-core architectures. This work investigates the effects of varying thread affinity modes and reducing core utilization on energy and execution time for the NASA Advanced Supercomputing Parallel Benchmarks (NPB). Energy measurements are captured using the micsmc utility tool available on Xeon Phi. The measurements are checked against total power captured using Watts up power meters. The results are compared to the system-default thread affinity and granularity modes. Mostly positive impacts on performance and energy are observed: When executed at the maximum thread count on all unoccupied cores, all the benchmarks but one exhibited energy savings if a specific affinity mode is set.","PeriodicalId":293862,"journal":{"name":"2014 International Symposium on Computer Architecture and High Performance Computing Workshop","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127608360","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
Scheduling of Recursive and Dynamic Data-Flow Graphs Using Stream Rewriting 使用流重写的递归和动态数据流图调度
Lars Middendorf, C. Haubelt
{"title":"Scheduling of Recursive and Dynamic Data-Flow Graphs Using Stream Rewriting","authors":"Lars Middendorf, C. Haubelt","doi":"10.1109/SBAC-PADW.2014.7","DOIUrl":"https://doi.org/10.1109/SBAC-PADW.2014.7","url":null,"abstract":"Data-flow graphs, consisting of processes (actors) and communication channels, provide an efficient model of computation for analysis and implementation of highly parallel applications. We propose a novel algorithm for scheduling a large number of data-flow actors and also recursively expandable sub-graphs by encoding their state and dependencies as a token stream. The proposed execution model enables global resource sharing, dynamic instantiation of actors and provides lightweight lock-free synchronization. Hence, our approach is most useful for compute-intensive applications with frequently varying and unpredictable data rates. In addition, we present a balanced scheduling algorithm, which restricts the memory usage of dynamic and recursive data-flow graphs, while still maintaining enough concurrency to keep all execution units utilized.","PeriodicalId":293862,"journal":{"name":"2014 International Symposium on Computer Architecture and High Performance Computing Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131100215","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
High-Level Dataflow Programming for Reconfigurable Computing 面向可重构计算的高级数据流编程
J. Sérot, F. Berry
{"title":"High-Level Dataflow Programming for Reconfigurable Computing","authors":"J. Sérot, F. Berry","doi":"10.1109/SBAC-PADW.2014.18","DOIUrl":"https://doi.org/10.1109/SBAC-PADW.2014.18","url":null,"abstract":"In many application domains, FPGAs are now promoted as a way of getting round the restrictions of specific CPU designs on system scalability. However, in the current state-of-the art, programming FPGAs remains essentially a hardware-oriented activity, relying on dedicated hardware description languages such as VHDL or Verilog. Using these languages requires expertise in digital design and in practice this limits the applicability of FPGA-based solutions. This is particulary true for stream-processing applications, in which some processing must be carried out \"on the fly\" on digital data streams. In this context, the dataflow programming model offers a very effective way to reduce the gap between high-level formulations and low-level implementations. To support this claim, the authors have recently introduced CAPH, a domain specific language, offering a fully-automated compilation path from high-level dataflow descriptions to FPGA configuration for stream-processing applications. This paper is a introduction to the CAPH language, giving its motivations and main design principles and exposing the basic features of its syntax, semantics and compilation. It also points to experimental results showing that, at least for stream-processing applications, the dataflow model of computation, used jointly as a programming model and an execution model, can offer a very effective way to conciliate abstraction and efficiency when programming FPGAs.","PeriodicalId":293862,"journal":{"name":"2014 International Symposium on Computer Architecture and High Performance Computing Workshop","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133688560","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}
引用次数: 14
RACB: Resource Aware Cache Bypass on GPUs RACB: gpu上的资源感知缓存Bypass
Hongwen Dai, Christos Kartsaklis, C. Li, T. Janjusic, Huiyang Zhou
{"title":"RACB: Resource Aware Cache Bypass on GPUs","authors":"Hongwen Dai, Christos Kartsaklis, C. Li, T. Janjusic, Huiyang Zhou","doi":"10.1109/SBAC-PADW.2014.14","DOIUrl":"https://doi.org/10.1109/SBAC-PADW.2014.14","url":null,"abstract":"Caches are universally used in computing systems to hide long off-chip memory access latencies. Unlike CPUs, massive threads running simultaneously on GPUs bring a tremendous pressure on memory hierarchy. As a result, the limitation of cache resources becomes a bottleneck for a GPU to exploit thread-level parallelism (TLP) and memory-level parallelism (MLP) and achieve high performance. In this paper, we propose a mechanism to bypass L1D and L2 cache based on the availability of cache resources. Our proposed mechanism is based on the observation that a huge number of stalls coming from limited cache resources prohibit GPUs from providing a higher throughput. So we propose Resource Aware Cache Bypass (RACB) with minor hardware changes to eliminate such stalls to improve performance. We examine the effectiveness of this approach when applied to L1D and L2 cache separately as well as together. Evaluation results with NVIDIA Computing SDK show that RACB generally improves performance the most when applied to both L1D and L2 cache, which is up to 88.05% and on an average of 16.73%, additionally, energy is saved up to 22.35% and on an average of 5.88% with minor hardware overheads.","PeriodicalId":293862,"journal":{"name":"2014 International Symposium on Computer Architecture and High Performance Computing Workshop","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131898784","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
High-Speed Restoration of Atomic Force Microscopy Images Using Tikhonov Regularization in GPGPU GPGPU中基于Tikhonov正则化的原子力显微镜图像高速恢复
K. N. Quelhas, Geraldo A. G. Cidade, R. Farias
{"title":"High-Speed Restoration of Atomic Force Microscopy Images Using Tikhonov Regularization in GPGPU","authors":"K. N. Quelhas, Geraldo A. G. Cidade, R. Farias","doi":"10.1109/SBAC-PADW.2014.22","DOIUrl":"https://doi.org/10.1109/SBAC-PADW.2014.22","url":null,"abstract":"The Atomic Force Microscopy (AFM) is a scanning probe technique widely used to produce nanometric scaled images of virtually any kind of non-conductive or biological surface. Depending on the scanning dimensions an expected AFM image structure is subjected to be modified by great amounts of external noise (low Signal/Noise ratios) - electrical or mechanical - and/or blurring due to the geometry of the measuring probe. In order to minimize such effects, image restoration techniques can be employed. The one based on the minimization of the Tikhonov's regularization functional is described, taking into account the characteristics of the measuring probe and the S/N ratio. This work proposes optimizations on both serial and parallel restoration algorithms, using CUDA library on a General Purpose Graphics Processing Unit, GPGPU, in terms of time performance and quality of restoration in regime of high speed imaging, one frame/sec or more. The results obtained are so far very promising, reaching speedups up to 43x over previous implementations.","PeriodicalId":293862,"journal":{"name":"2014 International Symposium on Computer Architecture and High Performance Computing Workshop","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129072231","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
Dataflow Virtual Machine Profiling 数据流虚拟机分析
V. F. Lira, Felippe H. Cerreia, Leandro Santiago, A. Sena, M. D. Castro, L. A. J. Marzulo
{"title":"Dataflow Virtual Machine Profiling","authors":"V. F. Lira, Felippe H. Cerreia, Leandro Santiago, A. Sena, M. D. Castro, L. A. J. Marzulo","doi":"10.1109/SBAC-PADW.2014.24","DOIUrl":"https://doi.org/10.1109/SBAC-PADW.2014.24","url":null,"abstract":"In the Dataflow model instructions are executed as soon as their input operands are ready, allowing the natural exploitation of instruction level parallelism (ILP), which makes it extremely useful for increasing applications' performance on multicore machines. However, the lack of accurate information on the parallel code can make it more difficult for programmers to perform code analysis and optimization. Thus, the aim of this work is to propose and implement a profiling mechanism for Dataflow runtime environments. To validate the profiling tool implemented, an analysis of the overhead is presented and, also, how the data generated can be used to optimize the code.","PeriodicalId":293862,"journal":{"name":"2014 International Symposium on Computer Architecture and High Performance Computing Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128601487","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
BIGhybrid -- A Toolkit for Simulating MapReduce in Hybrid Infrastructures 在混合基础设施中模拟MapReduce的工具包
J. Anjos, G. Fedak, C. Geyer
{"title":"BIGhybrid -- A Toolkit for Simulating MapReduce in Hybrid Infrastructures","authors":"J. Anjos, G. Fedak, C. Geyer","doi":"10.1109/SBAC-PADW.2014.8","DOIUrl":"https://doi.org/10.1109/SBAC-PADW.2014.8","url":null,"abstract":"Cloud computing has increasingly been used as a platform for running large business and data processing applications. Although clouds have become extremely popular, when it comes to data processing, their use incurs high costs. Conversely, Desktop Grids, have been used in a wide range of projects, and are able to take advantage of the large number of resources provided by volunteers, free of charge. Merging cloud computing and desktop grids into a hybrid infrastructure can provide a feasible low-cost solution for big data analysis. Although frameworks like MapReduce have been devised to exploit commodity hardware, their use in a hybrid infrastructure raise some challenges due to their large resource heterogeneity and high churn rate. This study introduces BIG hybrid, a toolkit that is used to simulate MapReduce in hybrid environments. Its main goal is to provide a framework for developers and system designers that can enable them to address the issues of Hybrid MapReduce. In this paper, we describe the framework which simulates the assembly of two existing middleware: Bit Dew-MapReduce for Desktop Grids and Hadoop-Blob Seer for Cloud Computing. The experimental results that are included in this work demonstrate the feasibility of our approach.","PeriodicalId":293862,"journal":{"name":"2014 International Symposium on Computer Architecture and High Performance Computing Workshop","volume":"58 26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126921671","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
Video Processing on GPU: Analysis of Data Transfer Overhead 基于GPU的视频处理:数据传输开销分析
Renan Prata, C. Bentes, R. Farias
{"title":"Video Processing on GPU: Analysis of Data Transfer Overhead","authors":"Renan Prata, C. Bentes, R. Farias","doi":"10.1109/SBAC-PADW.2014.27","DOIUrl":"https://doi.org/10.1109/SBAC-PADW.2014.27","url":null,"abstract":"In this work, we study one of the major problems in exploring the power of GPUs to accelerate video processing applications: countless frames have to be transferred back and forth between the CPU and GPU. We evaluate four different data transfer approaches currently available on modern GPUs: Standard Allocation, Pinned Memory, Data Stream, and Zero-Copy. Our results show that Data Stream is the most efficient strategy, but requires more programming effort. Zero-Copy, on the other hand, demonstrates inferior performance due to the significant latency incurred by the PCIe bus transfers for every memory access.","PeriodicalId":293862,"journal":{"name":"2014 International Symposium on Computer Architecture and High Performance Computing Workshop","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128979918","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书