The paper presents a novel allocation algorithm to allocate independent real time tasks on a processor in a way that improves the processor's throughput (Processor's throughput is the number of tasks the processor can accept for execution). The proposed approach allocates tasks' workloads (task's workload is the percentage of work required by the processor to execute the tas...

This paper describes the implementation of the Fast Fourier Transform (FFT) on the Reconfigurable Data Path Processor (RDPP) under development by the Institute of Advanced Microelectronics and NASA Goddard Space Flight Center. The RDPP implements a multi-stage computational pipeline, optimized for systolic signal processing applications. We implement the Goertzel FFT algorithm, which is able to...

Aperiodic requests with unknown execution times and unknown arrival patterns are dynamically mapped to ratebased execution (RBE) tasks with variable rates and scheduled such that the real-time tasks are guaranteed to meet their deadlines. The aperiodic requests dynamically share the available processor capacity without reserving a fixed processor capacity for any one aperiodic request (or class...

In real-time systems, a task needs to be performed correctly and timely. The correctness of each computation depends on both the logical results of the computation and the time at which results are produced. So “time” is most important in real-time application systems. Multicore and multithreaded CPUs becomes the new approach in real time system to achieve system performance, power efficiency, ...

Task pools have been shown to provide efficient load balancing for irregular applications on heterogeneous platforms. Often, distributed data structures are used to store the tasks and the actual load balancing is achieved by task stealing where an idle processor accesses tasks from another processor. In this paper we extent the concept of task pools to adaptive task pools which are able to ada...

In this paper, we present a basic model for describing hardand software of heterogeneous multi-DSP systems. The software part consists of a task model that has been tuned to suit typical, cyclic DSP applications. Hardware is described by a processor model adapted to multi-DSP systems with point-to-point communication structure, which also includes an exact model of communication timing behavior...

Space systems are hard real-time systems, where the worst-case execution time (WCET) of tasks needs to be known to prove absence of deadline misses. For simple processor and memory architectures it is possible to statically derive a safe upper bound of the WCET. However, future requirements in more autonomous missions require more processing power. This increase in processing power is approache...

The problem of scheduling on-line a stream of multi-tasked jobs on a set of parallel processors is considered. The goal is to minimize the average sojourn time experienced by each individual job in the system. The arriving jobs are comprised of parallel applications, each consisting of multiple independent tasks that are instantaneously assigned to processor queues upon its arrival to the syste...

Future exascale systems will be based on multi-core processors, but even today’s multi-core processors can be asymmetric and exhibit limitations and bottlenecks that are different from those found on a symmetric multiprocessor. In this paper we investigate the performance of a cluster node based on the Intel Xeon E5345 quad-core processor and note that despite the symmetry implied by the progra...