Hardware

Task Scheduling in Multiprocessor System using Fork-Join Method (TSFJ)

Free registration required

Executive Summary

The performance of the multiprocessor system depends on how the tasks are scheduled in multiprocessors. If the authors allocate tasks wisely then they can get good performance of the system. The primary goal of task scheduling in multiprocessor system is to minimize the total execution time, so that they can achieve maximum speed-up and efficiency. The application program is represented by Directed Acyclic Graph (DAG) in scheduling problem. In this paper, they have proposed an algorithm for task scheduling in multiprocessor system based on fork-join method.

  • Format: PDF
  • Size: 442.58 KB