DOCSLIB.ORG

Xmem: Type-Safe, Transparent, Shared Memory for Cross-Runtime Communication and Coordination

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Xmem: Type-Safe, Transparent, Shared Memory for Cross-Runtime Communication and Coordination XMem: Type-Safe, Transparent, Shared Memory for Cross-Runtime Communication and Coordination Michal Wegiel Chandra Krintz Computer Science Department Univ. of California, Santa Barbara fmwegiel,[email protected] Abstract guages]: Processors – Run-Time Environments, Memory Manage- Developers commonly build contemporary enterprise applications ment (Garbage Collection), Compilers, Optimization using type-safe, component-based platforms, such as J2EE, and ar- General Terms Design, Experimentation, Languages, Manage- chitect them to comprise multiple tiers, such as a web container, ment, Measurement, Performance application server, and database engine. Administrators increas- Keywords Interprocess Communication, Managed Runtimes, ingly execute each tier in its own managed runtime environment Shared Memory, Transparent, Type-Safe, Garbage Collection, Syn- (MRE) to improve reliability and to manage system complexity chronization, Class Loading, Parallel through the fault containment and modularity offered by isolated MRE instances. Such isolation, however, necessitates expensive 1. Introduction cross-tier communication based on protocols such as object se- Developers today predominately construct modern, enterprise, rialization and remote procedure calls. Administrators commonly component-based, middleware for portable, distributed applica- co-locate communicating MREs on a single host to reduce com- tions using type-safe, object-oriented languages, such as Java, munication overhead and to better exploit increasing numbers of which users execute within managed runtime environments (MREs). available processing cores. However, state-of-the-art MREs offer These MREs typically support garbage collection (GC), dynamic no support for more efficient communication between co-located class loading, incremental compilation, as well as high-level thread- MREs, while fast inter-process communication mechanisms, such ing and synchronization primitives, among other runtime services. as shared memory, are widely available as a standard operating sys- One popular example from this application domain is JBoss, an tem service on most modern platforms. application server that provides a complete implementation of the To address this growing need, we present the design and imple- J2EE [32] specification, and that is architected on top of the Java mentation of XMem – type-safe, transparent, shared memory sup- platform [34]. port for co-located MREs. XMem guarantees type-safety through A common architectural design pattern employed by adminis- coordinated, parallel, multi-process class loading and garbage col- trators of enterprise applications is multi-tier deployment that par- lection. To avoid introducing any level of indirection, XMem ma- titions the system into independent domains, typically run using nipulates virtual memory mapping. In addition, object sharing in separate MRE instances (OS processes). Such isolation enables XMem is fully transparent: shared objects are identical to local ob- fault containment and modularity as well as more aggressive spe- jects in terms of field access, synchronization, garbage collection, cializations in the MREs (e.g., using the best-performing compila- and method invocation, with the only difference being that shared- tion strategy or garbage collection system for a particular applica- to-private pointers are disallowed. XMem facilitates easy integra- tion, set of activities, or domain). J2EE-based applications typically tion and use by existing communication technologies and software comprise at least three tiers: a web container (front-end presenta- systems, such as RMI, JNDI, JDBC, serialization/XML, and net- tion layer), an application server (business logic), and a database work sockets. engine (back-end data source) [34, 8, 60]. We have implemented XMem in the open-source, production- Multi-tier decomposition, however, necessitates expensive inter- quality HotSpot Java Virtual Machine. Our experimental evalua- process communication (IPC) between MREs (isolated compo- tion, based on core communication technologies underlying J2EE, nents). Since most general-purpose servers (e.g., web, applica- as well as using open-source server applications, indicates that tion, database) are designed for online transaction processing, in XMem significantly improves throughput and response time by which many clients perform many short transactions simultane- avoiding the overheads imposed by object serialization and network ously, communication overhead can constitute a significant portion communication. of the observed, end-to-end response time (especially when multi- ple isolation units are involved). Categories and Subject Descriptors D.3.3 [Programming Lan- To reduce the overhead of MRE IPC, administrators commonly guages]: Language Constructs and Features – Dynamic Storage co-locate multiple tiers on a single machine. Co-location simpli- Management, Classes and Objects; D.3.4 [Programming Lan- fies administration and configuration, enables efficient use of local network communication for IPC, and makes better use of multi- Permission to make digital or hard copies of all or part of this work for personal or processor architectures through increased thread-level parallelism. classroom use is granted without fee provided that copies are not made or distributed Emerging multi- and many-core systems are likely to make MRE for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute co-location increasingly commonplace. to lists, requires prior specific permission and/or a fee. Cross-MRE IPC mechanisms cannot depend on co-location, PLDI'08, June 7–13, 2008, Tucson, Arizona, USA. however, since MREs may alternatively be distributed across differ- Copyright c 2008 ACM 978-1-59593-860-2/08/06. $5.00 ent cluster nodes or be migrated to achieve load balancing and more effective utilization of server resources, an increasingly important low virtual XMem MRE Virtual Address Space (VAS) high virtual operation in virtualizing systems today [44, 47, 57]. Thus, MRE addresses addresses IPC employs high-overhead implementations of standard commu- MRE App. LC !C SHM Shared App. MRE nication protocols, such as remote procedure calls and object seri- Heap Heap Meta #$%ects Stac" Stac" alization, regardless of the proximity of the communicating MREs. We introduce support for transparent and type-safe, cross-MRE communication and coordination, called XMem. XMem is an IPC mechanism that enables object sharing between MREs co-located on the same machine and communication via extant distributed XMem protocols when physically separated. XMem is transparent in that MRE VAS shared objects are the same as unshared objects (in terms of field access, synchronization, GC, and method invocation, among oth- ers), except that XMem disallows pointers from shared objects into MRE a&d XMem Co'located MRE a&d XMem MRE-private storage. To enable efficient object sharing, XMem App. !lo$al#p MREs App. !lo$al#p manipulates virtual memory mapping to avoid indirection, i.e., all hreads hread hreads hread object references in the system are direct. Moreover, existing com- munication technologies, e.g., those employed by J2EE or network Figure 1. Co-located XMem MREs, and their virtual address sockets, can use XMem without application modification. spaces (VAS), that are attached to a shared memory segment XMem guarantees type-safety by ensuring that the MREs em- (gray area). The shared region contains meta-data (SHM-Meta) ploy the same types for shared objects when the communication and shared objects and is mapped at the same virtual address in medium is shared memory. XMem is also compatible with core each MRE. The GlobalOp thread in each MRE performs infrequent MRE services such as GC, dynamic class loading, and thread syn- global operations that XMem synchronizes across attached MREs. chronization. XMem coordinates MREs through infrequent, syn- chronized global operations that include GC and class loading. In summary, we make the following contributions with this work: of all attached MREs. Figure 1 depicts an example instance of an XMem system. Two MREs attach to the same shared mem- Improved integration of MREs with the underlying system. ory segment (gray area of the VAS) to share objects. We refer to • XMem provides a new, efficient communication mechanism the VAS of each MRE that is not mapped to the shared memory while maintaining standard, portable interaction with the lower- segment (white area of the VAS) as MRE-private. XMem systems level layers of the software/hardware stack. share per-instance, non-static data only – static (per-class) data is Direct object sharing via isolated channels between co-located MRE-private since static fields typically record program-specific • MREs isolated as distinct OS processes that avoids the trade- or MRE-specific state. Sharing of such fields can violate both type offs inherent to previous approaches [17, 4] by enabling com- safety and inter-process resource isolation. munication without serialization and data copying. Since we map shared memory to the same virtual address in all MREs, objects within the shared memory have the same addresses Extensions to the MRE services and abstractions, including • in all MREs. To guarantee memory and type safety, we disallow parallel, cross-process class loading and garbage collection. pointers from shared objects to private objects via a write barrier XMem implements
Load more

Recommended publications
  • Gnu Smalltalk Library Reference Version 3.2.5 24 November 2017
    gnu Smalltalk Library Reference Version 3.2.5 24 November 2017 by Paolo Bonzini Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. A copy of the license is included in the section entitled \GNU Free Documentation License". 1 3 1 Base classes 1.1 Tree Classes documented in this manual are boldfaced. Autoload Object Behavior ClassDescription Class Metaclass BlockClosure Boolean False True CObject CAggregate CArray CPtr CString CCallable CCallbackDescriptor CFunctionDescriptor CCompound CStruct CUnion CScalar CChar CDouble CFloat CInt CLong CLongDouble CLongLong CShort CSmalltalk CUChar CByte CBoolean CUInt CULong CULongLong CUShort ContextPart 4 GNU Smalltalk Library Reference BlockContext MethodContext Continuation CType CPtrCType CArrayCType CScalarCType CStringCType Delay Directory DLD DumperProxy AlternativeObjectProxy NullProxy VersionableObjectProxy PluggableProxy SingletonProxy DynamicVariable Exception Error ArithmeticError ZeroDivide MessageNotUnderstood SystemExceptions.InvalidValue SystemExceptions.EmptyCollection SystemExceptions.InvalidArgument SystemExceptions.AlreadyDefined SystemExceptions.ArgumentOutOfRange SystemExceptions.IndexOutOfRange SystemExceptions.InvalidSize SystemExceptions.NotFound SystemExceptions.PackageNotAvailable SystemExceptions.InvalidProcessState SystemExceptions.InvalidState
    [Show full text]
  • Secure the Clones - Static Enforcement of Policies for Secure Object Copying Thomas Jensen, Florent Kirchner, David Pichardie
    Secure the Clones - Static Enforcement of Policies for Secure Object Copying Thomas Jensen, Florent Kirchner, David Pichardie To cite this version: Thomas Jensen, Florent Kirchner, David Pichardie. Secure the Clones - Static Enforcement of Policies for Secure Object Copying. ESOP 2011, 2011, Saarbrucken, Germany. hal-01110817 HAL Id: hal-01110817 https://hal.inria.fr/hal-01110817 Submitted on 28 Jan 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Secure the Clones * Static Enforcement of Policies for Secure Object Copying Thomas Jensen, Florent Kirchner, and David Pichardie INRIA Rennes – Bretagne Atlantique, France [email protected] Abstract. Exchanging mutable data objects with untrusted code is a delicate matter because of the risk of creating a data space that is accessible by an attacker. Consequently, secure programming guidelines for Java stress the importance of using defensive copying before accepting or handing out references to an inter- nal mutable object. However, implementation of a copy method (like clone()) is entirely left to the programmer. It may not provide a sufficiently deep copy of an object and is subject to overriding by a malicious sub-class. Currently no language-based mechanism supports secure object cloning.
    [Show full text]
  • Lazy Object Copy As a Platform for Population-Based Probabilistic Programming
    Lazy object copy as a platform for population-based probabilistic programming Lawrence M. Murray Uber AI Abstract This work considers dynamic memory management for population-based probabilistic programs, such as those using particle methods for inference. Such programs exhibit a pattern of allocating, copying, potentially mutating, and deallocating collections of similar objects through successive generations. These objects may assemble data structures such as stacks, queues, lists, ragged arrays, and trees, which may be of random, and possibly unbounded, size. For the simple case of N particles, T generations, D objects, and resampling at each generation, dense representation requires O(DNT ) memory, while sparse representation requires only O(DT + DN log DN) memory, based on existing theoretical results. This work describes an object copy-on-write platform to automate this saving for the programmer. The core idea is formalized using labeled directed multigraphs, where vertices represent objects, edges the pointers between them, and labels the necessary bookkeeping. A specific labeling scheme is proposed for high performance under the motivating pattern. The platform is implemented for the Birch probabilistic programming language, using smart pointers, hash tables, and reference-counting garbage collection. It is tested empirically on a number of realistic probabilistic programs, and shown to significantly reduce memory use and execution time in a manner consistent with theoretical expectations. This enables copy-on-write for the imperative programmer, lazy deep copies for the object-oriented programmer, and in-place write optimizations for the functional programmer. 1 Introduction Probabilistic programming aims at better accommodating the workflow of probabilistic modeling and inference in general-purpose programming languages.
    [Show full text]
  • Concurrent Copying Garbage Collection with Hardware Transactional Memory
    Concurrent Copying Garbage Collection with Hardware Transactional Memory Zixian Cai 蔡子弦 A thesis submitted in partial fulfilment of the degree of Bachelor of Philosophy (Honours) at The Australian National University November 2020 © Zixian Cai 2020 Typeset in TeX Gyre Pagella, URW Classico, and DejaVu Sans Mono by XƎTEX and XƎLATEX. Except where otherwise indicated, this thesis is my own original work. Zixian Cai 12 November 2020 To 2020, what does not kill you makes you stronger. Acknowledgments First and foremost, I thank my shifu1, Steve Blackburn. When I asked you how to learn to do research, you said that it often takes the form of an apprenticeship. Indeed, you taught me the craft of research by example, demonstrating how to be a good teacher, a good researcher, and a good community leader. Apart from the vast technical ex- pertise, you have also been a constant source of advice, support, and encouragement throughout my undergraduate career. I could not ask for a better mentor. I thank Mike Bond from The Ohio State University, who co-supervises me. Meet- ings with you and Steve are always enjoyable for me. I am sorry for the meetings that went over time, often around the dinner time for you, lowering your glucose level. You help me turn complicated ideas into implementation with your experiences in hard- ware transactional memory. I am thankful for your patient guidance and inspiration. Many people have helped me with this thesis. I thank Adrian Herrera, Kunal Sa- reen, and Brenda Wang for subjecting themselves to the draft of this document, and providing valuable feedback.
    [Show full text]
  • Obstacl: a Language with Objects, Subtyping, and Classes
    OBSTACL: A LANGUAGE WITH OBJECTS, SUBTYPING, AND CLASSES A DISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY By Amit Jayant Patel December 2001 c Copyright 2002 by Amit Jayant Patel All Rights Reserved ii I certify that I have read this dissertation and that in my opin- ion it is fully adequate, in scope and quality, as a dissertation for the degree of Doctor of Philosophy. John Mitchell (Principal Adviser) I certify that I have read this dissertation and that in my opin- ion it is fully adequate, in scope and quality, as a dissertation for the degree of Doctor of Philosophy. Kathleen Fisher I certify that I have read this dissertation and that in my opin- ion it is fully adequate, in scope and quality, as a dissertation for the degree of Doctor of Philosophy. David Dill Approved for the University Committee on Graduate Studies: iii Abstract Widely used object-oriented programming languages such as C++ and Java support soft- ware engineering practices but do not have a clean theoretical foundation. On the other hand, most research languages with well-developed foundations are not designed to support software engineering practices. This thesis bridges the gap by presenting OBSTACL, an object-oriented extension of ML with a sound theoretical basis and features that lend themselves to efficient implementation. OBSTACL supports modular programming techniques with objects, classes, structural subtyping, and a modular object construction system. OBSTACL's parameterized inheritance mechanism can be used to express both single inheritance and most common uses of multiple inheritance.
    [Show full text]
  • Lecture 8 EECS 498 Winter 2000
    C++ Object Model Classes are abstract types. Objects are instances of that type. Three distinctive aspects of an OO System • Encapsulation Classes group related data and methods • Inheritance Derived classes extend and refine existing abstractions ... the design of consistent, intuitive, and useful class hierarchies is a complex and difficult art. • Dynamic Binding (polymorphism) Delay selection of appropriate abstraction implementation until program execution. ... OO programming is abstract data types with polymorphism C++ Object Model 1 of 19 Lecture 8 EECS 498 Winter 2000 Aspects to Examine • Distinctive Types of Programming • Semantics of Constructors • Semantics of Data • Semantics of Functions • Semantics of Construction, Destruction & Copy C++ Object Model 2 of 19 Lecture 8 EECS 498 Winter 2000 Distinctive Types of Programming • Procedural char *target, *source = “Hello World!”; target = malloc( strlen( source )); strcpy( target, source ); • Abstract Data Type String target, source = “Hello World!”; target = source; if (source == target) ... • Object Oriented class B { virtual int F(int) {return 1;} /* pure? /; } class D : B { virtual void F(int) { return 2;} } class E : B { virtual void F(int) { return 3;} } ... B *b = new B, B *d = new D, E *e = new D; cout << b->F() << d->F() << e->F() << endl; Object oriented model requires reference to operating object. Referred to as this (self, current, etc.) Often first parameter to function C++ Object Model 3 of 19 Lecture 8 EECS 498 Winter 2000 Storage Layout Procedural • Storage sizes are known at compile time Pointers have fixed size on target platform Data namespace encapsulated in type structure Function namespace global Abstract Data Types • Namespace for functions bound to data structure Signature of function is name, result type, parameter types Object Oriented • Virtual functions invocation structure Virtual base classes A virtual base class occurs exactly once in a derived class regardless of the number of times encountered in the class inheritance heirarchy.
    [Show full text]
  • SECURE the CLONES 1. Introduction Exchanging Data Objects with Untrusted Code Is a Delicate Matter Because of the Risk of Creati
    Logical Methods in Computer Science Vol. 8 (2:05) 2012, pp. 1–30 Submitted Sep. 17, 2011 www.lmcs-online.org Published May. 31, 2012 SECURE THE CLONES THOMAS JENSEN, FLORENT KIRCHNER, AND DAVID PICHARDIE INRIA Rennes { Bretagne Atlantique, France e-mail address: fi[email protected] Abstract. Exchanging mutable data objects with untrusted code is a delicate matter be- cause of the risk of creating a data space that is accessible by an attacker. Consequently, secure programming guidelines for Java stress the importance of using defensive copying before accepting or handing out references to an internal mutable object. However, im- plementation of a copy method (like clone()) is entirely left to the programmer. It may not provide a sufficiently deep copy of an object and is subject to overriding by a mali- cious sub-class. Currently no language-based mechanism supports secure object cloning. This paper proposes a type-based annotation system for defining modular copy policies for class-based object-oriented programs. A copy policy specifies the maximally allowed sharing between an object and its clone. We present a static enforcement mechanism that will guarantee that all classes fulfil their copy policy, even in the presence of overriding of copy methods, and establish the semantic correctness of the overall approach in Coq. The mechanism has been implemented and experimentally evaluated on clone methods from several Java libraries. 1. Introduction Exchanging data objects with untrusted code is a delicate matter because of the risk of creating a data space that is accessible by an attacker. Consequently, secure programming guidelines for Java such as those proposed by Sun [17] and CERT [6] stress the importance of using defensive copying or cloning before accepting or handing out references to an internal mutable object.
    [Show full text]
  • Memory Management for Multi-Language Multi-Runtime Systems on Multi-Core Architectures
    UNIVERSITY OF CALIFORNIA Santa Barbara Memory Management for Multi-Language Multi-Runtime Systems on Multi-Core Architectures A Dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science by Michal Wegiel Committee in Charge: Professor Chandra Krintz, Chair Professor Amr El Abbadi Professor Ben Zhao March 2011 The Dissertation of Michal Wegiel is approved: Professor Amr El Abbadi Professor Ben Zhao Professor Chandra Krintz, Committee Chairperson January 2011 Memory Management for Multi-Language Multi-Runtime Systems on Multi-Core Architectures Copyright © 2011 by Michal Wegiel iii Dedication and Gratitude I dedicate this dissertation to my family: my parents, Maria and Krzysztof, and my sister, Barbara, for their unconditional support and encouragement throughout all stages of my education. I am deeply grateful to Chandra Krintz for all the support, guidance, mentorship, and help that she has provided during the entire process. I would like to thank Ben Zhao, Amr El Abbadi, and Rich Wolski for serving on my Ph.D. committee. I am grateful to Grzegorz Czajkowski and Laurent Daynes for being my mentors and collaborators during my internship at Sun Labs. Finally, I would like to thank the staff, faculty, and fellow graduate students at the Com- puter Science department at UC Santa Barbara for their support and the opportunity to pursue this work. iv Acknowledgements The text of Chapters 3–7 is in part a reprint of the material as it appears in the conference proceedings listed below. The dissertation author was the primary researcher while the co-author listed on each publication directed and supervised the research which forms the basis for these chapters.
    [Show full text]
  • Objective-C 2.0 Essentials Third Edition
    Objective-C 2.0 Essentials Third Edition i Objective-C 2.0 Essentials – Third Edition ISBN-13: 978-1480262102 © 2012 Neil Smyth. This book is provided for personal use only. Unauthorized use, reproduction and/or distribution strictly prohibited. All rights reserved. The content of this book is provided for informational purposes only. Neither the publisher nor the author offers any warranties or representation, express or implied, with regard to the accuracy of information contained in this book, nor do they accept any liability for any loss or damage arising from any errors or omissions. This book contains trademarked terms that are used solely for editorial purposes and to the benefit of the respective trademark owner. The terms used within this book are not intended as infringement of any trademarks. Find more eBooks online at http://www.eBookFrenzy.com. Rev. 3.0 ii Table of Contents 1. About Objective-C Essentials ...................................................................................................... 1 1.1 Why are you reading this? .................................................................................................... 1 1.2 Supported Platforms ............................................................................................................. 2 2. The History of Objective-C .......................................................................................................... 3 2.1 The C Programming Language .............................................................................................
    [Show full text]
  • Memory Management Programming Guide
    Memory Management Programming Guide Performance 2010-06-24 PROVIDED “AS IS,” AND YOU, THE READER, ARE ASSUMING THE ENTIRE RISK AS TO ITS QUALITY Apple Inc. AND ACCURACY. © 2010 Apple Inc. IN NO EVENT WILL APPLE BE LIABLE FOR DIRECT, All rights reserved. INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES RESULTING FROM ANY DEFECT OR INACCURACY IN THIS DOCUMENT, even No part of this publication may be reproduced, if advised of the possibility of such damages. stored in a retrieval system, or transmitted, in THE WARRANTY AND REMEDIES SET FORTH ABOVE any form or by any means, mechanical, ARE EXCLUSIVE AND IN LIEU OF ALL OTHERS, ORAL OR WRITTEN, EXPRESS OR IMPLIED. No Apple electronic, photocopying, recording, or dealer, agent, or employee is authorized to make otherwise, without prior written permission of any modification, extension, or addition to this Apple Inc., with the following exceptions: Any warranty. person is hereby authorized to store Some states do not allow the exclusion or limitation of implied warranties or liability for incidental or documentation on a single computer for consequential damages, so the above limitation or personal use only and to print copies of exclusion may not apply to you. This warranty gives you specific legal rights, and you may also have documentation for personal use provided that other rights which vary from state to state. the documentation contains Apple’s copyright notice. The Apple logo is a trademark of Apple Inc. Use of the “keyboard” Apple logo (Option-Shift-K) for commercial purposes without the prior written consent of Apple may constitute trademark infringement and unfair competition in violation of federal and state laws.
    [Show full text]
  • Life with Object-Relational Mappers Or, How I Learned to Stop Worrying and Love the ORM
    Life with Object-Relational Mappers Or, how I learned to stop worrying and love the ORM. PGCon 2011 Christophe Pettus PostgreSQL Experts, Inc. [email protected] Has this ever happened to you? • “This query is running way too slowly. God, RDBMSes suck!” • “Well, you just need to change the WHERE clause…” • “I can’t change the SQL. We’re using an…” ORM Let’s talk about ORMs. • What is an ORM? • Why do we have to put up with them? • What are they good at? • What are the problems? • Can’t we just make them go away? • No. Sorry. • How can we live with them? Oh, right. Hi! • Christophe Pettus • Consultant with PostgreSQL Experts, Inc. • PostgreSQL person since 1998. • Application and systems architect. • Designed a bunch of ORMs for various languages. WHEN WORLDS COLLIDE. The Two Worlds • Object-Oriented Programming. • Relational Database Management. Object-Oriented Programming. • Let’s ask Wikipedia! • “Object-oriented programming (OOP) is a programming paradigm using ‘objects’ …” • Ask three programmers, get five answers. • “… – data structures consisting of data fields and methods together with their interactions – to design applications and computer programs.” What is the critical OO feature? • Data abstraction? Nope. • Messaging? Nope. • Modularity? Nope. • Polymorphism? Nope, but getting warmer. • Inheritance? Getting colder… • Encapsulation. Encapsulation • Objects export behavior, not data. • Many language expose the data — but that’s a shortcut. • Many objects don’t have significant behavior — but that’s a degenerate case. • OO is all about wrapping up the behavior and the data into a single package, the object. Object Relationships. • Object models are collections of graphs.
    [Show full text]
  • Important Java Programming Concepts
    Appendix A Important Java Programming Concepts This appendix provides a brief orientation through the concepts of object-oriented programming in Java that are critical for understanding the material in this book and that are not specifically introduced as part of the main content. It is not intended as a general Java programming primer, but rather as a refresher and orientation through the features of the language that play a major role in the design of software in Java. If necessary, this overview should be complemented by an introductory book on Java programming, or on the relevant sections in the Java Tutorial [10]. A.1 Variables and Types Variables store values. In Java, variables are typed and the type of the variable must be declared before the name of the variable. Java distinguishes between two major categories of types: primitive types and reference types. Primitive types are used to represent numbers and Boolean values. Variables of a primitive type store the actual data that represents the value. When the content of a variable of a primitive type is assigned to another variable, a copy of the data stored in the initial variable is created and stored in the destination variable. For example: int original = 10; int copy = original; In this case variable original of the primitive type int (short for “integer”) is assigned the integer literal value 10. In the second assignment, a copy of the value 10 is used to initialize the new variable copy. Reference types represent more complex arrangements of data as defined by classes (see Section A.2).
    [Show full text]