Sökning: "concurrent programming"

Visar resultat 21 - 25 av 50 uppsatser innehållade orden concurrent programming.

  1. 21. Parallelism in Node.js applications : Data flow analysis of concurrent scripts

    Kandidat-uppsats, Mittuniversitetet/Avdelningen för informationssystem och -teknologi

    Författare :Linda Jansson; [2017]
    Nyckelord :Node.js; parallelism; concurrent programming; multicore;

    Sammanfattning : To fully utilize multicore processors in Node.js applications, the applications must be programmed as multiple processes. Parallel execution can increase the throughput of data and hence lower data buffering for inter-process communica- tion. Node. LÄS MER

  3. 22. Improving the Developer Experience by Implementing Syntax in the Encore Language

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Lowe Eklund; Karolina Nikamo; Casper Strömberg; [2017]
    Nyckelord :;

    Sammanfattning : Good concurrent software is a necessity today, as concurrent architectures have become commonplace. Consequently, a good programming experience in languages designed for concurrency becomes essential. This project provides the design and implementation of a set of features in the Encore programming language, which is designed for concurrency. LÄS MER

  4. 23. Lightweight Software Isolation via Flow-Sensitive Capabilities in Scala

    Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Erik Reimers; [2017]
    Nyckelord :Scala; LaCasa; flow-sensitive; aliasing;

    Sammanfattning : Aliasing is a potential source of problems in software development and can, for example,lead to data races in concurrent programs. More recent programming languages includealiasing control in order to catch more errors at compile time. However, this does notexist for most widely-used languages.LaCasa introduces aliasing control to Scala. LÄS MER

  5. 24. Fast and Scalable Static Analysis using Deterministic Concurrency

    Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Patrik Ackland; [2017]
    Nyckelord :concurrent static analysis; ifds algorithm; reactive async;

    Sammanfattning : This thesis presents an algorithm for solving a subset of static analysis data flow problems known as Interprocedural Finite Distribute Subset problems. The algorithm, called IFDS-RA, is an implementation of the IFDS algorithm which is an algorithm for solving such problems. LÄS MER

  7. 25. Exceptional Actors Implementing Exception Handling for Encore

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Sahand Shamal Taher; [2017]
    Nyckelord :;

    Sammanfattning : Encore is an object-oriented programming language which uses the acto rmodel as its concurrency model, and is specifically aimed atimplementing concurrent and parallel systems. Communication between actors is done via asynchronous method calls, which store their results in futures, placeholder objects for later storing the result of a computation. LÄS MER