DOCSLIB.ORG

I DOPC++: EXTENDING C++ with DISTRIBUTED OBJECTS and OBJECT MIGRATION for PGAS MODEL a Thesis Submitted to Kent State University

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
I DOPC++: EXTENDING C++ with DISTRIBUTED OBJECTS and OBJECT MIGRATION for PGAS MODEL a Thesis Submitted to Kent State University DOPC++: EXTENDING C++ WITH DISTRIBUTED OBJECTS AND OBJECT MIGRATION FOR PGAS MODEL A thesis submitted to Kent State University in partial fulfillment of the requirements for the degree of Master of Science by Salwa Aljehane December,2015 i Thesis written by Salwa Aljehane B.S., Tibah University, KSA 2007 M.S., Kent State University, USA, 2015 Approved by Dr. Arvind Bansal , Advisor, Master Thesis Committee Dr. Austin Milton , Members, Master Thesis Committee Dr. Angela Guercio , Members, Master Thesis Committee Accepted by Dr. Javed Khan , Chair, Department of Computer Science Dr. James L. Blank , Dean, College of Arts and Sciences ii TABLE OF CONTENTS LIST OF FIGURES ..................................................................................................... VIII! LIST OF TABLES .......................................................................................................... IX! ACKNOWLEDGEMENTS ............................................................................................ X! ABSTRACT ................................................................................................................... XII! CHAPTER 1 INTRODUCTION ..................................................................................... 1! 1.1! Motivation .................................................................................................................. 1! 1.2! Previous Work and Current Limitations .................................................................... 3! 1.4! Objectives of this Research: ....................................................................................... 6! 1.5! Methodology .............................................................................................................. 8! 1.6! Contributions .............................................................................................................. 9! 1.7! Organization ............................................................................................................... 9! CHAPTER 2 BACKGROUND AND DEFINITION ................................................... 11! 2.1! Object Oriented Programming ................................................................................. 11! 2.1.1! Class and Objects ........................................................................................... 11! 2.1.2! Subclass and Inheritance ................................................................................ 11! 2.1.3! Extending Class Definitions .......................................................................... 12! 2.1.4! Methods ......................................................................................................... 13! 2.2! Concepts in Massive Parallel Computing ................................................................ 13! 2.2.1! “Race condition” ............................................................................................ 13! 2.2.2! Atomicity and Synchronization ..................................................................... 14! 2.2.3! Critical Sections and Locks ........................................................................... 14! iii 2.3! Models for Massive Parallel Computing ................................................................. 14! 2.3.1! Shared Memory “Open MPI” ........................................................................ 14! 2.3.2! Distributed Memory “MPI” ........................................................................... 15! 2.3.3! Partitioned Global Address Space (PGAS) ................................................... 16! 2.3.4! Single Program Multiple Data (SPMD) ........................................................ 16! 2.4! Distributed Object Based Model .............................................................................. 17! 2.4.1! Object Migration ............................................................................................ 17! 2.4.2! Remote Method Invocation ........................................................................... 17! 2.4.3! Distributed Objects ........................................................................................ 18! 2.5! Definitions in Distributed Languages with Object Oriented Programming ............ 18! 2.5.1! Definitions in Emerald ................................................................................... 18! 2.5.2! Definitions in Chapel ..................................................................................... 19! 2.5.3! Definitions in X10 ......................................................................................... 20! 2.6! List of Acronyms ..................................................................................................... 20! CHAPTER 3 LITERATURE REVIEW ....................................................................... 22! 3.1! High Performance Computing Models .................................................................... 22! 3.1.1! Message Passing Interface (MPI) Model ....................................................... 22! 3.1.2! Partitioned Global Address Space (PGAS) Model ........................................ 23! 3.1.3! Shared Memory (OpenMP) Model ................................................................ 24! 3.1.4! Comparison between MPI Model , PGAS Model and OpenMP ................... 25! 3.2! Chapel ...................................................................................................................... 25! 3.2.1! Execution Model – Mapping on PGAS Model .............................................. 26! iv 3.2.2! Synchronization ............................................................................................. 27! 3.2.3! Data parallelism ............................................................................................. 27! 3.2.4! Task parallelism ............................................................................................. 28! 3.3! X10 ........................................................................................................................... 28! 3.3.1! Execution Model – Mapping ......................................................................... 29! 3.3.2! Spawning Multiple Threads ........................................................................... 29! 3.3.3! Synchronization ............................................................................................. 29! 3.4! UPC++ ..................................................................................................................... 30! 3.4.1! Execution Model ............................................................................................ 31! 3.4.2! Construct: ....................................................................................................... 31! 3.5! Emerald – Distributed Object Based Language ....................................................... 32! 3.5.1! Flat Objects .................................................................................................... 32! 3.5.2! Remote Method Invocation ........................................................................... 33! 3.6! Java .......................................................................................................................... 34! CHAPTER 4 COMPARATIVE STUDY OF RELEVANT LANGUAGES .............. 36! 4.1! X10 ........................................................................................................................... 36! 4.1.1! Parallel Construct ........................................................................................... 36! 4.1.2! Synchronization in threads ............................................................................ 37! 4.1.3! Atomicity ....................................................................................................... 38! 4.1.4! Object Oriented Features ............................................................................... 39! 4.2! Chapel ...................................................................................................................... 39! 4.2.1! Parallel Construct ........................................................................................... 39! v 4.2.2! Synchronization in threads ............................................................................ 42! 4.2.3! Atomicity ....................................................................................................... 42! 4.2.4! Object Oriented Features ............................................................................... 42! 4.3! Comparison between X10 and Chapel ..................................................................... 43! 4.4! UPC++ ..................................................................................................................... 44! 4.4.1! Execution model: ........................................................................................... 44! 4.4.2! Parallel Constructs ......................................................................................... 44! 4.4.3! Synchronization ............................................................................................. 46! 4.4.4! Shared Object ................................................................................................. 46! 4.4.5! Remote Function Invocation .......................................................................... 47! 4.5! Comparison between UPC++ and other PGAS Languages ..................................... 47! 4.6! Emerald ...................................................................................................................
Load more

Recommended publications
  • Scala Tutorial
    Scala Tutorial SCALA TUTORIAL Simply Easy Learning by tutorialspoint.com tutorialspoint.com i ABOUT THE TUTORIAL Scala Tutorial Scala is a modern multi-paradigm programming language designed to express common programming patterns in a concise, elegant, and type-safe way. Scala has been created by Martin Odersky and he released the first version in 2003. Scala smoothly integrates features of object-oriented and functional languages. This tutorial gives a great understanding on Scala. Audience This tutorial has been prepared for the beginners to help them understand programming Language Scala in simple and easy steps. After completing this tutorial, you will find yourself at a moderate level of expertise in using Scala from where you can take yourself to next levels. Prerequisites Scala Programming is based on Java, so if you are aware of Java syntax, then it's pretty easy to learn Scala. Further if you do not have expertise in Java but you know any other programming language like C, C++ or Python, then it will also help in grasping Scala concepts very quickly. Copyright & Disclaimer Notice All the content and graphics on this tutorial are the property of tutorialspoint.com. Any content from tutorialspoint.com or this tutorial may not be redistributed or reproduced in any way, shape, or form without the written permission of tutorialspoint.com. Failure to do so is a violation of copyright laws. This tutorial may contain inaccuracies or errors and tutorialspoint provides no guarantee regarding the accuracy of the site or its contents including this tutorial. If you discover that the tutorialspoint.com site or this tutorial content contains some errors, please contact us at [email protected] TUTORIALS POINT Simply Easy Learning Table of Content Scala Tutorial ..........................................................................
    [Show full text]
  • Design Pattern Interview Questions
    DDEESSIIGGNN PPAATTTTEERRNN -- IINNTTEERRVVIIEEWW QQUUEESSTTIIOONNSS http://www.tutorialspoint.com/design_pattern/design_pattern_interview_questions.htm Copyright © tutorialspoint.com Dear readers, these Design Pattern Interview Questions have been designed specially to get you acquainted with the nature of questions you may encounter during your interview for the subject of Design Pattern. As per my experience good interviewers hardly plan to ask any particular question during your interview, normally questions start with some basic concept of the subject and later they continue based on further discussion and what you answer: What are Design Patterns? Design patterns represent the best practices used by experienced object-oriented software developers. Design patterns are solutions to general problems that software developers faced during software development. These solutions were obtained by trial and error by numerous software developers over quite a substantial period of time. What is Gang of Four GOF? In 1994, four authors Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides published a book titled Design Patterns - Elements of Reusable Object-Oriented Software which initiated the concept of Design Pattern in Software development. These authors are collectively known as Gang of Four GOF. Name types of Design Patterns? Design patterns can be classified in three categories: Creational, Structural and Behavioral patterns. Creational Patterns - These design patterns provide a way to create objects while hiding the creation logic, rather than instantiating objects directly using new opreator. This gives program more flexibility in deciding which objects need to be created for a given use case. Structural Patterns - These design patterns concern class and object composition. Concept of inheritance is used to compose interfaces and define ways to compose objects to obtain new functionalities.
    [Show full text]
  • Php Foreach Array Example
    Php Foreach Array Example Positivism Sonnie always besought his dimeters if Esme is fruticose or touch-types incompletely. Sometimes anything.plenipotentiary Zane Gordieemits unobtrusively alchemise her while foreman untrained slower, Harlan but bubbliest presages Rodge obsoletely strides or pippingriotously masterfully. or recapitalizes You can have explored deep are using array_map prevents you forgot, and will keep multiple. How we have an associative array is a different values are times has a numeric array and arrays can be obtained by working along. This url into two variables are such type. PHP 4 introduced foreach construct it works only on arrays. Let's understand this with the help bear the porter example. The running one uses it. PHP foreach Manual. Sample PHP Code PHP For Loops Foreach While ago Do. Arrayvalue is your temporary variable that holds the current total item values block of code is the its of code that operates on already array values Example 1. Usually depending on my favourite site for passing it on how if statement. PHP foreach loops FreeKB. Start from any one statement is that, instead of items in an example of each elements with examples to get an array. PHP foreach within foreach repeat data flow not escaping loops. Of iteration helps you can access or public route on here? PHP foreach Loop GeeksforGeeks. Foreach Semantic portal learn smart. Nested for loops One for brother can be no inside another for purpose and force can generate different scripts using nested loops Here is an intelligence for. Here there is used in a block on array index or break statement or associative array by using a multidimensional array an.
    [Show full text]
  • Aeroscript Programming Language Reference
    AeroScript Programming Language Reference Table of Contents Table of Contents 2 Structure of a Program 5 Comments 6 Preprocessor 7 Text Replacement Macro (#define/#undef) 7 Source File Inclusion (#include) 8 Conditional Inclusion (#if/#ifdef/#ifndef) 8 Data Types and Variables 11 Fundamental Data Types 11 Fundamental Numeric Data Types 11 Fundamental String Data Type 11 Fundamental Axis Data Type 11 Fundamental Handle Data Type 12 Aggregate Data Types 12 Array Data Types 12 Structure Data Types 13 Enumerated Data Types 14 Variables 15 Variable Declaration 15 Variable Names 15 Numeric, Axis, and Handle Variable Declaration Syntax 15 String Variable Declaration Syntax 15 Syntax for Declaring Multiple Variables on the Same Line 16 Array Variable Declaration Syntax 16 Structure Variable Definition and Declaration Syntax 16 Definition Syntax 16 Declaration Syntax 17 Member Access Syntax 17 Enumeration Variable Definition and Declaration Syntax 18 Definition 18 Declaration Syntax 19 Enumerator Access Syntax 19 Variable Initialization Syntax 20 Basic Variable Initialization Syntax 20 Array Variable Initialization Syntax 21 Structure Variable Initialization Syntax 22 Enumeration Variable Initialization Syntax 22 Variable Scope 23 Controller Global Variables 23 User-Defined Variables 23 User-Defined Variable Accessibility 23 User-Defined Local Variable Declaration Location 25 Variable Data Type Conversions 26 Properties 27 Property Declaration 27 Property Names 27 Property Declaration 28 Property Usage 28 Expressions 29 Literals 29 Numeric Literals
    [Show full text]
  • Introductory Programming in C# Release 1.0
    Introductory Programming in C# Release 1.0 Andrew N. Harrington and George K. Thiruvathukal May 29, 2012 CONTENTS 1 Context 1 1.1 Introduction to the Notes.........................................1 1.2 Comments on Miles Chapter 1......................................1 2 C# Data and Operations 3 2.1 Development Tools............................................3 2.2 Lab Exercise: Editing, Compiling, and Running............................5 2.3 Comments on Miles Simple Data....................................9 2.4 Division and Remainders.........................................9 2.5 Substitutions in Console.WriteLine................................... 10 2.6 Learning to Solve Problems....................................... 12 2.7 Lab: Division Sentences......................................... 15 2.8 Homework: Grade Calculation...................................... 18 3 Defining Functions of your Own 23 3.1 Syntax Template Typography...................................... 23 3.2 A First Function Definition....................................... 23 3.3 Multiple Function Definitions...................................... 25 3.4 Function Parameters........................................... 26 3.5 Multiple Function Parameters...................................... 29 3.6 Returned Function Values........................................ 30 3.7 Two Roles: Writer and Consumer of Functions............................. 32 3.8 Local Scope............................................... 33 3.9 Static Variables.............................................
    [Show full text]
  • Designpatternsphp Documentation Release 1.0
    DesignPatternsPHP Documentation Release 1.0 Dominik Liebler and contributors Jul 18, 2021 Contents 1 Patterns 3 1.1 Creational................................................3 1.1.1 Abstract Factory........................................3 1.1.2 Builder.............................................8 1.1.3 Factory Method......................................... 13 1.1.4 Pool............................................... 18 1.1.5 Prototype............................................ 21 1.1.6 Simple Factory......................................... 24 1.1.7 Singleton............................................ 26 1.1.8 Static Factory.......................................... 28 1.2 Structural................................................. 30 1.2.1 Adapter / Wrapper....................................... 31 1.2.2 Bridge.............................................. 35 1.2.3 Composite............................................ 39 1.2.4 Data Mapper.......................................... 42 1.2.5 Decorator............................................ 46 1.2.6 Dependency Injection...................................... 50 1.2.7 Facade.............................................. 53 1.2.8 Fluent Interface......................................... 56 1.2.9 Flyweight............................................ 59 1.2.10 Proxy.............................................. 62 1.2.11 Registry............................................. 66 1.3 Behavioral................................................ 69 1.3.1 Chain Of Responsibilities...................................
    [Show full text]
  • G, a Language Based on Demand-Driven Stream Evaluations
    AN ABSTRACT OF THE THESIS OF John R. Placer for the degree of Doctor of Philosophy in Computer Science presented on November 4, 1988. Title: C: A Language Based On Demand-Driven Stream Evalutions Redacted for privacy Abstract approved: Timothy Budd A programming paradigm can be defined as a model or an approach employed in solving a problem. The results of the research described in this document demon- strate that it is possible to unite several different programming paradigms into a single linguistic framework. The imperative, procedural, applicative, lambda-free, relational, logic and object-oriented programming paradigms were combined ina language called G whose basic datatype is the stream. A stream is a data object whose values are produced as it is traversed. In this dissertation we describe the methodology we developed to guide the design of G, we present the language G itself, we discuss a prototype implementation of G and we provide example programs that show how the paradigms included in G are expressed. We also present programs that demonstrate some ways in which paradigms can be combined to facilitate the solutions to problems. G : A Language Based On Demand-Driven Stream Evaluations by John R. Placer A THESIS submitted to Oregon State University in partial fulfillment of the requirements for the degree of Doctor of Philosophy Completed November 4, 1988 Commencement June 1989 APPROVED: Redacted for privacy Professor of Computer Science in Charge of Major Redacted for privacy Head of Department of Computer Science Redacted for privacy Dean of Gradutate Sc o 1 Date thesis is presented November 4, 1988 Typed by John R.
    [Show full text]
  • Iterating in Perl: Loops
    Iterating in Perl: Loops - Computers are great for doing repetitive tasks. - All programming languages come with some way of iterating over some interval. - These methods of iteration are called ‘loops’. - Perl comes with a variety of loops, we will cover 4 of them: 1. if statement and if-else statement 2. while loop and do-while loop 3. for loop 4. foreach loop if statement Syntax: - if the conditional is ‘true’ then the if(conditional) body of the statement (what’s in { between the curly braces) is …some code… executed. } #!/usr/bin/perl -w $var1 = 1333; Output? if($var1 > 10) 1333 is greater than 10 { print “$var1 is greater than 10\n”; } exit; if-else statement Syntax: -if the conditional is ‘true’ then execute if(conditional) the code within the first pair of curly { braces. …some code… } - otherwise (else) execute the code in else the next set of curly braces { …some different code… } Output? #!/usr/bin/perl -w 13 is less than 100 $var1 = 13; if($var1 > 100) { print “$var1 is greater than 100\n”; } else { print “$var1 is less than 100\n”; } exit; Comparisons that are Allowed - In perl you can compare numbers and strings within conditionals - The comparison operators are slightly different for each one - The most common comparison operators for strings: syntax meaning example lt Less than “dog” lt “cat” False! d > c gt Greater than “dog” gt “cat” True! d > c le Less than or equal to “dog” le “cat” False! d > c ge Greater than or equal to “dog” ge “cat” True! d > c eq Equal to “cat” eq “cat” True! c = c ne Not equal to “cat” eq “Cat”
    [Show full text]
  • Coexecutability for Efficient Verification of Data Model Updates
    Coexecutability for Efficient Verification of Data Model Updates Ivan Bocic´∗, Tevfik Bultany Department of Computer Science University of California, Santa Barbara, USA ∗ [email protected] y [email protected] Abstract—Modern applications use back-end data stores for 1 class PostsController persistent data. Automated verification of the code that updates 2 def destroy_tags the data store would prevent bugs that can cause loss or 3 ... 4 posts = Post.where(id: params[:post_ids]) corruption of data. In this paper, we focus on the most challenging 5 ... part of this problem: automated verification of code that updates 6 posts.each do |p| the data store and contains loops. Due to dependencies between 7 p.tags.destroy_all! loop iterations, verification of code that contains loops is a hard 8 end problem, and typically requires manual assistance in the form of 9 ... loop invariants. We present a fully automated technique that 10 end 11 end improves verifiability of loops. We first define coexecution, a method for modeling loop iterations that simplifies automated Fig. 1. An Example Action reasoning about loops. Then, we present a fully automated static program analysis that detects whether the behavior of In our earlier work [5], we demonstrated that one can a given loop can be modeled using coexecution. We provide check invariants about the data store by translating verification a customized verification technique for coexecutable loops that queries about actions to satisfiability queries in First Order results in more effective verification. In our experiments we Logic (FOL), and then using an automated FOL theorem observed that, in 45% of cases, modeling loops using coexecution reduces verification time between 1 and 4 orders of magnitude.
    [Show full text]
  • Ultimate C#, .Net Interview Q&AE-Book
    Register your resume: www.terrafirmajobs.com _________________________________________________ www.terrafirmajobs.com Ultimate C#, .Net Interview Q&AE-book Free E-books available with Terra Firma Java Interview Q&A Terra Firma’s Interview Kit Are you stressed at your Desk Restore the rhythm of your life IT Resume writing tips Heart-Care Tips To get these free e-books, email to: [email protected] with the title of the e-book. Copy Right Note You are permitted to freely distribute/print the unmodified version of this issue/e-book/article. We are not attempting to obtain commercial benefit from the valuable work of the authors and the Editor/Publisher claims the ‘fair use’ of copyrighted material. If you think that by publishing a particular material, your copyright has been violated, please let us know. The Editor/Publisher is not responsible for statements or opinions expressed herein nor do such statements necessarily express the views of Editor/Publisher. 1 More Career Tips: http://www.terrafirmajobs.com/ITpros/IT_resources.asp?id=4 ______________________________________________________________________________ Register your resume: www.terrafirmajobs.com _________________________________________________ Index Chapter Name Page 1) C# interview Questions and Answers. 4 1.1) Advance C# interview Questions 2) General Questions 17 2.1 ) General Questions 2.2 ) Methods and Property 2.3) Assembly Questions 2.4) XML Documentation Question 2.5) Debugging and Testing 3) ADO.net and Database Question 26 4) C#, DOT NET, XML, IIS Interview Questions 28 4.1 ) Framework. 4.2 ) COM 4.3 ) OOPS 4.4 ) C# Language Features 4.5 ) Access Specifier 4.6 ) Constructor / Destructor 4.7 ) ADO.net 4.8 ) ASP.net 4.8.1) Session.
    [Show full text]
  • Functional Programming Patterns in Scala and Clojure Write Lean Programs for the JVM
    Early Praise for Functional Programming Patterns This book is an absolute gem and should be required reading for anybody looking to transition from OO to FP. It is an extremely well-built safety rope for those crossing the bridge between two very different worlds. Consider this mandatory reading. ➤ Colin Yates, technical team leader at QFI Consulting, LLP This book sticks to the meat and potatoes of what functional programming can do for the object-oriented JVM programmer. The functional patterns are sectioned in the back of the book separate from the functional replacements of the object-oriented patterns, making the book handy reference material. As a Scala programmer, I even picked up some new tricks along the read. ➤ Justin James, developer with Full Stack Apps This book is good for those who have dabbled a bit in Clojure or Scala but are not really comfortable with it; the ideal audience is seasoned OO programmers looking to adopt a functional style, as it gives those programmers a guide for transitioning away from the patterns they are comfortable with. ➤ Rod Hilton, Java developer and PhD candidate at the University of Colorado Functional Programming Patterns in Scala and Clojure Write Lean Programs for the JVM Michael Bevilacqua-Linn The Pragmatic Bookshelf Dallas, Texas • Raleigh, North Carolina Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and The Pragmatic Programmers, LLC was aware of a trademark claim, the designations have been printed in initial capital letters or in all capitals.
    [Show full text]
  • The Rule of the Big Five
    C++11: The Rule of the Big Five Resource Management The dynamic creation and destruction of objects was always one of the bugbears of C. It required the programmer to (manually) control the allocation of memory for the object, handle the object’s initialisation, then ensure that the object was safely cleaned-up after use and its memory returned to the heap. Because many C programmers weren’t educated in the potential problems (or were just plain lazy or delinquent in their programming) C got a reputation in some quarters for being an unsafe, memory-leaking language. C++ improved matters significantly by introducing an idiom known (snappily) as RAII/RRID – Resource Acquisition Is Initialisation / Resource Release Is Destruction*. The idiom makes use of the fact that every time an object is created a constructor is called; and when that object goes out of scope a destructor is called. The constructor/destructor pair can be used to create an object that automatically allocates and initialises another object (known as the managed object) and cleans up the managed object when it (the manager) goes out of scope. This mechanism is generically referred to as resource management. A resource could be any object that required dynamic creation/deletion – memory, files, sockets, mutexes, etc. Resource management frees the client from having to worry about the lifetime of the managed object, potentially eliminating memory leaks and other problems in C++ code. However, RAII/RRID doesn’t come without cost (to be fair, what does?) Introducing a ‘manager’ object can lead to potential problems – particularly if the ‘manager’ class is passed around the system (it is just another object, after all).
    [Show full text]