Towards an Actor-Based Concurrent Machine Model

Total Page:16

File Type:pdf, Size:1020Kb

Towards an Actor-Based Concurrent Machine Model Towards an Actor-based Concurrent Machine Model ∗ Hans Schippers Tom Van Cutsem Universiteit Antwerpen Vrije Universiteit Brussel Antwerpen, Belgium Brussels, Belgium hans.schippers@ua.ac.be tvcutsem@vub.ac.be y Stefan Marr Michael Haupt Robert Hirschfeld Vrije Universiteit Brussel Hasso Plattner Institute Hasso Plattner Institute Brussels, Belgium Potsdam, Germany Potsdam, Germany stefan.marr@vub.ac.be michael.haupt@hpi.uni- hirschfeld@hpi.uni- potsdam.de potsdam.de support thread-local behavior, which in turn is needed to implement several crosscutting constructs (e. g., cflow). ABSTRACT Adding concurrency support to delMDSOC involves three main tasks. First, the machine model has to be extended In this position paper we propose to extend an existing with concurrency primitives in a way compatible with the delegation-based machine model with concurrency primi- already present primitives for (mostly non-concurrent) MD- tives. The original machine model which is built on the con- SOC support. Second, it needs to be verified that the re- cepts of objects, messages, and delegation, provides support sulting machine model is sufficiently expressive in order to for languages enabling multi-dimensional separation of con- support different concurrency mechanisms as exhibited by a cerns (MDSOC). We propose to extend this model with an range of high-level languages. Finally, the model should be actor-based concurrency model, allowing for both true par- sufficiently powerful to allow for concurrency-related MD- allelism as well as lightweight concurrency primitives such SOC features such as thread-local aspects and cflow. as coroutines. In order to demonstrate its expressiveness, This position paper presents a first attempt to add con- we informally describe how three high-level languages sup- currency support to the delMDSOC machine model. As the porting different concurrency models can be mapped onto latter is object-based and relies on late-bound message dis- our extended machine model. We also provide an outlook patch (cfr. Sec. 2), a concurrency model that is based on on the extended model's potential to support concurrency- messages rather than shared state is preferable. Hence, the related MDSOC features. actors model [1] can serve as a source of inspiration. A more traditional model based on threads and locks does not 1. INTRODUCTION seem to be a good choice: it is deceivingly simple|problems The delegation-based delMDSOC machine model [7] has like starvation, deadlocks and race conditions frequently oc- good support for modularizing crosscutting concerns and cur. Moreover, an actor-based model using message passing hence for generally supporting programming languages en- is conceptually closer to the delMDSOC model as it pro- abling multi-dimensional separation of concerns (MDSOC). vides natural isolation of state in actors|a concept that is Its implementation, the delMDSOC kernel 1 [15] achieves in line with the recent success of multi-core architectures most of the features required to implement MDSOC pro- with processor-local memory. gramming languages. An important feature still missing is Compared to machine models proposed earlier, implemen- explicit concurrency support. This, however, is required to tation in hardware is not an issue. A parallel machine inter- ∗ face consisting of primitives sufficient for dataflow, shared Postdoctoral Fellow of the Research Foundation, Flanders memory, and message passing models is discussed in [5]. It (FWO) was designed keeping the tradeoffs for being realized in hard- y Funded by a doctoral scholarship of the Institute for the ware in mind. Today, this is not an adequate restriction any Promotion of Innovation through Science and Technology more. Instead, an implementation as part of a high-level in Flanders (IWT) 1 language virtual machine is desirable. Thus, we concentrate http://www.hpi.uni-potsdam.de/swa/projects/ on a conceptually clean model which fits to the delMDSOC delmdsoc/ model and disregard implementation complexity as an im- portant design consideration. Throughout this paper, we first introduce the delMDSOC model in Sec. 2 before we present the concurrency model we propose for integration with delMDSOC in Sec. 3. Next, in Sec. 4, we discuss a possible translation process to the c ACM, 2009. This is the author’s version of the work. It is posted here extended delMDSOC for several high-level languages with by permission of ACM for your personal use. Not for redistribution. The support for different kinds of concurrency models. Sec. 5 definitive version was published in ICOOOLPS’09 July 6, 2009, Genova, provides an outlook on the model's suitability concerning Italy http://doi.acm.org/10.1145/1565824.1565825. support for concurrency-related MDSOC features. Finally, 3. AN ACTOR-BASED MACHINE MODEL obj ... actual_obj ... foo = (...) foo = (...) Our proposed machine model with explicit concurrency bar = (..., self foo, ...) obj bar = (..., self foo, ...) baz = (...) baz = (...) support is based on the well-known actor model of com- putation [1]. In contrast to multithreading, actors are a (a) (b) message-passing-based concurrency model that is more in Figure 1: An object is represented as a combination line with the principles of object-oriented computing. of a proxy and the actual object. Actors were originally formulated as an extension of a functional programming language with three primitives to create new actors, send (asynchronous) messages to them, and to change the actor's behavior in how it will respond to the paper is concluded and future work discussed in Sec. 6. future messages. Messages are buffered in an actor's mail- box. This model of \functional" actors is still used in well- known languages such as Erlang [3], but has also been rec- 2. A MACHINE MODEL FOR MDSOC onciled in many ways with stateful object-oriented program- In this section we briefly describe the delMDSOC ma- ming also known as \active objects" as used in ProActive [4]. chine model originally introduced in [7]. Based on the no- The pure actor model makes no distinction between ac- tions of objects, messages and delegation, its original appli- tors and regular objects. In a sense, all objects are actors. cation domain is to serve as a compilation target for high- In practice, forcing all objects to be active is not always de- level languages dealing with the modularization of crosscut- sirable, neither from a programming point-of-view nor from ting concerns. Such concerns cannot be modularized in a an implementation point-of-view. More concurrency leads program's dominant decomposition, and hence appear scat- to more non-determinism in a system. If it can be avoided, tered throughout several unrelated modules. Examples of it should be for the sake of simplicity. MDSOC paradigms trying to address this issue are aspect- The E language (with its predecessors) [13] was the first oriented programming (AOP) [12] and context-oriented pro- to reconcile actors with objects. In E, actors are not \ac- gramming (COP) [9]. tive objects" but rather vats (containers) of regular objects. Core features of the model pertain to the representation An actor contains any number of regular objects, shielding of application entities and that of join points, which are them from unwanted concurrent modifications. Each actor points in the execution of a program where functionality still has its own message queue and its own thread of con- dispatch occurs. The latter are consistently regarded as loci trol. Messages that arrive in such message queue are not of late binding organized along multiple dimensions. Each directed at the actor itself but rather to a particular object dimension represents one possible way to choose a particu- contained within the actor. All objects in an actor share lar binding of a piece of functionality to a join point, e. g., the actor's message queue. Objects within the same actor the current object, the target of a method call, the invoked can communicate using familiar synchronous method invo- method, or the current thread. cations. Objects within different actors can only communi- The model assumes a prototype-based object-oriented en- cate asynchronously, as in the actor model. vironment in which objects are consistently represented as An important feature of this model is that actors can share \seas of fragments" [14]: each object is visible to others via a mutable state (objects), but only the actor that contains proxy determining the object's identity. Messages sent to an the state (object) can access it synchronously. All other object are received by its proxy and delegated to the actual actors can only manipulate it asynchronously, by sending object, as displayed in Fig. 1. The model allows dynamic an asynchronous message to the object. This message is modification of this initial configuration by inserting and re- then executed by the actor containing the object. Shared moving additional proxy objects in between the proxy and state is thus supported without introducing locks avoiding its delegate object. This results in a chain of proxy objects many race condition and deadlock issues of traditional mul- (fragments) organized in a delegation chain, which collec- tithreading. tively constitute the whole object. A crucial property of Our concurrent machine model is based on E's model of delegation is that self remains bound to the original receiver concurrency, extended with lightweight concurrency support object, i. e., the proxy at the head of the delegation chain. in the form of coroutines. The abstract model is depicted in Classes are represented likewise: each class is a pair of Fig. 2. a proxy and an object representing the actual class. Each As in E, programs are composed of a number of actors. object references its class by delegating to the class proxy. The threads of control of these actors can execute in parallel, The granularity of the supported join point model is that so they can exploit multiprocessor concurrency. Similar to of message receptions.
Recommended publications
  • The Early History of Smalltalk
    The Early History of Smalltalk http://www.accesscom.com/~darius/EarlyHistoryS... The Early History of Smalltalk Alan C. Kay Apple Computer kay2@apple.com.Internet# Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. HOPL-II/4/93/MA, USA © 1993 ACM 0-89791-571-2/93/0004/0069...$1.50 Abstract Most ideas come from previous ideas. The sixties, particularly in the ARPA community, gave rise to a host of notions about "human-computer symbiosis" through interactive time-shared computers, graphics screens and pointing devices. Advanced computer languages were invented to simulate complex systems such as oil refineries and semi-intelligent behavior. The soon-to- follow paradigm shift of modern personal computing, overlapping window interfaces, and object-oriented design came from seeing the work of the sixties as something more than a "better old thing." This is, more than a better way: to do mainframe computing; for end-users to invoke functionality; to make data structures more abstract. Instead the promise of exponential growth in computing/$/volume demanded that the sixties be regarded as "almost a new thing" and to find out what the actual "new things" might be. For example, one would compute with a handheld "Dynabook" in a way that would not be possible on a shared mainframe; millions of potential users meant that the user interface would have to become a learning environment along the lines of Montessori and Bruner; and needs for large scope, reduction in complexity, and end-user literacy would require that data and control structures be done away with in favor of a more biological scheme of protected universal cells interacting only through messages that could mimic any desired behavior.
    [Show full text]
  • Active Object Systems Redacted for Privacy Abstract Approved
    AN ABSTRACT OF THE THESIS OF Sungwoon Choi for the degree of Doctor of Philosophyin Computer Science presented on February 6, 1992. Title: Active Object Systems Redacted for Privacy Abstract approved. v '" Toshimi Minoura An active object system isa transition-based object-oriented system suitable for the design of various concurrentsystems. An AOS consists of a collection of interacting objects, where the behavior of eachobject is determined by the transition statements provided in the class of that object.A transition statement is a condition-action pair, an equational assignmentstatement, or an event routine. The transition statements provided for eachobject can access, besides the state of that object, the states of the other objectsknown to it through its interface variables. Interface variablesare bound to objects when objects are instantiated so that desired connections among objects are established. The major benefit of the AOS approach is thatan active system can be hierarchically composed from its active software componentsas if it were a hardware system. An AOS provides better encapsulation andmore flexible communication protocols than ordinary object oriented systems, since control withinan AOS is localized. ©Copyright by Sungwoon Choi February 6, 1992 All Rights Reserved Active Object Systems by Sungwoon Choi A THESIS submitted to Oregon State University in partial fulfillment of the requirements for the degree of Doctor of Philosophy Completed February 6, 1992 Commencement June 1992 APPROVED: Redacted for Privacy Professor of Computer Science in charge ofmajor Redacted for Privacy Head of Department of Computer Science Redacted for Privacy Dean of Gradu to School Or Date thesis presented February 6, 1992 Typed by Sungwoon Choi for Sungwoon Choi To my wife Yejung ACKNOWLEDGEMENTS I would like to express my sincere gratitude tomy major professor, Dr.
    [Show full text]
  • Object-Oriented Programming in the Beta Programming Language
    OBJECT-ORIENTED PROGRAMMING IN THE BETA PROGRAMMING LANGUAGE OLE LEHRMANN MADSEN Aarhus University BIRGER MØLLER-PEDERSEN Ericsson Research, Applied Research Center, Oslo KRISTEN NYGAARD University of Oslo Copyright c 1993 by Ole Lehrmann Madsen, Birger Møller-Pedersen, and Kristen Nygaard. All rights reserved. No part of this book may be copied or distributed without the prior written permission of the authors Preface This is a book on object-oriented programming and the BETA programming language. Object-oriented programming originated with the Simula languages developed at the Norwegian Computing Center, Oslo, in the 1960s. The first Simula language, Simula I, was intended for writing simulation programs. Si- mula I was later used as a basis for defining a general purpose programming language, Simula 67. In addition to being a programming language, Simula1 was also designed as a language for describing and communicating about sys- tems in general. Simula has been used by a relatively small community for many years, although it has had a major impact on research in computer sci- ence. The real breakthrough for object-oriented programming came with the development of Smalltalk. Since then, a large number of programming lan- guages based on Simula concepts have appeared. C++ is the language that has had the greatest influence on the use of object-oriented programming in industry. Object-oriented programming has also been the subject of intensive research, resulting in a large number of important contributions. The authors of this book, together with Bent Bruun Kristensen, have been involved in the BETA project since 1975, the aim of which is to develop con- cepts, constructs and tools for programming.
    [Show full text]
  • CPS323 Lecture: Concurrency Materials: 1. Coroutine Projectables
    CPS323 Lecture: Concurrency Materials: 1. Coroutine Projectables 2. Handout for Ada Concurrency + Executable form (simple_tasking.adb, producer_and_consumer.adb) I. Introduction - ------------ A. Most of our attention throughout the CS curricum has been focussed on _sequential_ programming, in which a program does exactly one thing at a time, following a predictable order of steps. In particular, we expect a given program will always follow the exact same sequence of steps when run on a given set of data. B. An alternative is to think in terms of _concurrent_ programming, in which a "program" (at least in principle) does multiple things at the same time, following an order of steps that is not predictable and may differ between runs even if the same program is run on exactly the same data. C. Concurrency has long been an interest in CS, but has become of particular interest as we move into a situation in which raw hardware speeds have basically plateaued and multicore processors are coming to dominate the hardware scene. There are at least three reasons why this topic is of great interest. 1. Achieving maximum performance using technologies such as multicore processors. 2. Systems that inherently require multiple processors working together cooperatively on a single task - e.g. distributed or embedded systems. 3. Some problems are more naturally addressed by thinking in terms of multiple concurrrent components, rather than a single monolithic program. D. There are two broad approaches that might be taken to concurrency: 1. Make use of system libraries, without directly supporting parallelism in the language. (The approach taken by most languages - e.g.
    [Show full text]
  • An Efficient Implementation of Guard-Based Synchronization for an Object-Oriented Programming Language an Efficient Implementation of Guard-Based
    AN EFFICIENT IMPLEMENTATION OF GUARD-BASED SYNCHRONIZATION FOR AN OBJECT-ORIENTED PROGRAMMING LANGUAGE AN EFFICIENT IMPLEMENTATION OF GUARD-BASED SYNCHRONIZATION FOR AN OBJECT-ORIENTED PROGRAMMING LANGUAGE By SHUCAI YAO, M.Sc., B.Sc. A Thesis Submitted to the Department of Computing and Software and the School of Graduate Studies of McMaster University in Partial Fulfilment of the Requirements for the Degree of Doctor of Philosophy McMaster University c Copyright by Shucai Yao, July 2020 Doctor of Philosophy (2020) McMaster University (Computing and Software) Hamilton, Ontario, Canada TITLE: An Efficient Implementation of Guard-Based Synchro- nization for an Object-Oriented Programming Language AUTHOR: Shucai Yao M.Sc., (Computer Science) University of Science and Technology Beijing B.Sc., (Computer Science) University of Science and Technology Beijing SUPERVISOR: Dr. Emil Sekerinski, Dr. William M. Farmer NUMBER OF PAGES: xvii,167 ii To my beloved family Abstract Object-oriented programming has had a significant impact on software development because it provides programmers with a clear structure of a large system. It encap- sulates data and operations into objects, groups objects into classes and dynamically binds operations to program code. With the emergence of multi-core processors, application developers have to explore concurrent programming to take full advan- tage of multi-core technology. However, when it comes to concurrent programming, object-oriented programming remains elusive as a useful programming tool. Most object-oriented programming languages do have some extensions for con- currency, but concurrency is implemented independently of objects: for example, concurrency in Java is managed separately with the Thread object. We employ a programming model called Lime that combines action systems tightly with object- oriented programming and implements concurrency by extending classes with actions and guarded methods.
    [Show full text]
  • Incorparating the Actor Model Into SCIVE on an Abstract Semantic Level
    Incorparating the Actor Model into SCIVE on an Abstract Semantic Level Christian Frohlich¨ ∗ Marc E. Latoschik† AI and VR Group, Bielefeld University AI and VR Group, Bielefeld University. ABSTRACT Since visual perception is very important for generating immer- sive environments, most VR applications focus on the graphical This paper illustrates the temporal synchronization and process flow simulation output. Tools like OpenGL Performer, Open Inven- facilities of a real-time simulation system which is based on the ac- tor [12], Open Scene Graph, OpenSG [11] or the VRML successor tor model. The requirements of such systems are compared against X3D [8] are based upon a hierarchical scene graph structure, which the actor model’s basic features and structures. The paper describes allows for complex rendering tasks. Extension mechanisms like how a modular architecture benefits from the actor model on the field routing or rapid prototyping via scipting interfaces allow for module level and points out how the actor model enhances paral- new customized node types and interconnected application graphs. lelism and concurrency even down to the entity level. The actor idea is incorporated into a novel simulation core for intelligent vir- Purpose-built VR application frameworks adopt and extend these mechanisms, by adding in- and output customization, see e.g. tual environments (SCIVE). SCIVE supports well-known and es- TM tablished Virtual Reality paradigms like the scene graph metaphor, Lightning [4], Avango [13], VR Juggler [3] or the CAVELib . field routing concepts etc. In addition, SCIVE provides an explicit Also network distribution paradigms are often integrated to enable semantic representation of its internals as well as of the specific distributed rendering on a cluster architecture, as can be seen in virtual environments’ contents.
    [Show full text]
  • Actor-Based Concurrency by Srinivas Panchapakesan
    Concurrency in Java and Actor- based concurrency using Scala By, Srinivas Panchapakesan Concurrency Concurrent computing is a form of computing in which programs are designed as collections of interacting computational processes that may be executed in parallel. Concurrent programs can be executed sequentially on a single processor by interleaving the execution steps of each computational process, or executed in parallel by assigning each computational process to one of a set of processors that may be close or distributed across a network. The main challenges in designing concurrent programs are ensuring the correct sequencing of the interactions or communications between different computational processes, and coordinating access to resources that are shared among processes. Advantages of Concurrency Almost every computer nowadays has several CPU's or several cores within one CPU. The ability to leverage theses multi-cores can be the key for a successful high-volume application. Increased application throughput - parallel execution of a concurrent program allows the number of tasks completed in certain time period to increase. High responsiveness for input/output-intensive applications mostly wait for input or output operations to complete. Concurrent programming allows the time that would be spent waiting to be used for another task. More appropriate program structure - some problems and problem domains are well-suited to representation as concurrent tasks or processes. Process vs Threads Process: A process runs independently and isolated of other processes. It cannot directly access shared data in other processes. The resources of the process are allocated to it via the operating system, e.g. memory and CPU time. Threads: Threads are so called lightweight processes which have their own call stack but an access shared data.
    [Show full text]
  • Liam: an Actor Based Programming Model for Hdls
    Liam: An Actor Based Programming Model for HDLs Haven Skinner Rafael Trapani Possignolo Jose Renau Dept. of Computer Engineering Dept. of Computer Engineering Dept. of Computer Engineering hskinner@ucsc.edu rpossign@ucsc.edu renau@ucsc.edu ABSTRACT frequency being locked down early in the development process, The traditional model for developing synthesizable digital architec- and adds a high cost in effort and man-hours, to make high-level tures is a clock-synchronous pipeline. Latency-insensitive systems changes to the system. Although these challenges can be managed, are an alternative, where communication between blocks is viewed they represent fundamental obstacles to developing large-scale as message passing. In hardware this is generally managed by con- systems. trol bits such as valid/stop signals or token credit mechanisms. An alternative is a latency-insensitive design, where the system Although prior work has shown that there are numerous benefits is abstractly seen as being comprised of nodes, which communicate to building latency-insensitive digital hardware, a major factor dis- via messages. Synchronous hardware systems can be automatically couraging its use is the difficulty of managing the additional logic transformed to latency-insensitive designs, which we refer to as and infrastructure required to implement it. elastic systems [1–3]. Alternately, the designer can manually con- We propose a new programming paradigm for Hardware Descrip- trol the latency-insensitive backend [4, 5], we call such systems tion Languages, built on the Actor Model, to implicitly implement Fluid Pipelines. The advantage of exposing the elasticity to the latency-insensitive hardware designs. We call this model Liam, for designer is an increase in performance and flexibility in transforma- Latency-Insensitive Actor-based programming Model.
    [Show full text]
  • Active Object
    Active Object an Object Behavioral Pattern for Concurrent Programming R. Greg Lavender Douglas C. Schmidt G.Lavender@isode.com schmidt@cs.wustl.edu ISODE Consortium Inc. Department of Computer Science Austin, TX Washington University, St. Louis An earlier version of this paper appeared in a chapter in the book ªPattern Languages of Program Design 2º ISBN 0-201-89527-7, edited by John Vlissides, Jim Coplien, and Norm Kerth published by Addison-Wesley, 1996. : Output : Input Handler Handler : Routing Table : Message Abstract Queue This paper describes the Active Object pattern, which decou- 3: enqueue(msg) ples method execution from method invocation in order to : Output 2: find_route(msg) simplify synchronized access to a shared resource by meth- Handler ods invoked in different threads of control. The Active Object : Message : Input pattern allows one or more independent threads of execution Queue Handler 1: recv(msg) to interleave their access to data modeled as a single ob- ject. A broad class of producer/consumer and reader/writer OUTGOING OUTGOING MESSAGES GATEWAY problems are well-suited to this model of concurrency. This MESSAGES pattern is commonly used in distributed systems requiring INCOMING INCOMING multi-threaded servers. In addition,client applications (such MESSAGES MESSAGES as windowing systems and network browsers), are increas- DST DST ingly employing active objects to simplify concurrent, asyn- SRC SRC chronous network operations. 1 Intent Figure 1: Connection-Oriented Gateway The Active Object pattern decouples method execution from method invocation in order to simplify synchronized access to a shared resource by methods invoked in different threads [2]. Sources and destinationscommunicate with the Gateway of control.
    [Show full text]
  • A Low-Cost Implementation of Coroutines for C
    University of Wollongong Research Online Department of Computing Science Working Faculty of Engineering and Information Paper Series Sciences 1983 A low-cost implementation of coroutines for C Paul A. Bailes University of Wollongong Follow this and additional works at: https://ro.uow.edu.au/compsciwp Recommended Citation Bailes, Paul A., A low-cost implementation of coroutines for C, Department of Computing Science, University of Wollongong, Working Paper 83-9, 1983, 24p. https://ro.uow.edu.au/compsciwp/76 Research Online is the open access institutional repository for the University of Wollongong. For further information contact the UOW Library: research-pubs@uow.edu.au A LOW-COST IMPLEMENTATION OF COROUTINES FOR C Paul A. Bailes Department of Computing Science University of Wollongong Preprint No. 83-9 November 16, 1983 P.O. Box 1144, WOLLONGONG N.S.W. 2500, AUSTRALIA tel (042)-282-981 telex AA29022 A Low-Cost Implementation of Coroutines for C Paul A. Bailes Department of Computing Science University of Wollongong Wollongong N.S.W. 2500 Australia ABSTRACT We identify a set of primitive operations supporting coroutines, and demonstrate their usefulness. We then address their implementation in C accord­ ing to a set of criteria aimed at maintaining simplicity, and achieve a satisfactory compromise between it and effectiveness. Our package for the PDP-II under UNIXt allows users of coroutines in C programs to gain access to the primitives via an included definitions file and an object library; no penalty is imposed upon non-coroutine users. October 6, 1983 tUNIX is a Trademark of Bell Laboratories. A Low-Cost Implementation of Coroutines for C Paul A.
    [Show full text]
  • Kotlin Coroutines Deep Dive Into Bytecode #Whoami
    Kotlin Coroutines Deep Dive into Bytecode #whoami ● Kotlin compiler engineer @ JetBrains ● Mostly working on JVM back-end ● Responsible for (almost) all bugs in coroutines code Agenda I will talk about ● State machines ● Continuations ● Suspend and resume I won’t talk about ● Structured concurrency and cancellation ● async vs launch vs withContext ● and other library related stuff Agenda I will talk about Beware, there will be code. A lot of code. ● State machines ● Continuations ● Suspend and resume I won’t talk about ● Structured concurrency and cancellation ● async vs launch vs withContext ● and other library related stuff Why coroutines ● No dependency on a particular implementation of Futures or other such rich library; ● Cover equally the "async/await" use case and "generator blocks"; ● Make it possible to utilize Kotlin coroutines as wrappers for different existing asynchronous APIs (such as Java NIO, different implementations of Futures, etc). via coroutines KEEP Getting Lazy With Kotlin Pythagorean Triples fun printPythagoreanTriples() { for (i in 1 until 100) { for (j in 1 until i) { for (k in i until 100) { if (i * i + j * j < k * k) { break } if (i * i + j * j == k * k) { println("$i^2 + $j^2 == $k^2") } } } } } Pythagorean Triples fun printPythagoreanTriples() { for (i in 1 until 100) { for (j in 1 until i) { for (k in i until 100) { if (i * i + j * j < k * k) { break } if (i * i + j * j == k * k) { println("$i^2 + $j^2 == $k^2") } } } } } Pythagorean Triples fun printPythagoreanTriples() { for (i in 1 until 100) { for (j
    [Show full text]
  • Csc 520 Principles of Programming Languages Coroutines Coroutines
    Coroutines Coroutines are supported by Simula and Modula-2. CSc 520 They are similar to Java’s threads, except the programmer has to explicitly transfer control from one Principles of Programming execution context to another. Languages Thus, like threads several coroutines can exist simultaneously but unlike threads there is no central 36: Procedures — Coroutines scheduler that decides which coroutine should run next. Christian Collberg A coroutine is represented by a closure. collberg@cs.arizona.edu A special operation transfer(C) shifts control to the coroutine C, at the location where C last left off. Department of Computer Science University of Arizona Copyright c 2005 Christian Collberg 520—Spring 2005—36 [1] 520—Spring 2005—36 [2] Coroutines. Coroutines. The next slide shows an example from Scott where two var us, cfs: coroutine; coroutines execute “concurrently”, by explicitly transferring control between each other. coroutine update_screen() { ... In the example one coroutine displays a moving detach screen-saver, the other walks the file-system to check loop { for corrupt files. ... transfer(cfs) ... } } coroutine check_file_system() { ... } main () { ... } 520—Spring 2005—36 [3] 520—Spring 2005—36 [4] Coroutines. Coroutines in Modula-2 coroutine check_file_system() { Modula-2's system module provides two functions to create and transfer ... between coroutines: detach for all files do { PROCEDURE NEWPROCESS( proc: PROC; (* The procedure *) ... transfer(cfs) addr: ADDRESS; (* The stack *) ... transfer(cfs) size: CARDINAL; (* The stack size *) ... transfer(cfs) ... VAR new: ADDRESS); (* The coroutine *) } PROCEDURE TRANSFER( } VAR source: ADDRESS; (* Current coroutine *) VAR destination: ADDRESS); (* New coroutine *) main () { us := new update_screen(); The ®rst time TRANSFER is called source will be instantiated to cfs := new check_file_system(); the main (outermost) coroutine.
    [Show full text]