Task scheduling is essential for the suitable operation of multiprocessor systems. The task scheduling is prime significance of multiprocessor parallel systems. In this paper, an efficient method based on genetic algorithms is developed to solve the multiprocessor scheduling problem. The paper also aims to provide a comparative study of incorporating heuristics such as ‘Earliest Deadline First ...

Many problems in computer vision and image processing present potential for parallel implementations through one of the three major paradigms of geometric parallelism, algorithmic parallelism and processor farming. Static process scheduling techniques are used successfully to exploit geometric and algorithmic parallelism, while dynamic process scheduling is better suited to dealing with the ind...

ÐEfficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NP-complete in general cases as well as in several restricted cases. Because of its key importance, this problem has been extensively studied and various algorithms have been proposed in the literature which are mainly for ...

This paper describes and analyzes a paradigm for scheduling computations on a network of multiprocessors using large-grain dataj_ow scheduling at run time. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Many applications characterized by static flow exist, and they include real-time control and digital ...

For many years, scheduling problems have been concerned either with parallel processor systems or with dedicated processors job shop type systems. With a development of new computing architectures this partition is no longer so obvious. Multi-core (processor) computers equipped with GPU co-processors require new scheduling strategies. This paper is devoted to a characterization of this new type...

Scheduling real-time systems on multiprocessors introduces complexities that do not arise when using uniprocessors. If the processors do not all operate at the same speed, scheduling becomes even more complex. When scheduling using EDF on multiprocessors, breaking deadline ties in different ways can change the resulting schedule dramatically. We consider methods to resolve the ambiguities in ED...

Multicore architecture otherwise called as SoC consists of large number of processors packed together on a single chip uses hyper threading technology. This increase in processor core brings new advancements in simultaneous and parallel computing. Apart from enormous performance enhancement, this multicore platform adds lot of challenges to the critical task execution on the processor cores, wh...

With more cores integrated into one single chip, the overall power consumption from the multiple concurrent running programs increases dramatically in a CMP processor which causes the thermal problem becomes more and more severer than the traditional superscalar processor. To leverage the thermal problem of a multicore processor, two kinds of orthogonal technique can be exploited. One is the co...

Job scheduling is a fundamental issue in achieving a high performance on the Grids. In grid computing several applications require numerous resources for execution which are not often available for them, thus presence of a scheduling system to allocate resources to input jobs is vital. This paper introduces a model and a job scheduling algorithm in grid computing environments. Computational gri...

A simple fork and join type of job structure has been extensively used for performance evaluation of processor scheduling policies in multiprocessor systems. However, parallel programs often exhibit a more complicated structure. It is not clear how the program structure affects the performance of processor scheduling policies. This paper studies the impact of the program structure on the perfor...