DOCSLIB.ORG

Design Automation for Integrated Optics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Design Automation for Integrated Optics DESIGN AUTOMATION FOR INTEGRATED OPTICS by Christopher Condrat A dissertation submitted to the faculty of The University of Utah in partial fulfillment of the requirements for the degree of Doctor of Philosophy Department of Electrical and Computer Engineering The University of Utah August 2014 Copyright © Christopher Condrat 2014 All Rights Reserved The University of Utah Graduate School STATEMENT OF DISSERTATION APPROVAL The dissertation of Christopher Condrat has been approved by the following supervisory committee members: Priyank Kalla , Chair 12 / 18 / 2013 Date Approved Steven Blair , Member 12 / 18 / 2013 Date Approved Chris Myers , Member 12 / 18 / 2013 Date Approved Kenneth Stevens , Member 12 / 18 / 2013 Date Approved Erik Brunvand , Member 12 / 18 / 2013 Date Approved and by Gianluca Lazzi , Chair/Dean of the Department/College/School of Electrical and Computer Engineering and by David B. Kieda, Dean of The Graduate School. ABSTRACT Recent breakthroughs in silicon photonics technology are enabling the integration of optical devices into silicon-based semiconductor processes. Photonics technology enables high-speed, high-bandwidth, and high-fidelity communications on the chip-scale—an important development in an increasingly communications-oriented semiconductor world. Significant developments in silicon photonic manufacturing and integration are also enabling investigations into applications beyond that of traditional telecom: sensing, filtering, signal processing, quantum technology—and even optical computing. In effect, we are now seeing a convergence of communications and computation, where the traditional roles of optics and microelectronics are becoming blurred. As the applications for opto-electronic integrated circuits (OEICs) are developed, and manufac- turing capabilities expand, design support is necessary to fully exploit the potential of this optics technology. Such design support for moving beyond custom-design to automated synthesis and opti- mization is not well developed. Scalability requires abstractions, which in turn enables and requires the use of optimization algorithms and design methodology flows. Design automation represents an opportunity to take OEIC design to a larger scale, facilitating design-space exploration, and laying the foundation for current and future optical applications—thus fully realizing the potential of this technology. This dissertation proposes design automation for integrated optic system design. Using a building- block model for optical devices, we provide an EDA-inspired design flow and methodologies for op- tical design automation. Underlying these flows and methodologies are new supporting techniques in behavioral and physical synthesis, as well as device-resynthesis techniques for thermal-aware system integration. We also provide modeling for optical devices and determine optimization and constraint parameters that guide the automation techniques. Our techniques and methodologies are then applied to the design and optimization of optical circuits and devices. Experimental results are analyzed to evaluate their efficacy. We conclude with discussions on the contributions and limitations of the approaches in the context of optical design automation, and describe the tremendous opportunities for future research in design automation for integrated optics. This work is dedicated to my parents. CONTENTS ABSTRACT .......................................................... iii ACKNOWLEDGEMENTS .............................................. viii CHAPTERS 1. INTRODUCTION .................................................. 1 1.1 Developments in CMOS and Microphotonics . ........................... 2 1.2 ElectronicDesignAutomation......................................... 5 1.2.1 BehavioralSynthesis............................................ 5 1.2.2 PhysicalSynthesis............................................. 6 1.3 Proposed Design Flow . ............................................. 7 1.3.1 Thermal-AwareResynthesis...................................... 8 1.4 ContributionsofThisDissertation...................................... 9 1.4.1 ThesisOrganization............................................ 10 2. INTEGRATED OPTICS PRELIMINARIES .............................. 15 2.1 PropagationofLightinWaveguides..................................... 15 2.2 IntegratedOpticSystems............................................. 17 2.3 Conclusion....................................................... 18 3. BEHAVIORAL SYNTHESIS ......................................... 22 3.1 Modeling Mach–Zehnder Interferometers . ........................... 22 3.2 OurDeviceModel.................................................. 23 3.3 PreviousWorkinIntegratedPhotonicLogic............................... 23 3.4 FirstAttemptsandCrossbarLogicForms ................................ 24 3.5 BDD-BasedDesign................................................. 26 3.5.1 SalientFeatures............................................... 26 3.6 VirtualGate-BasedDesign............................................ 27 3.6.1 SalientFeatures............................................... 28 3.6.2 ExpressionSharing............................................. 28 3.7 XOR-BasedCommonSubexpressionExtraction........................... 29 3.7.1 XOR-BasedExpressionSharing................................... 29 3.7.2 MotivatingExample............................................ 30 3.7.3 Limitations of Contemporary XOR-Based Synthesis Techniques . ......... 30 3.8 Multi-Output Expression Sharing . .................................. 31 3.9 ExperimentalResults................................................ 32 3.9.1 Limitations . ............................................. 33 3.10ApplicationtoaFabricatedDesign ..................................... 33 3.11ConclusionandFutureWork.......................................... 33 4. PHYSICAL SYNTHESIS METHODOLOGY FOR INTEGRATED OPTICS ..... 44 4.1 PreviousWork..................................................... 44 4.1.1 Motivation................................................... 45 4.2 DesignConstraints ................................................. 45 4.2.1 SignalPower ................................................. 46 4.2.2 SOIWaveguides............................................... 46 4.2.3 Area........................................................ 46 4.3 Methodology . .................................................... 47 4.4 Device Placement . ............................................. 47 4.5 WaveguideRouting................................................. 48 4.5.1 GlobalRouting................................................ 48 4.5.2 ChannelRouting............................................... 48 4.6 DesignRules:RoutingGridRealization ................................. 48 4.6.1 MappingRoutingGridstoWaveguides.............................. 48 4.7 Conclusion....................................................... 49 5. GLOBAL ROUTING FOR INTEGRATED OPTICS ....................... 53 5.1 GlobalRoutingProblemFormulation ................................... 53 5.2 PreviousandContemporaryWork...................................... 54 5.3 Routing Using Mixed Integer Linear Programming . ....................... 54 5.3.1 MILP Formulation ............................................. 55 5.3.2 Grid-EdgeCapacityConstraints................................... 55 5.3.3 RouteCostConstraints.......................................... 55 5.3.4 MinimizationFunction.......................................... 56 5.3.5 RoutePre-Analysis............................................. 56 5.3.6 InterrouteLosses .............................................. 57 5.4 Results.......................................................... 59 5.4.1 Global Routing in a Full Adder Design . ........................... 59 5.5 Conclusion....................................................... 59 6. CHANNEL ROUTING FOR INTEGRATED OPTICS ...................... 64 6.1 ProblemFormulation................................................ 64 6.1.1 Optimization Objective . ......................................... 65 6.1.2 ContributionsofThisWork....................................... 65 6.1.3 PreviousWork................................................ 66 6.2 Non-ManhattanGrid,Sorting-BasedRouting.............................. 66 6.2.1 Crossing Minimality . ......................................... 67 6.2.2 Sorting-BasedChannelRouting................................... 67 6.2.3 EncodingSide-OnlyNets........................................ 68 6.2.4 B-netEncoding................................................ 68 6.2.5 T-netEncoding................................................ 68 6.2.6 Limitations of Swap Router . .................................. 69 6.2.7 GapsintheSortingProblem...................................... 69 6.2.8 T-netEncoding................................................ 69 6.2.9 Postprocessing................................................ 70 6.3 2-SidedSwapRouting(2Swap)........................................ 70 6.3.1 GapCrossing................................................. 70 6.3.2 Two-SidedSwap-Routing........................................ 71 6.3.3 PostsortRouting............................................... 71 vi 6.3.4 Solution Quality . ............................................. 72 6.4 Constrained2-SidedSwapRouting..................................... 72 6.4.1 ConvergenceConstraintandSwappingRestrictions..................... 73 6.4.2 HorizontalSpansandCrossings................................... 73 6.4.3
Load more

Recommended publications
  • The C Programming Language
    The C programming Language The C programming Language By Brian W. Kernighan and Dennis M. Ritchie. Published by Prentice-Hall in 1988 ISBN 0-13-110362-8 (paperback) ISBN 0-13-110370-9 Contents ● Preface ● Preface to the first edition ● Introduction 1. Chapter 1: A Tutorial Introduction 1. Getting Started 2. Variables and Arithmetic Expressions 3. The for statement 4. Symbolic Constants 5. Character Input and Output 1. File Copying 2. Character Counting 3. Line Counting 4. Word Counting 6. Arrays 7. Functions 8. Arguments - Call by Value 9. Character Arrays 10. External Variables and Scope 2. Chapter 2: Types, Operators and Expressions 1. Variable Names 2. Data Types and Sizes 3. Constants 4. Declarations http://freebooks.by.ru/view/CProgrammingLanguage/kandr.html (1 of 5) [5/15/2002 10:12:59 PM] The C programming Language 5. Arithmetic Operators 6. Relational and Logical Operators 7. Type Conversions 8. Increment and Decrement Operators 9. Bitwise Operators 10. Assignment Operators and Expressions 11. Conditional Expressions 12. Precedence and Order of Evaluation 3. Chapter 3: Control Flow 1. Statements and Blocks 2. If-Else 3. Else-If 4. Switch 5. Loops - While and For 6. Loops - Do-While 7. Break and Continue 8. Goto and labels 4. Chapter 4: Functions and Program Structure 1. Basics of Functions 2. Functions Returning Non-integers 3. External Variables 4. Scope Rules 5. Header Files 6. Static Variables 7. Register Variables 8. Block Structure 9. Initialization 10. Recursion 11. The C Preprocessor 1. File Inclusion 2. Macro Substitution 3. Conditional Inclusion 5. Chapter 5: Pointers and Arrays 1.
    [Show full text]
  • Reducing State Explosion for Software Model Checking with Relaxed Mcms 3 We Do Not Distinguish the Framework from Its Implementation and Refer to Both As Mc- SPIN
    Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models Tatsuya Abe1, Tomoharu Ugawa2, Toshiyuki Maeda1, and Kousuke Matsumoto2 1 {abet,tosh}@stair.center STAIR Lab, Chiba Institute of Technology 2 {ugawa,matsumoto}@plas.info.kochi-tech.ac.jp Kochi University of Technology Abstract. Software model checking suffers from the so-called state explosion problem, and relaxed memory consistency models even worsen this situation. What is worse, parameterizing model checking by memory consistency mod- els, that is, to make the model checker as flexible as we can supply definitions of memory consistency models as an input, intensifies state explosion. This pa- per explores specific reasons for state explosion in model checking with multi- ple memory consistency models, provides some optimizations intended to mit- igate the problem, and applies them to McSPIN, a model checker for memory consistency models that we are developing. The effects of the optimizations and the usefulness of McSPIN are demonstrated experimentally by verifying copying protocols of concurrent copying garbage collection algorithms. To the best of our knowledge, this is the first model checking of the concurrent copying protocols under relaxed memory consistency models. Keywords: software model checking; relaxed memory consistency models; state explosion; reordering of instructions; integration of states; concurrent copying garbage collection 1 Introduction Modern computing systems are based on concurrent/parallel processing designs for their performance advantages, and programs therefore must also be written to exploit these designs. However, writing such programs is quite difficult and error-prone, be- cause humans cannot exhaustively consider the behaviors of computers very well. One approach to this problem is to use software model checking, in which all possible states that can be reached during a program’sexecutionare explored.Many such model check- ers have been developed (e.g., [12,18,26,25,7,8]).
    [Show full text]
  • The C Programming Language
    The C programming Language By Brian W. Kernighan and Dennis M. Ritchie. Published by Prentice-Hall in 1988 ISBN 0-13-110362-8 (paperback) ISBN 0-13-110370-9 Contents Preface Preface to the first edition Introduction 1. Chapter 1: A Tutorial Introduction 1. Getting Started 2. Variables and Arithmetic Expressions 3. The for statement 4. Symbolic Constants 5. Character Input and Output 1. File Copying 2. Character Counting 3. Line Counting 4. Word Counting 6. Arrays 7. Functions 8. Arguments - Call by Value 9. Character Arrays 10. External Variables and Scope 2. Chapter 2: Types, Operators and Expressions 1. Variable Names 2. Data Types and Sizes 3. Constants 4. Declarations 5. Arithmetic Operators 6. Relational and Logical Operators 7. Type Conversions 8. Increment and Decrement Operators 9. Bitwise Operators 10. Assignment Operators and Expressions 11. Conditional Expressions 12. Precedence and Order of Evaluation 3. Chapter 3: Control Flow 1. Statements and Blocks 2. If-Else 3. Else-If 4. Switch 5. Loops - While and For 6. Loops - Do-While 7. Break and Continue 8. Goto and labels 4. Chapter 4: Functions and Program Structure 1. Basics of Functions 2. Functions Returning Non-integers 3. External Variables 4. Scope Rules 5. Header Files 6. Static Variables 7. Register Variables 8. Block Structure 9. Initialization 10. Recursion 11. The C Preprocessor 1. File Inclusion 2. Macro Substitution 3. Conditional Inclusion 5. Chapter 5: Pointers and Arrays 1. Pointers and Addresses 2. Pointers and Function Arguments 3. Pointers and Arrays 4. Address Arithmetic 5. Character Pointers and Functions 6. Pointer Arrays; Pointers to Pointers 7.
    [Show full text]
  • The POWER4 Processor Introduction and Tuning Guide
    Front cover The POWER4 Processor Introduction and Tuning Guide Comprehensive explanation of POWER4 performance Includes code examples and performance measurements How to get the most from the compiler Steve Behling Ron Bell Peter Farrell Holger Holthoff Frank O’Connell Will Weir ibm.com/redbooks International Technical Support Organization The POWER4 Processor Introduction and Tuning Guide November 2001 SG24-7041-00 Take Note! Before using this information and the product it supports, be sure to read the general information in “Special notices” on page 175. First Edition (November 2001) This edition applies to AIX 5L for POWER Version 5.1 (program number 5765-E61), XL Fortran Version 7.1.1 (5765-C10 and 5765-C11) and subsequent releases running on an IBM ^ pSeries POWER4-based server. Unless otherwise noted, all performance values mentioned in this document were measured on a 1.1 GHz machine, then normalized to 1.3 GHz. Note: This book is based on a pre-GA version of a product and may not apply when the product becomes generally available. We recommend that you consult the product documentation or follow-on versions of this redbook for more current information. Comments may be addressed to: IBM Corporation, International Technical Support Organization Dept. JN9B Building 003 Internal Zip 2834 11400 Burnet Road Austin, Texas 78758-3493 When you send information to IBM, you grant IBM a non-exclusive right to use or distribute the information in any way it believes appropriate without incurring any obligation to you. © Copyright International Business Machines Corporation 2001. All rights reserved. Note to U.S Government Users – Documentation related to restricted rights – Use, duplication or disclosure is subject to restrictions set forth in GSA ADP Schedule Contract with IBM Corp.
    [Show full text]
  • Shared-Variable Synchronization Approaches for Dynamic Dataflow
    Shared-variable synchronization approaches for dynamic dataflow programs Apostolos Modas1, Simone Casale-Brunet2, Robert Stewart3, Endri Bezati2, Junaid Ahmad4∗, Marco Mattavelli1 1EPFL SCI STI MM, Ecole´ Polytechnique Fed´ erale´ de Lausanne, Switzerland 2SIB Swiss Institute of Bioinformatics, Lausanne, Switzerland 3Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, United Kingdom 4J Nomics, Manchester, United Kingdom Abstract—This paper presents shared-variable synchronization architectural components with low-level, target specific code approaches for dataflow programming. The mechanisms do not synthesis. require any substantial model of computation (MoC) modifi- By relying on isolation and non-sharing, an actor can access cation, and is portable across both for hardware (HW) and software (SW) low-level code synthesis. With the shared-variable its own state without fear of data-races. The approach can formalization, the benefits of the dataflow MoC are maintained, introduce inefficiencies in generated code, e.g. allocations however the space and energy efficiency of an application can be causing high memory use, and high levels of actor idle time significantly improved. The approach targets Dynamic Process whilst data is explicitly copied. As an example, in the context Network (DPN) dataflow applications, thus making them also of video compression, the output data generally depends on suitable for less expressive models e.g. synchronous and cyclo- static dataflow that DPN subsumes. The approach is validated intermediate data structures that different actors are obliged to through the analysis and optimization of a High-Efficiency Video replicate since they cannot be shared. This can severely impact Coding (HEVC) decoder implemented in the RVC-CAL dataflow both the time and space performance and the energy efficiency language targeting a multi-core platform.
    [Show full text]
  • Accelerating Applications at Scale Using One-Sided Communication
    Accelerating Applications at Scale Using One-Sided Communication Hongzhang Shan, Brian Austin, Nicholas J. Wright, Erich Strohmaier, John Shalf and Katherine Yelick CRD and NERSC Lawrence Berkeley National Laboratory, Berkeley, CA 94720 hshan, baustin, njwright, estrohmaier, jshalf, [email protected] Abstract—The lower overhead associated with one-sided mes- their use in this paper. The principle reason is that performance saging as compared to traditional two-sided communication has measurements on our experimental platform show that MPI-2 the potential to increase the performance at scale of scientific one-sided performs significantly worse than PGAS and in fact applications by increasing the effective network bandwidth and reducing synchronization overheads. In this work, we investigate worse than the MPI two-sided. both the programming effort required to modify existing MPI CAF and UPC have both been around for a decade or so. applications to exploit one-sided messaging using PGAS lan- Neither of them however has been widely adopted by the guages, and the resulting performance implications. In particular, user community; partly because of the lack of a developer we modify the MILC and IMPACT-T applications to use the environment, and partly because of the lack of convincing one-sided communication features of Unified Parallel C (UPC) and coarray Fortran (CAF) languages respectively. Only modest performance results for real applications, especially at large- modifications to the source code are required where fewer than scale, that demonstrate why they are viable (or superior) 100 lines of the source code out of 70,000 need to be changed for alternatives to the MPI programming model.
    [Show full text]
  • APLSV User's Manual APL SHARED VARIABLE SYSTEM
    APLSV User's Manual APL SHARED VARIABLE SYSTEM ~-""L r. l. LL L LL ':' L A A A A A S5'~"'''' 'V~V¥LLLLL!LLLLAAAAA SSS~SSS$SS PPPPPLLLLLYVVVV VYVVVLLLLLLLLLLAAAAA ssssssssss PPPPPLLLLLVYVVV LLLLLSSSS$ PPPPP PPPPPssssssssss VVVYVLLLLL LLLLLSSSSS PPPPP PPPPPSSSSSS5SSS VVVVVLLLLL LLLLLSSSSS PPPPP rrrrrssssssssss VVVVVLLLLL SSSSPFPPPS5SSS VVYVYAAAAA VVVYVPPPPPsssssvvvvv pppp 5SSSPPPPPSSS$S VVVVVAAHA VVVVI'PPPPPSSSSSVVVYV PPE'P SsssSPPPPPSSS$S VVVVVAAAAA ~VVVYPPPPPSSSSSVVVYV pppp AAAA VVVVVVVVVVSSSSS SBSSS AAAAALLLLLVVYVVLLL'LAAAA ,.AHA vvvvvvrvvvsssss esss: AAAAALLLLLVVVVVL LL HAd ~AAAA VVVVVVYVVVSSSSS s.:~~ AAAAALLLLLVVVVVLLLLLAAAA HA"?PP?PAAAA"!.LLLL [,!.LLLLLLLLPPPPP .. :'L;' .lAAAAPPPPPAAAAALLLn LLLLLLLLLLPPPPI' LL'· AAAAPPPPf'AAAAALULL LLLL' r.LLLLPPPPP "LL:' AAAA LLLLLPPPPPAAAAA LJ..LL ULLL 1'1" v AAAA LLLLLl'PPl'PAAAAA LLLLLLLLL! ilVVV AAA.A LLLLLPPPPPA.AA.AA tLLLLLLLLL VHV VVVVVV7VV SSSSS SSSSSYVVVYYYVVY AAAAAPPPP VVVVVYYVV SSSSS SSSSSVYVVYYVVYY AAAAAPPPP VYYVVVYVY SSSSS SSSSSVVYVVVVVVV AAAAAPPPP PPPPLLLLLSSSSSVYVYVPPPPi'VVVVVAAAAAi'Pi'PP[,LLLLLLLLLPPFPPAAAAA~AAA PPPPLLLLL SSSSYVVVVPPi'PPVVVYYAAAAAPPpPpLLLLLLLLLLPPPPPAAAAAAAAA pPPI'L['LLLSSSSSVYVVVI'PPPPVYVVVAA.AA.A.PPPPPLL~~LLL·LLPPPPPA.AA.AAAA.AA. SSSSYVYVY LLLLLLLL!L vvvrv 'LL' SSSSSVVVYVAAAAA.AA.AA SSSSYYV'. LLLLLLLLLL VVVYV~L'LL JSSSSVYVYVAAAAAAAAA SSSSVYJlVV LLLLLLLLLL JlJIV"VL':'':'' L _SSSSYVVYVAAAAAAAA.A YVVVV AAAAA PPPPP SSSS AAAAAAAAAAPPPPP VVVY AAAAA PPPPP SS5SS AAAAAAAAAAP PPE' VVYVV AAAAA PPPPP SSSSS AAAAAAAAAAPPPPP SSSSAAAAASSSSSPPPPPPPPPPLLLLLAAAAASSSSSYVYVV$SSSS LLLLLAAAA
    [Show full text]
  • The C Programming Language
    THE C PROGRAMMING LANGUAGE "'YC{9//6W ( BWf ) Library of Congress Calaloging in Publicolion Dato KERNICHAN, BRIAN W. The C programming language. lncludes index. l. C (Computer program language) l. RITCHIE, DENNIS M., joint author. ll. Title. QA76.73.C!5K47 Oot.6'424 77-28983 ISBN 0-13-t 10163-3 Copyright @ 1978 by Bell Telephone Laboratories, Incorporated. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopy- ing, recording, or otherwise, without the prior written permission of the publisher. Print- ed in the United States of America. Published simultaneously in Canada. This book was set in Times Roman and Courier l2 by the authors, using a Graphic Sys- tems phototypesetter driven by a PDP-l l/70 running under the UNIX operating system. UNIX is a Trademark of Bell Laboratories. l5 14 PRENTICE-HALL INTERNATIONAL, INC., London PRENTICE-HALL OF AUSTRALIA PTY. LIMITED, Sydney PRENTICE-HALL OF CANADA, LTD., Toronto PRENTICE-HALL OF INDIA PRIVATE LIMITED, New Delhi PRENTICE-HALL OF JAPAN, INC., Tokyo PRENTICE-HALL OF SOUTHEAST ASIA PTE. LTD., Singapore WHITEHALL BOOKS LIMITED, Wellington, New Zealand CONIENTS Preface lx Chapter 0 Introduction Chapter I A Tutorial Introduction 1.1 Getting Started 5 1.2 Variables and Arithmetic 8 1.3 The For Statement ll t.4 Symbolic Constants t2 1.5 A Collection of Useful Programs l3 1.6 Arrays 20 t.7 Functions 22 1.8 Arguments - Call by Value 24 1.9 Character Arrays 25 l.l0 Scope; External
    [Show full text]
  • APLX for Windows, Linux and Macos
    APLX for Windows, Linux and MacOS New features in Version 2.0 Copyright © 2003 MicroAPL Ltd. All rights reserved worldwide. APLX, APL.68000 and MicroAPL are trademarks of MicroAPL Ltd. All other trademarks acknowledged. APLX is a proprietary product of MicroAPL Ltd, and its use is subject to the license agreement in force. Unauthorized copying or use of APLX is illegal. MicroAPL Ltd makes no warranties in respect of the suitability of APLX for any particular purpose, and accepts no liability for any loss arising out of the use of APLX or arising from the information contained in this manual. MicroAPL welcomes your comments and suggestions. Please visit our website: http://www.microapl.co.uk/apl APLX Version 2.0.3 Upgrade notes: February 2004 2 Summary of APLX Version 2 Enhancements Multi-tasking • Create a new session from the menu, creates an independent APL task with its own session window • Create a new APL task under program control, optionally with session window: 'ChildTask' ŒWI 'New' 'APL' ('wssize' 100000) ('visible' 1) • New properties and methods for controlling APL child tasks, eg Execute method causes child task to execute APL expression or system command • New events allow parent task to be notified when child task starts or ends execution of an expression, hits an untrapped error, or terminates • Signals for the child and parent task to talk to each other and pass commands/results • Tasks can share data through shared variables and ŒWI delta-properties Interpreter • Removal of 64KB limit on executing token strings • Increase
    [Show full text]
  • Programming Language) 1 APL (Programming Language)
    APL (programming language) 1 APL (programming language) APL Paradigm array, functional, structured, modular Appeared in 1964 Designed by Kenneth E. Iverson Developer Kenneth E. Iverson Typing discipline dynamic Major implementations IBM APL2, Dyalog APL, APL2000, Sharp APL, APLX Dialects A+, Dyalog APL, APLNext Influenced by mathematical notation [1] [2] [3] [4] Influenced J, K, Mathematica, MATLAB, Nial, PPL, Q APL (named after the book A Programming Language)[5] is an interactive array-oriented language and integrated development environment which is available from a number of commercial and non-commercial vendors[6] and for most computer platforms.[7] It is based on a mathematical notation developed by Kenneth E. Iverson. APL has a combination of unique and relatively uncommon features that appeal to programmers and make it a productive programming language:[8] • It is concise, using symbols rather than words and applying functions to entire arrays without using explicit loops. • It is solution focused, emphasizing the expression of algorithms independently of machine architecture or operating system. • It has just one simple, consistent, and recursive precedence rule: the right argument of a function is the result of the entire expression to its right. • It facilitates problem solving at a high level of abstraction. APL is used in scientific,[9] actuarial,[8] statistical,[10] and financial applications where it is used by practitioners for their own work and by programmers to develop commercial applications. It was an important influence on the development of spreadsheets, functional programming,[11] and computer math packages.[3] It has also inspired several other programming languages.[1] [2] [4] It is also associated with rapid and lightweight development projects in volatile business environments.[12] History The first incarnation of what was later to be the APL programming language was published and formalized in A Programming Language,[5] a book describing a notation invented in 1957 by Kenneth E.
    [Show full text]
  • Shared Variables Interaction Diagrams
    Shared Variables Interaction Diagrams Rajeev Alur Radu Grosu Department of Computer and Information Science Department of Computer Science University of Pennsylvania State University of New York at Stony Brook [email protected] [email protected] Abstract variables paradigm. Textbooks on concurrent programming (e.g., [14, 17]) contain many pictures describing the interac- Scenario-based specifications offer an intuitive and vi- tions of processes communicating by shared variables, and sual way of describing design requirements of distributed similar scenarios arise in diverse areas such as transaction software systems. For the communication paradigm based processing in concurrent databases (c.f. [18]) and consis- on messages, message sequence charts (MSC) offer a stan- tency in shared-memory multiprocessors [13]. dardized and formal notation amenable to formal analysis. In our definition of an SVID, an action corresponds to, In this paper, we define shared variables interaction dia- possibly multiple, reading/writing of shared variables. The grams (SVID) as the counterpart of MSCs when processes actions of one process are visually ordered. The causal de- communicate via shared variables. After formally defining pendence among actions of different processes is illustrated SVIDs, we develop an intuitive as well as formal definition Ô by arrows: an arrow from an action a of process to an ac- of refinement for SVIDs. This notion provides a basis for Õ Õ tion b of process means that reads a value that was writ- systematically adding details to SVID requirements. ten by Ô. If the variable involved in this communication is write-shared, then there is an implicit additional constraint b that between these two actions a and , there is no interven- 1.
    [Show full text]
  • INFORMATION to USERS This Manuscript Has Been Reproduced
    INFORMATION TO USERS This manuscript has been reproduced from the microfilm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer. The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand corner and continuing from left to right in equal sections with small overlaps. Each original is also photographed in one exposure and is included in reduced form at the back of the book. Photographs included in the original manuscript have been reproduced xerographically in this copy. Higher quality 6" x 9" black and white photographic prints are available for any photographs or illustrations appearing in this copy for an additional charge. Contact UMI directly to order. A Bell & Howell Information Com pany 300 North Zeeb Road. Ann Arbor, Ml 48106-1346 USA 313/761-4700 800/521-0600 A l g o r it h m s t o I m p l e m e n t S e m a p h o r e s in D is t r ib u t e d E nvironments dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio State University By Mahendra A.
    [Show full text]