Time cost analysis of parallel structures with multi-communication nodes in a shared memory

Abstract

The time costs of several parallel computation structures are analyzed. These analyses are based on assumptions that the processes communicate implicitly via the shared memory and that a locking mechanism is imposed on the access to shared variables. In previous work, an approach to estimating a set of special parallel computation structures has been developed. The authors expand this approach and propose a new technique for covering more general parallel computation structures.<>