Comparison of Program Task Scheduling Algorithms for Dynamic SMP Clusters with Communication on the Fly

Abstract

The paper presents comparison of the two scheduling algorithms developed for program structurization for execution in dynamic SMP clusters implemented in Systems on Chip (SoC) technology. SoC modules are built of a set of processors, memory modules and a multi–bus interconnection network. A set of such SoCs is interconnected by a global communication network. Inter–processor communication inside SoC modules uses a novel technique of data transfers on the fly. The algorithms present two different scheduling approaches. The first uses ETF–based genetically supported list scheduling heuristics to map nodes of a program to processors. The second is a clustering–based algorithm using Moldable Tasks (MT) to structure the graph. Both algorithms structure computations and local data transfers to introduce processor switching and data transfers on the fly. The algorithms were tested using a set of automatically generated parameterized program graphs. The results were compared to results obtained using a classic ETF–based list scheduling without data transmissions on the fly.KeywordsExecution TimeSchedule AlgorithmCache SizeMemory ModuleData CacheThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.