Process synchronization in multiprocessor and multi-core processor

The goal of this paper is to review some of the several approaches that have been proposed in recent years to address the synchronization problems in both multiprocessor and the multi-core processor. Here also propose some synchronization model to address the challenges faced by synchronization mechanisms on modern parallel computing architectures. Shared-memory multiprocessors are frequently used as compute servers with multiple parallel applications executing at the same time. In such environments, the efficiency of a parallel application can be significantly affected by the operating system scheduling policy. In this paper, we use detailed simulation studies to evaluate the performance of several different scheduling strategies, these include regular priority scheduling, co-scheduling or gang scheduling, process control with processor partitioning, handoff scheduling, and affinity-based scheduling. We also explore tradeoffs between the use of busy-waiting and blocking synchronization primitives and their interactions with the scheduling strategies.