It is over 40 years since the first seminal work on priority assignment for real-time systems
using fixed priority scheduling. Since then, huge progress has been made in the field of real …

In graph-based learning models, entities are often represented as vertices in an undirected
graph with weighted edges describing the relationships between entities. In many real-world …

The trend towards multi-core/many-core architectures is well underway. It is therefore
becoming very important to develop software in ways that take advantage of such parallel …

In prior work on soft real-time (SRT) multiprocessor scheduling, tardiness bounds have been
derived for a variety of scheduling algorithms, most notably, the global earliest-deadline-first …

With the widespread adoption of multi-core architectures, it is becoming more important to
develop software in ways that takes advantage of such parallel architectures. This …

In this paper, we propose a novel Spin Orbit Torque Magnetic Random Access Memory
(SOT-MRAM) array design that could either work as non-volatile memory or implement a …

The Contention-Free (CF) policy has been extensively researched in the realm of real-time
multi-processor scheduling due to its wide applicability and the performance enhancement …

While tasks may be preemptive or non-preemptive (due to their transactional operations),
deadline guarantees in multi-core systems have been made only for those task sets in each …

The advent of multi-and many-core processors offers enormous performance potential for
parallel tasks that exhibit sufficient intra-task thread-level parallelism. With a growth of novel …

Schedulability analysis has been widely studied to provide offline timing guarantees for a set
of real-time tasks. The so-called limited carry-in technique, which can be orthogonally …