in the directory /pub/techreports. Abstracts and compressed postscript files are available via Real-time, multi-tasking software, such as that used in embedded control systems, is notoriously difficult to develop and maintain. Scheduling theory offers a mathematically-sound way of predicting the timing behaviour of sets of communicating, concurrent tasks, but its principles are often unfamiliar...

A graphics workstation should offer both a wide variety of 20 and 3D real­ time display functions as well as a programmable parallel-processing capacity for large processing tasks. A system concept is proposed that meets these require­ ments by offering a multi-processor configuration with general-purpose pro­ grammable processors, enhanced with specific logic that can perform for each node a l...

We study the problem of scheduling applications composed of a large number of tasks on heterogeneous clusters. Tasks are identical, independent from each other, and can hence be computed in any order. The goal is to execute all the tasks as quickly as possible. We use the Master-Worker paradigm, where tasks are maintained by the master which will hand out batches of a variable amount of tasks t...

Real-time applications that process streams of data can be modelled by a pipeline of tasks, to be executed on a multi-processor system. The pipeline is periodically activated, and each instance must be completed before an end-to-end deadline. Three important problems must be solved by real-time designers: how to allocate tasks to processors, how to assign scheduling parameters to tasks, and how...

Alongside the rise of multi-processor machines in the last decade, concurrent programming models have grown to near ubiquity. Programs built using these models are prone to bugs with rare pre-conditions, arising from unanticipated interactions between parallel tasks. Moreover, conventional debugging methodologies are not well suited to deal with non-deterministic faults, leading to inefficient ...

Alongside the rise of multi-processor machines, concurrent programming models have grown to near ubiquity. Programs built on these models are prone to bugs with rare pre-conditions, arising from unanticipated interactions between parallel tasks. Replayers can be efficient on uni-processor machines, but struggle with unreasonable overhead on multi-processors, both concerning slowdown of the exec...

The Co-Processing Intrusion Detection System (CuPIDS) project explores improving information system security through dedicating computational resources to system security tasks in a shared resource, multi-processor (MP) architecture. Our research explores ways in which this architecture offers improvements over the traditional uni-processor (UP) model of security. One approach we examined has a...

Abstract The advancement of multi-core processor technology has changed the course of computing and enabled us to maximize the computing performance. In this study, we present an approach of task parallelism for the TwigStack algorithm on a multi-core system to find all occurrences of an XML query twig pattern in a large XML database. The TwigStack agorithm comprises two tasks. The first task i...

In the multi-core and multiprocessor domain there are two scheduling approaches, global and partitioned scheduling. Under global scheduling each task can execute on any processor while under partitioned scheduling tasks are allocated to processors and migration of tasks among processors is not allowed. Under global scheduling the higher utilization bound can be achieved, but in practice the ove...

Abstract RISC-V set architecture is playing an increasingly important role in processor technology due to its open instructions which allow researchers build and improve computing systems. However, many architectures exist multi-core with complex designs, large area, high-power consumption. This paper studies open-source a simple design less power The depends on single core processor, Taiga. Tw...