A Code Mapping Scheme For Dataflow Software Pipelining
Download A Code Mapping Scheme For Dataflow Software Pipelining PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get A Code Mapping Scheme For Dataflow Software Pipelining book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
A Code Mapping Scheme for Dataflow Software Pipelining
Author: Guang R. Gao
language: en
Publisher: Springer Science & Business Media
Release Date: 2012-12-06
This monograph evolved from my Ph. D dissertation completed at the Laboratory of Computer Science, MIT, during the Summer of 1986. In my dissertation I proposed a pipelined code mapping scheme for array operations on static dataflow architectures. The main addition to this work is found in Chapter 12, reflecting new research results developed during the last three years since I joined McGill University-results based upon the principles in my dissertation. The terminology dataflow soft ware pipelining has been consistently used since publication of our 1988 paper on the argument-fetching dataflow architecture model at McGill University [43]. In the first part of this book we describe the static data flow graph model as an operational model for concurrent computation. We look at timing considerations for program graph execution on an ideal static dataflow computer, examine the notion of pipe lining, and characterize its performance. We discuss balancing techniques used to transform certain graphs into fully pipelined data flow graphs. In particular, we show how optimal balancing of an acyclic data flow graph can be formulated as a linear programming problem for which an optimal solution exists. As a major result, we show the optimal balancing problem of acyclic data flow graphs is reduceable to a class of linear programming problem, the net work flow problem, for which well-known efficient algorithms exist. This result disproves the conjecture that such problems are computationally hard.
Languages and Compilers for Parallel Computing
Author: Utpal Banerjee
language: en
Publisher: Springer Science & Business Media
Release Date: 1992
This volume contains the proceedings of the Fourth Workshop on Languages andCompilers for Parallel Computing, held in Santa Clara, California, in August1991. The purpose of the workshop, held every year since 1988, is to bring together the leading researchers on parallel programming language designand compilation techniques for parallel computers. The papers in this book cover several important topics including: (1) languages and structures to represent programs internally in the compiler, (2) techniques to analyzeand manipulate sequential loops in order to generate a parallel version, (3)techniques to detect and extract fine-grain parallelism, (4) scheduling and memory-management issues in automatically generated parallel programs, (5) parallel programming language designs, and (6) compilation of explicitly parallel programs. Together, the papers give a good overview of the research projects underway in 1991 in this field.
Parle ’91 Parallel Architectures and Languages Europe
The innovative progress in the development oflarge-and small-scale parallel computing systems and their increasing availability have caused a sharp rise in interest in the scientific principles that underlie parallel computation and parallel programming. The biannual "Parallel Architectures and Languages Europe" (PARLE) conferences aim at presenting current research material on all aspects of the theory, design, and application of parallel computing systems and parallel processing. At the same time, the goal of the PARLE conferences is to provide a forum for researchers and practitioners to ex change ideas on recent developments and trends in the field of parallel com puting and parallel programming. The first ~wo conferences, PARLE '87 and PARLE '89, have succeeded in meeting this goal and made PARLE a conference that is recognized worldwide in the field of parallel computation. PARLE '91 again offers a wealth of high-quality research material for the benefit of the scientific community. Compared to its predecessors, the scope of PARLE '91 has been broadened so as to cover the area of parallel algo rithms and complexity, in addition to the central themes of parallel archi tectures and languages. The proceedings of the PARLE '91 conference contain the text of all con tributed papers that were selected for the programme and of the invited papers by leading experts in the field.