Task scheduling is one of the main challenges in every system design, and especially in embedded systems design. Task scheduling might be classified in two broad categories: (1) compile time (static scheduling) or (2) run time (dynamic scheduling). Recently there has been a growing interest in the development of run-time scheduling techniques for platform-based designs [1][2]. This interest is ...

Solving sparse linear systems can lead to processing tree workflows on a platform of processors. In this study, we use the model of malleable tasks motivated in [1, 9] in order to study tree workflow schedules under two contradictory objectives: makespan minimization and memory minization. First, we give a simpler proof of the result of [8] which allows to compute a makespan-optimal schedule fo...

Cloud Computing is an emerging technology evolving to the new computing framework. Scheduling of task and allocation of virtualized resources in such a widely distributed dynamic environment is a challenging assignment. Attaining proficiency and providing fairness to tasks execution is the primary consideration of the task scheduling algorithm. The objective of this paper is to give a comparati...

Task scheduling is heart of any grid application which guides resource allocation in grid. Heuristic task scheduling strategies have been used for optimal task scheduling. Heuristic techniques have been widely used by the researchers to solve resource allocation problem in grid computing. In this paper, we classify heuristic task scheduling strategies in grid on the basis of their characteristi...