Issues in run-time support for tightly-coupled parallel processing
SEDMS III Papers from the symposium on Experiences with distributed and multiprocessor systems
ParC—an extension of C for shared memory parallel processing
Software—Practice & Experience
Issues related to MIMD shared-memory computers: the NYU ultracomputer approach
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
| Hi-index | 0.00 |
Most parallel languages provide means to express parallelism, e.g. a parallel-do construct, but no means to terminate the parallel activities spawned by such constructs. We propose three high-level primitives for this purpose, which are defined by analogies with primitives that break out of sequential iterative constructs. The primitives are pcontinue, which terminates the calling activity, pbreak, which terminates all the activities in the construct that spawned the calling activity, and return, which terminates all the activities created in the current function call. These constructs are especially useful in search problems, where an activity that finds a solution can terminate other activities that are investigating inferior approaches. Given that parallel constructs can be nested, activities form a tree rooted at the original activity that started the program. The main challenge in implementing pbreak and return is identifying the subtree of activities that should be killed. Three algorithms were designed and implemented, and experiments show that using these constructs can provide significant performance benefits.