Abstract
In the paper the time costs of several parallel computation structures are analyzed. These analyses are based on the 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. In this paper, we expand this approach and propose a new technique for covering more general parallel computation structures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of King Saud University - Computer and Information Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
