Techniques for scheduling parallel tasks on to the processors of a multiprocessor architecture must tradeoff three interrelated factors: 1) scheduling and synchronization costs, 2) load balancing, and 3) memory locality. Current scheduling techniques typically consider only one or two of these three factors at a time. We propose a novel SelfAdjusting Scheduling (SAS) algorithm that addresses al...

The application of static optimization techniques such as branch-and-bound to real-time task scheduling has been investigated. Few pieces of work, however, have been reported which propose and investigate online optimization techniques for dynamic scheduling of real-time tasks. In such task domains, the d@iculty of scheduling is exacerbated by the fact that the cost of scheduling itself contrib...

This paper proposes multiple clustered core processors as a solution that attains both low power consumption and easy programming facility. Considering the current trend of increasing power consumption and temperature, a lot of CPU venders have shipped or announced to ship multiple core processors. Especially, recent studies on heterogeneous multiple core processors show that they are more effi...

Responsive Multithreaded (RMT) Processor that controls thread execution in Simultaneous Multithreading by introducing thread priority has been invented for parallel and distributed real-time processing. This paper concerns the basic approach of real-time scheduler on RMT processor. Our goal is to build a system where various types of tasks reside; hard/soft real-time tasks, periodic/aperiodic t...

Our group has created a dynamically translating VLIW processor that uses firmware for instruction scheduling. The processor executes MIPS instructions by dynamically translating them into VLIW, and then executing the translated code. We have also implemented a combined toolchain that compiles C to binary for our VHDL processor. The motivation behind the project was to gain practice writing an a...

Abstract To accept and process the requests many IoT devices give, server on platform must open threads. Enhancing speed while working with constrained processors, memory, other resources is extremely difficult. In this paper, we propose a thread scheduling model that abstracts resources, combines queues to handle resource contention, avoids issue of frequent switching server’s underlying proce...

In this paper, processor scheduling policies that “save” processors are introduced and studied. In a multiprogrammed parallel system, a “processor saving” scheduling policy purposefully keeps some of the available processors idle in the presence of work to be done. The conditions under which processor saving policies can be more effective than their greedy counterparts, i.e., policies that neve...

Energy-aware task scheduling is critical for real-time embedded systems. Although dynamic power has traditionally been a primary source of processor power consumption, leakage power is becoming increasingly important. In this paper, we present two optimal energy-aware polynomial-time algorithms for scheduling a set of tasks with release times, deadlines and precedence constraints on a single pr...