09/01/1994 09:00 AM
Computer Science
Parallel programs are frequently non- deterministic, meaning they can give different results when provided the same input. These different results arise because variations in the timing of the multiple threads cause the threads to access shared resources in different orders. The phenomena that cause the non-deterministic behavior have been (and continue to be) variously referred to as access anomalies, race conditions or just races. In a recent paper, Netzer and Miller made an important contribution to formalizing and standardizing adjectives that can be applied to ``races.\'\' In this paper we continue this effort by presenting a refined taxonomy for races in parallel programs. The terminology we suggest is not always consistent with that used previously and we describe why we believe our terminology is more descriptive.
