Scheduling task graphs for execution in dynamic SMP clusters with bounded number of resources

  • Authors:
  • Lukasz Masko

  • Affiliations:
  • Institute of Computer Science of the Polish Academy of Sciences, Warsaw, Poland

  • Venue:
  • PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper presents an algorithm for scheduling parallel tasks in a parallel architecture based on multiple dynamic SMP clusters, in which processors can be switched between shared memory modules at runtime. Memory modules and processors are organized in computational System–on–Chip (SoC) modules of a fixed size and are inter–connected by a local communication network implemented in a Network–on–Chip technology (NoC). Processors located in the same SoC module can communicate using data transfers on the fly. A number of such SoC modules can be connected using a global interconnection network to form a larger infrastructure. The presented algorithm schedules initial macro dataflow program graphs for such an architecture with a given number of SoC modules, assuming a fixed size of a module. First, it distributes program graph nodes between processors. Then it transforms and schedules computations and communication to use processor switching and read on the fly facilities. Finally, it divides the whole set of processors into subsets of a given size, which then are mapped to separate SoC modules.