By incorporating several microprocessors in a system, we can achieve real-time simulation at low cost. However, strategies are needed to partition and to allocate the total computation load among the processors. Two methods have been proposed, partitioning by task and by algorithm. This paper presents study results on the development of parallel algorithms using stale data and their performances in a parameter space.
