Data Structures with Paralell Access

Parallel programming brings out, apart from the opportunity to spread out a program execution to many simultaneously running processes sharing data, some new problems. It is necessary to synchronize these processes running in parallel and make sure that during the process communication and data sharing there will not arise any troubles. These synchronization algorithms also cannot use too much resources that are otherwise used for the actual program. This thesis describes ways of process synchronization and also provides an implementation of several algorithms for parallel queue. Implemented algorithms were also tested for their performance.