Supporting lock-based multiprocessor resource sharing protocols in real-time programming languages

2012 ◽  
Vol 25 (16) ◽  
pp. 2227-2251 ◽  
Author(s):  
Shiyao Lin ◽  
Andy Wellings ◽  
Alan Burns
Keyword(s):  
Programming Languages ◽  
Real Time ◽  
Resource Sharing

Real-time MLton: A Standard ML runtime for real-time functional programs

2021 ◽  
Vol 31 ◽  
Author(s):  
BHARGAV SHIVKUMAR ◽  
JEFFREY MURPHY ◽  
LUKASZ ZIAREK
Keyword(s):  
Programming Languages ◽  
Real Time ◽  
Concurrency Control ◽  
General Purpose ◽  
Functional Languages ◽  
Control Mechanisms ◽  
Real Time Systems ◽  
Functional Programming Languages ◽  
Standard Ml ◽  
Time Systems

Abstract There is a growing interest in leveraging functional programming languages in real-time and embedded contexts. Functional languages are appealing as many are strictly typed, amenable to formal methods, have limited mutation, and have simple but powerful concurrency control mechanisms. Although there have been many recent proposals for specialized domain-specific languages for embedded and real-time systems, there has been relatively little progress on adapting more general purpose functional languages for programming embedded and real-time systems. In this paper, we present our current work on leveraging Standard ML (SML) in the embedded and real-time domains. Specifically, we detail our experiences in modifying MLton, a whole-program optimizing compiler for SML, for use in such contexts. We focus primarily on the language runtime, reworking the threading subsystem, object model, and garbage collector. We provide preliminary results over a radar-based aircraft collision detector ported to SML.

scholarly journals Continuity and monotonicity of solutions to a greedy maximization problem

2020 ◽  
Vol 92 (1) ◽  
pp. 33-76
Author(s):  
Łukasz Kruk
Keyword(s):  
Real Time ◽  
Network Topology ◽  
Resource Sharing ◽  
Time Parameter ◽  
Maximization Problem ◽  
Fluid Models ◽  
Admissible Set ◽  
Network Modelling ◽  
Underlying Network ◽  
Real Time Transmission

Abstract Motivated by an application to resource sharing network modelling, we consider a problem of greedy maximization (i.e., maximization of the consecutive minima) of a vector in $${\mathbb {R}}^n$$ R n , with the admissible set indexed by the time parameter. The structure of the constraints depends on the underlying network topology. We investigate continuity and monotonicity of the resulting maximizers with respect to time. Our results have important consequences for fluid models of the corresponding networks which are optimal, in the appropriate sense, with respect to handling real-time transmission requests.

Sign in / Sign up

Export Citation Format

Share Document