Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SSDRM is based on the delayed rate monoton...

ÐGiven a set of precedence constrained parallel tasks with their processor requirements and execution times, the problem of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation is to find a nonpreemptive schedule of the tasks on a multicomputer such that the schedule length is minimized. This scheduling problem is substantially more difficult t...

This paper analyses the issues involved in providing virtual distributed shared memory for time-shared parallel machines. We study the performance of two di erent page management policies, namely, static and dynamic page allocation under two widely accepted scheduling policies: Gang scheduling and independent processor scheduling. The performance of each page management policy is studied under ...

Rate-monotonic scheduling (RMS) is a widely used real-time scheduling technique. This paper proposes RBound, a new admission control for RMS. RBound has two interesting properties. First, it achieves high processor utilization under certain conditions. We show how to obtain these conditions in a multiprocessor environment and propose a multiprocessor scheduling algorithm that achieves a near op...

SAD (Sum of Absolute Difference) algorithm is heavily used in motion estimation which is computationally highly demanding process in motion picture encoding. To enhance the performance of motion picture encoding on a VLIW processor, an efficient implementation of SAD algorithm on the VLIW processor is essential. SAD algorithm is programmed as a nested loop with a conditional branch. In VLIW pro...

In the design process of high-throughput applications, design choices concerning the type of processor architecture and appropriate scheduling mechanism, have to be made. Take a reed-solomon decoder as an example, the amount of clock cycles consumed in decoding a code is dependent on the amount of errors within that code. Since this is not known in advance, and the environment in which the code...

Some task scheduling algorithms generate the shortest schedule, when its input DAG satisfies a specified condition. Among those scheduling algorithms, TDS algorithm proposed a DAG condition where allocation of two parent tasks of a join task in the same processor cause longer schedule length than allocation in different processors, and it generates the shortest schedule if any input DAG satisfi...

Applications such as image processing, uid mechanics, and geophysical data analysis are examples of problems that require the high computing performance provided by multi-processor systems. Such performance depends highly on the inter-processor communication time resulting from the allocating tasks to the individual processors. This research focuses on the development of techniques that reduce ...

Many problems in the field of computer simulation of systems in science and engineering present potential for parallel implementations through one of the three major paradigms of processor farming, geometric parallelism, and algorithmic parallelism. Processor scheduling determines which processes are assigned to specific processors and when. Static process scheduling techniques are successfully...

The paper presents a sampling period dependent RST controller used in the context of control/scheduling co-design. This plant controller is implemented on a real-time operating system as a control task. A scheduling controller adapts control task periods to regulate the processor load. The link established between scheduling and plant control provides more flexibility and robustness w.r.t. the ...