In this paper, we propose a static scheduling algorithm for allocating task graphs to fullyconnected multiprocessors. We discuss six recently reported scheduling algorithms and show that they possess one drawback or the other which can lead to poor performance. The proposed algorithm, which is called the Dynamic Critical-Path (DCP) scheduling algorithm, is different from the previously proposed...

Today, distributed architectures are based on multi core SMP nodes. Several middleware, like the FlowVR framework, exist to design interactive and heterogeneous distributed applications for these architectures. FlowVR defines an application as a set of codes mapped on cluster nodes and linked by a communication and synchronization network. But if we control the way modules are synchronized and ...

In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provides more features and capabilities than existing algorithms that schedule only independent tasks in real-time homogeneous systems. In addition, the proposed algorithm takes the heterogeneities of computation, communica...

It is difficult to execute a single big problem on a single processor in a reasonable time. Because of this, it is divided into number of tasks and the length of each schedule must be so that it results in appropriate scheduling in a multiprocessor system. The task scheduling [1,2] problem in multiprocessors is to allocate the set of tasks to processors such that optimal or sub optimal utilizat...

We consider wait-free synchronization in multiprogrammed uniprocessor and multiprocessor systems in which the processes bound to each processor are scheduled for execution using a scheduling quantum. We show that, in such systems, any object with consensus number P in Herlihy's wait-free hierarchy is universal for any number of processes executing on P processors, provided the scheduling quantu...

This paper addresses the importance of locality when migrating tasks of a parallel program between processors for load balancing in a multiprocessor. Static and preprocessing task scheduling algorithms work well for certain applications, but irregular problems often require dynamic load balancing. Many heuristics have been developed for scheduling the proper number of iterations of a parallel l...

This paper deals with low-energy code generation for a highly optimized digital signal processor designed for mobile communication applications. We present a genetic algorithm based code generator (GCG), and an instruction-level power model for this processor. Our code generator is capable of reducing the power dissipation of target applications by means of two techniques: First, GCG minimizes ...

The progress of computer architecture has increased the necessity to design efficient scheduling algorithms according to the types of computer systems. We survey recent results of optimization and approximation algorithms for deterministic models of computer scheduling. We deal with identical, uniform and unrelated parallel processor systems, and flowshop systems. Optimality criteria considered...

We consider wait-free synchronization in multiprogrammed uniprocessor and multiprocessor systems in which the processes bound to each processor are scheduled for execution using a scheduling quantum. We show that, in such systems, any object with consensus number P in Herlihy's wait-free hierarchy is universal for any number of processes executing on P processors, provided the scheduling quantu...

In this paper we propose an Intelligent Management System which is capable of managing the automobile functions using the rigorous real-time principles and a multicore processor in order to realize higher efficiency and safety for the vehicle. It depicts how various automobile functionalities can be fine grained and treated to fit in real time concepts. It also shows how the modern multicore pr...