Resource allocation for high-performance real-time applications is challenging due to the applications' data-dependent nature, dynamic changes in their external environment, ...
Static-priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constra...
We present a method for providing response-time guarantees in Asynchronous Transfer Mode (ATM) networks. The method is based on traditional real-time CPU Response-Time Analysis (R...
In [6], we proposed a new commit protocol, OPT, specially designed for use in distributed firm-deadline real-time database systems. OPT allows transactions to “optimistically...
Ramesh Gupta, Jayant R. Haritsa, Krithi Ramamritha...
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For exampl...
Several new wait-free object-sharing schemes for realtime uniprocessors and multiprocessors are presented. These schemes have characteristics in common with the priority inheritan...
James H. Anderson, Rohit Jain, Srikanth Ramamurthy
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....