Processor scheduling techniques are used in conjunction to exploit the major paradigms of algorithmic parallelism, geometric parallelism, and processor farming. Static process scheduling techniques are successfully used with algorithmic and geometric parallelism, whilst dynamic process scheduling is better suited in dealing with the independent processes inherent in the processor farming paradi...

−− In this paper we describe and evaluate the main features of the uRT51 processor. The uRT51 processor was designed for embedded realtime control applications. It is a processor architecture that incorporates the specific functions of a real-time system in hardware. It was described using synthesizable VHDL and it was implemented on FPGA devices. We describe how the uRT51 processor supports ti...

Real time tasks scheduling on a distributed system is complex problem. The existing real techniques are primarily based partitioned and global scheduling. In the assigned dedicated processor. advantages of approach uni-processor can be used; no migration overheads but task assignment NP hard problem optimal utilization processing nodes not possible. all maintained in single queue allocated to m...

Large-scale Non-Uniform Memory Access (NUMA) multiprocessors are gaining increased attention due to their potential for achieving high performance through the replication of relatively simple components. Because of the complexity of such systems, scheduling algorithms for parallel applications are crucial in realizing the performance potential of these systems. In particular, scheduling methods...

We show the NP-Completeness of two processor scheduling with tasks of execution time 1 or 2 units and unit interprocessor communication latency. We develop a model of scheduling in the presence of communication contention, and show the NP-Completeness of two processor scheduling with unit execution time tasks in our model.

This document describes the processor scheduling framework implemented in the Silicon Graphics IRIX Version 5 operating system. This framework provides the standard features and behavior expected of any UNIX time-sharing system, while adding support for four additional disciplines: a fast-response scheme for lowlatency real-time computing, a time-based regime for throughputoriented real-time co...