FRP IoT modules as a Scala DSL

Calus, Ben; Reynders, Bob; Devriese, Dominique; Noorman, Job; Piessens, Frank

doi:10.1145/3141858.3141861

Cited by 8 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our ongoing research efforts focus on developing expressive programming languages that ease the development of CPS applications. Literature shows that reactive programming fits well with the eventdriven nature of CPS applications, due to the automatic propagation of changes throughout the program dependency graph [4,5]. Distributed reactive programming takes into account the heterogeneity and distribution of CPS by distributing the dependency graph and application across multiple physical nodes.…”

Section: Future Workmentioning

confidence: 93%

Khronos

Peros

Delbruel

Michiels

et al. 2019

Proceedings of the 13th ACM International Conference on Distributed and Event-Based Systems

View full text Add to dashboard Cite

Cyber Physical Systems (CPS) combine communication, computation and data storage capabilities to oversee and control physical processes in domains including manufacturing, medical monitoring and smart grids. CPS behavior can be remotely monitored by aggregating event data from various sensors, forwarded over wireless networks. One of the main challenges for CPS application developers is to manage event arrival-time boundaries and to trade off between timeliness and completeness: waiting too long until all events arrive can fail to produce a useful result, while not waiting long enough may lead to faults because the status information is incomplete. Monitoring the production lines in a factory, for example, depends on the aggregation of event data from multiple sensors in the distributed CPS, such as temperature and movement. Yet, predicting time-boundaries for individual event arrivals is difficult, if not impossible, for an application developer, because the wireless network and the sensing devices introduce latencies which vary continuously along with the load, status or environmental conditions of the network and the sensors. This paper proposes Khronos, a middleware that automatically determines timeouts for event arrivals that improve timeliness, given completeness constraint(s) specified by the CPS application developer and taking into account variations in event propagation delays. Extensive evaluations on a physical testbed show that Khronos considerably improves timeliness under varying network configurations and conditions, while satisfying application-specific completeness constraints. CCS Concepts• Information systems → Stream management; • Networks → Network monitoring; • Computer systems organization → Embedded and cyber-physical systems; • Software and its engineering → Middleware;

show abstract

Section: Future Workmentioning

confidence: 93%

Khronos

Peros

Delbruel

Michiels

et al. 2019

Proceedings of the 13th ACM International Conference on Distributed and Event-Based Systems

View full text Add to dashboard Cite

show abstract

“…Similar to our approach of specifying resource scheduling policies by leveraging reactive programming, FRP has been applied to compute the operator placement for complex event processing operators [36]. Recent research on RP focuses on issues such as concurrency [11], fault tolerance [25], distribution [35,37], different levels of consistency [23] and the application to areas such as autonomous vehicles [13] and IoT and edge computing [5].…”

Section: (Functional) Reactive Programmingmentioning

confidence: 99%

GRASS: generic reactive application-specific scheduling

Blöcher

Eichholz

Weisenburger

et al. 2019

Proceedings of the 6th ACM SIGPLAN International Workshop on Reactive and Event-Based Languages and Systems

View full text Add to dashboard Cite

High resource utilization is important to operate compute infrastructures and data centers efficiently. High utilization is achieved by multiplexing several applications over the same physical infrastructure. Yet, with this approach, the different requirements of each application have to be taken into account when scheduling resources. We propose GRASS, a reactive domain-specific abstraction that allows specifying application-tailored resource scheduling policies. We demonstrate how the declarative approach of GRASS enables extension and composition of scheduling policies. Our evaluation shows the performance benefits of considering application-specific information in a composition of scheduling policies that adapt at run time. CCS Concepts • Networks → Network resources allocation; • Software and its engineering → Scheduling; Domain specific languages.

show abstract

“…Ramson and Hirschfeld recently proposed Active Expressions [50] as a fundamental primitive to implement different flavours of RP. Other current RP research directions include debugging [51], [52], [53] and application to new domains such as IoT/edge computing and autonomous vehicles [54], [55], [56].…”

Section: Related Workmentioning

confidence: 99%

On the Semantics of Distributed Reactive Programming: The Cost of Consistency

Margara

Salvaneschi

2018

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

The reactive programming paradigm aims to simplify the development of reactive systems. It provides abstractions to define time-changing values that are automatically updated by the runtime according to their dependencies. The benefits of reactive programming in distributed settings have been recognized for long. Yet, existing solutions for distributed reactive programming enforce the same semantics as in single processes, introducing communication and synchronization costs that hamper scalability. Establishing suitable abstractions for distributed reactive programming demands for a deeper investigation of the semantics of change propagation. This paper takes a foundational approach and defines precise propagation semantics in terms of consistency guarantees that constrain the order and isolation of value updates. We study the benefits and costs of these consistency guarantees both theoretically and empirically, using case studies and synthetic benchmarks. We show that different applications require different levels of consistency and that manually implementing the required level on a middleware that provides a lower one annuls the abstraction improvements of reactive programming. This motivates a framework that enables the developers to select the best trade-off between consistency and overhead for the problem at hand. To this end, we present DREAM, a distributed reactive programming middleware with flexible consistency guarantees.

show abstract

FRP IoT modules as a Scala DSL

Cited by 8 publications

References 16 publications

Khronos

Khronos

GRASS: generic reactive application-specific scheduling

On the Semantics of Distributed Reactive Programming: The Cost of Consistency

Contact Info

Product

Resources

About