2012 Data-Flow Execution Models for Extreme Scale Computing最新文献

Introducing Speculative Optimizations in Task Dataflow with Language Extensions and Runtime Support 在具有语言扩展和运行时支持的任务数据流中引入推测优化

2012 Data-Flow Execution Models for Extreme Scale Computing Pub Date : 2012-09-19 DOI: 10.1109/DFM.2012.15

Nathaniel Azuelos, Yoav Etsion, I. Keidar, A. Zaks, E. Ayguadé

引用次数: 2

DFScala: High Level Dataflow Support for Scala DFScala: Scala的高级数据流支持

2012 Data-Flow Execution Models for Extreme Scale Computing Pub Date : 2012-09-19 DOI: 10.1109/DFM.2012.12

D. Goodman, Salman Khan, Chris Seaton, Yegor Guskov, Behram Khan, M. Luján, I. Watson

引用次数: 15

Exploring HPC Parallelism with Data-Driven Multithreating 利用数据驱动多线程探索HPC并行性

2012 Data-Flow Execution Models for Extreme Scale Computing Pub Date : 2012-09-19 DOI: 10.1109/DFM.2012.11

C. Christofi, G. Michael, P. Trancoso, P. Evripidou

{"title":"Exploring HPC Parallelism with Data-Driven Multithreating","authors":"C. Christofi, G. Michael, P. Trancoso, P. Evripidou","doi":"10.1109/DFM.2012.11","DOIUrl":"https://doi.org/10.1109/DFM.2012.11","url":null,"abstract":"The switch to Multi-core systems has ended the reliance on the single processor for increase in performance and moved into Parallelism. However, the exponential growth in performance of the single processor in the 80's and 90's had overshadowed the drive for efficient Parallelism and relegate it into a niche research area, mostly for High Performance Computing (HPC). Parallelism now is in the forefront and holds the burden for utilising the extra resources of Moore's law to maintain the exponential growth of the computing systems. In the drive to utilise parallel models of computation, Data-Flow models have recently been \"re-visited\" for exploiting parallelism in the multi and many core systems. Data-Driven Multithreading (DDM) is one such model which is based on Dynamic Data- Flow principles, that can expose the maximum parallelism of an application. DDM schedules Threads based on Data availability driven by a producer consumer graph. DDM enforces single assignments semantics on the data passed from producer to consumer. In this paper we present a preliminary evaluation of whether DDM can be viable candidate for HPC. We study the scalability of a small subset of the LINPACK benchmark using the Data-Driven Multithreading for a system with a 48 cores. We implement three test case operations: Matrix Multiplication, LU and Cholesky decompositions and use them to test their scalability and performance. We use optimized linear algebra kernel operation for the basic operations performed in the threads. We compare our DDM implementations against PLASMA, a state-of-the art linear algebra library for HPC computing, and show that applications using the DDM model can scale efficiently and observe a performance improvement of up to 2×.","PeriodicalId":130397,"journal":{"name":"2012 Data-Flow Execution Models for Extreme Scale Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123869268","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}

引用次数: 12

A Data-Flow Based Coordination Approach to Concurrent Software Engineering 并行软件工程中一种基于数据流的协调方法

2012 Data-Flow Execution Models for Extreme Scale Computing Pub Date : 2012-09-19 DOI: 10.1109/DFM.2012.14

F. Penczek, W. Cheng, C. Grelck, R. Kirner, B. Scheuermann, A. Shafarenko

引用次数: 9

Support for Dependency Driven Executions among OpenMP Tasks 在OpenMP任务中支持依赖驱动的执行

2012 Data-Flow Execution Models for Extreme Scale Computing Pub Date : 2012-09-19 DOI: 10.1109/DFM.2012.16

Priyankar Ghosh, Yonghong Yan, B. Chapman

{"title":"Support for Dependency Driven Executions among OpenMP Tasks","authors":"Priyankar Ghosh, Yonghong Yan, B. Chapman","doi":"10.1109/DFM.2012.16","DOIUrl":"https://doi.org/10.1109/DFM.2012.16","url":null,"abstract":"OpenMP 3.x introduced the concept of creation of tasks with the aim of handling unstructured parallelism by providing support for efficient load-balancing and dynamic scheduling of asynchronous units of work, namely tasks. This work is focused towards extending task parallelism further to exploit task dependence relationships. The goal is to extend the OpenMP tasking model to provide more flexible synchronizations based on the data access relationship among such tasks. Our approach implements extensions to the current OpenMP task directive, which aim at providing task-level granularity for synchronization of tasks sharing the same parent. The new extensions focus primarily on adding additional functionality to the OpenUH compiler runtime referenced at the time of scheduling of tasks to honor only specified explicit dependencies. The extensions provide simplicity of use and help in achieving more parallelism owing to a more flexible approach in synchronizing tasks wherein a task waits only as long as its specified explicit dependencies are honored. The extensions when tested on a basic linear algebraic algorithm - LU Decomposition, presented a 9% and 20% speedup compared to the tasking implementations of Intel and GNU compilers respectively.","PeriodicalId":130397,"journal":{"name":"2012 Data-Flow Execution Models for Extreme Scale Computing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125434881","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}

引用次数: 6

Incorporating Dynamic Communication Patterns in a Static Dataflow Notation 在静态数据流符号中结合动态通信模式

2012 Data-Flow Execution Models for Extreme Scale Computing Pub Date : 2012-09-19 DOI: 10.1109/DFM.2012.13

Pritish Jetley, Adarsh Keshany, L. Kalé

引用次数: 0

Determinacy and Repeatability of Parallel Program Schemata 并行程序模式的确定性和可重复性

2012 Data-Flow Execution Models for Extreme Scale Computing Pub Date : 2012-09-01 DOI: 10.1109/DFM.2012.10

J. Dennis, G. Gao, Vivek Sarkar

引用次数: 13