Computer Communications and Networks. Series editor A.J. Sammes Centre for Forensic Computing Cranfield University, Shrivenham campus Swindon, UK

Size: px

Start display at page:

Download "Computer Communications and Networks. Series editor A.J. Sammes Centre for Forensic Computing Cranfield University, Shrivenham campus Swindon, UK"

Kathleen Berry
5 years ago
Views:

1 Computer Communications and Networks Series editor A.J. Sammes Centre for Forensic Computing Cranfield University, Shrivenham campus Swindon, UK

2 The Computer Communications and Networks series is a range of textbooks, monographs and handbooks. It sets out to provide students, researchers, and nonspecialists alike with a sure grounding in current knowledge, together with comprehensible access to the latest developments in computer communications and networking. Emphasis is placed on clear and explanatory styles that support a tutorial approach, so that even the most complex of topics is presented in a lucid and intelligible manner. More information about this series at

3 Veljko Milutinović JakobSalom Nemanja Trifunovic Roberto Giorgi Guide to DataFlow Supercomputing Basic Concepts, Case Studies, and a Detailed Example 123

4 Veljko Milutinović School of Electrical Engineering University of Belgrade Serbia Nemanja Trifunovic Maxeler Technologies Inc. Palo Alto, CA, USA Jakob Salom MISANU Belgrade, Serbia Roberto Giorgi University of Siena Italy ISSN ISSN (electronic) Computer Communications and Networks ISBN ISBN (ebook) DOI / Library of Congress Control Number: Springer Cham Heidelberg New York Dordrecht London Springer International Publishing Switzerland 2015 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper Springer International Publishing AG Switzerland is part of Springer Science+Business Media (www. springer.com)

5 Preface This book is meant to support teaching of the DataFlow subject. University courses fully or partially dedicated to the DataFlow subject are important for the following reason: More and more Big Data are present in all kinds of research or commercial challenges. Consequently, the DataFlow paradigm is getting importance, since it has been proven that it is the most suitable computing paradigm for Big Data. It offers superior speedups (depending on the application, from about 20 to about 200, even 2000 in some isolated cases) as well as power savings (typically about 20 times); it brings size reduction, too. A recent study by researchers of the Tsinghua University in China reveals that for Shallow Water Weather Forecast (a Big Data problem), on the 1U level, compared to Tianhe-2 (at the time of writing of this book, rated #1 on the Top 500 SuperComputers list, which compares SuperComputers based on Linpack, a small data benchmark), Maxeler (a DataFlow machine) demonstrates the speedup of 14. With all the above in mind, the book is divided into four chapters: The first one is of an introductory nature. The second gives an overview of the related research. The third represents a case study. The fourth one is oriented to the ease of use and covers the issues of importance for WebIDE (a web-based integrated development environment). The work on this book was partially supported by the MISANU project # Belgrade, Serbia Belgrade, Serbia Palo Alto, CA, USA Siena, Italy Veljko Milutinović Jakob Salom Nemanja Trifunovic Roberto Giorgi v

7 Contents 1 The DataFlow Paradigm Introduction The Concept The ProgrammingParadigm The Compilation Comparisons DataFlow Hardware(A MaxelerExample) ApplicationTypes ApplicationExamples Acceleration Is Hard OpenResearch Problems EnablerMechanismsfor DataFlow Supercomputing Getting Started OPEX ComputerSize Matters (1U,2U, 4U) Bottom Line OpenSPL WebIDE Insteadof the Conclusion References Selected Case Studies Classification of Selected Examples Examples for Each Leaf Within the Main Classification Presentationof Examples Examples from Exascale Fundamental Drivers Leaf #1: Finance Examples from Exascale Fundamental Drivers Leaf #2: Mathematics Examples from Exascale Science and Technology Drivers Leaf #1: Biology vii

8 viii Contents Examples from Exascale Science and Technology Drivers Leaf #2: Geophysics Examples from Exascale Science and Technology Drivers Leaf #3: Meteorology Examples from Exascale Engineering and Innovation Drivers Leaf #5: Oil Industry AdditionalResearch Papers References An Example Application: Fourier Transform Introduction About the Cooley-Tukey Algorithm About the Fast Fourier Transform Algorithm Overview of Different Fast Fourier Transform Algorithms The Radix 2 Cooley-TukeyAlgorithm Mathematical Background PseudoCode of the Radix 2 Cooley-TukeyAlgorithm OriginalImplementation In-Place Implementation of the Cooley-Tukey Algorithm Analysis of the Accelerated Version of the Cooley-Tukey Algorithm ImplementationalDetails Using DFE for Calculating the Fast Fourier Transform from C\CCC Code BenchmarkingProgram Performance Measurements of the Accelerated Algorithmand Analysis of the Results Assumptions andlimitations Types of Experiments Comparison of the Performance of the Accelerated Algorithm with Other Publicly AvailableImplementations Comparison of the Performance of Accelerated Algorithmwith Original Implementation GraphDrawingScript Results Overviewand PerformancePredictions Analysis of the Bottlenecks Possible Modificationsand Improvements Conclusion OriginalImplementationCode MaxJ Code of Kernel that Calculates Fast FourierTransform... 96

9 Contents ix MaxJ Manager Code of Cooley-Tukey Radix 2 Algorithm MaxJ ManagerCode of Bit ReverseKernel CCC Code of Radix 2 In-Place Cooley-Tukey Algorithm CCC BenchmarkCode Script for Filtering Raw Data About Average ExecutionSpeed of the Experiments PythonScript for AutomaticGraphGeneration References Using the WebIDE The WebIDE System Overview InstallationInstructions WebIDE Dependencies Installation Steps Running WebIDE SecurityNotes Note Note DeploymentNotes NGINX Gunicorn User Administration Login LoginCredentials Project Explorer Creatinga New Project Deletingan Existing Project WebIDE with Welcome Windows WebIDE with Side-by-SideCode Editors Code Editor Build Output FolderExplorer ImageViewer PDF Viewer CSV Viewer Terminal WebIDE ChangeLog Epilogue Postscript Index

Philip Andrew Simpson. FPGA Design. Best Practices for Team-based Reuse. Second Edition

Philip Andrew Simpson. FPGA Design. Best Practices for Team-based Reuse. Second Edition FPGA Design Philip Andrew Simpson FPGA Design Best Practices for Team-based Reuse Second Edition Philip Andrew Simpson San Jose, CA, USA ISBN 978-3-319-17923-0 DOI 10.1007/978-3-319-17924-7 ISBN 978-3-319-17924-7