In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task is statically allocated to a processor, and tasks allocated on the same processor are handled by a single-processor scheduling algorithm. Precedence constraints among tasks of the same transaction are modeled by proper...

Real-time systems are being extensively used in applications that are mission-critical and life-critical, such as space exploration, aircraft avionics, and robotics. Since these systems are usually operating in environments that are non-deterministic, and even hazardous, it is extremely important that hard deadlines of tasks be met even in the presence of certain failures. To tolerate processor...

In this paper, we consider the problem of scheduling a set of instructions on a single processor with multiple pipelined functional units. In a superscalar processor, the hardware can issue multiple instructions every cycle, providing a fine-grained parallelism for achieving order-ofmagnitude speed-ups. I t is well known that the problem of scheduling a pipelined processor with uniform latencie...

A problem of scheduling partially ordered unit-time tasks processed on dedicated machines is formulated as a mixed graph colouring problem, i. e., an assignment integers (colours) {1, 2, …, t} to the vertices (tasks) V {ν1, ν2, νn}, G = (V, A, E) such that if vp and vq are joined by edge [νp, νq] ∈ E their colours have be different. Further, two νp νq arc (νi, νj) colour vertex νi has no greate...

В статье рассматривается задача планирования работ на многоядерном процессоре с учетом их замедления при совместном выполнении. Предложена постановка задачи и модель частично целочисленного линейного программирования, доказана NP-трудность числе ядер, ограниченном константой. Результаты планировщика Intel TBB жадного алгоритма сравниваются результатами, полученными в соответствии предложенной м...

Embedded systems such as self-driving require computing platforms with high power and low consumption. Multi/many-core meet these requirements effectively. However, for hard real-time applications, multiple demands on shared resources can impede performance, in particular, memory is a resource that restrict the desired performance significantly. Therefore, logical execution time (LET) paradigm ...

Distributed real-time and embedded (DRE) systems are often subject to stringent timing constraints. Scheduling techniques, such as rate monotonic scheduling, can be used to ensure that real-time deadlines are met. Although a processor cache can reduce the time required for a task schedule to execute, multiple task execution schedules may exist that meet deadlines but differ in cache utilization...

The concept of a reconfigurable processor comes from the idea of having a general-purpose processor coupled with some reconfigurable resources that allow implementation of custom application-specific instructions. This thesis describes OneChip, a third generation reconfigurable processor architecture that integrates a Reconfigurable Functional Unit (RFU) into a superscalar Reduced Instruction S...

Real-time systems are being extensively used in applications that are mission-critical and life-critical, such as space exploration, aircraft avionics, and robotics. Since these systems are usually operating in environments that are non-deterministic, and even hazardous, it is extremely important that hard deadlines of tasks be met even in the presence of certain failures. To tolerate processor...