Sökning: "Message systems"
Visar resultat 1 - 5 av 142 avhandlingar innehållade orden Message systems.
1. Functional Programming for Embedded Systems
Sammanfattning : Embedded Systems application development has traditionally been carried out in low-level machine-oriented programming languages like C or Assembler that can result in unsafe, error-prone and difficult-to-maintain code. Functional programming with features such as higher-order functions, algebraic data types, polymorphism, strong static typing and automatic memory management appears to be an ideal candidate to address the issues with low-level languages plaguing embedded systems. LÄS MER
2. On the Design and Analysis of Consensus Protocols for Automotive Electronic Systems
Sammanfattning : This thesis deals with the fundamental problem of reaching agreement on a value in a distributedcomputing system in the presence of faults. We address this problem in the contextof safety-critical distributed automotive applications, such as virtual traffic lights. LÄS MER
3. Compile-time Safety and Runtime Performance in Programming Frameworks for Distributed Systems
Sammanfattning : Distributed Systems, that is systems that must tolerate partial failures while exploiting parallelism, are a fundamental part of the software landscape today. Yet, their development and design still pose many challenges to developers when it comes to reliability and performance, and these challenges often have a negative impact on developer productivity. LÄS MER
4. Real-Time Services in Packet-Switched Networks for Embedded Applications
Sammanfattning : Embedded applications have become more and more complex, increasing the demands on the communication network. For reasons such as safety and usability, there are real-time constraints that must be met. Also, to offer high performance, network protocols should offer efficient user services aimed at specific types of communication. LÄS MER
5. Topics in Distributed Algorithms: On Wireless Networks, Distributed Storage and Streaming
Sammanfattning : Distributed algorithms are executed on a set of computational instances. Werefer to these instances as nodes. Nodes are runningconcurrently and are independent from each other. Furthermore, they have their own instructions and information. LÄS MER