We show that previous algorithmic and scheduling work concerning the use of lock-free objects in hard real-timesystems can be extended to support real-time transactions on memory-...
James H. Anderson, Srikanth Ramamurthy, Mark Moir,...
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...
Eduardo Moreno, Daniel G. Espinoza, Marcos Goycool...
We study concurrent processes modelled as workflow Petri nets extended with resource constraints. We define a behavioural correctness criterion called soundness: given a sufficient...
— We study stability regions of multi-rate Gaussian multiple access (MAC) and broadcast (BC) networks with centralized scheduling algorithms. Techniques are presented to characte...
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...