Analysis of a heuristic mapping method for parallel real-time simulation of electrical networks

This paper presents an analysis of a heuristic mapping method used in the scheduling of parallel real-time tasks. Tasks arise when an electrical network, targeted for simulation, is broken down into real-time schedulable objects with resource requirements and timing constraints. Also, tasks are characterized by their worst-ease execution times and their hard deadlines. Results from computer simulations show the dynamic behavior of the mapping method.