MTS2: Many Task Scheduling Simulator
Adrian Stratulat, Raluca Oncioiu, Florin Pop, Ciprian Dobre · 2015
The Many Task Computing paradigm was first introduced by Ioan Raicu and could be described shortly as solving a large number of tasks with short time executions (i.e. seconds to minutes long) that are data intensive. We propose MTS: Many Task Scheduling Simulator that can be used for a broad range of simulations after each simulation one can visualize the results. The purpose of MTS framework is to simulate events that happen inside a cluster in order to experimentally check or validate various classes of scheduling algorithms. Our event-based simulator provides the building blocks that can be used to implement mathematical models for simulations and it is designed to be extensible, fast and scalable. For the purpose of scheduling algorithm evaluation, the performance is critical: we will study the asymptotic behaviour of some scheduling algorithms under extreme conditions. We will show that MTS can be used in various scheduling algorithms and performs better than SimMatrix on a quad core machine, regarding the time per task: 7 microseconds compared to 100 microseconds for simulations with one node and less than 0.5 microseconds with MTS for simulations with more than 64 nodes.