Synchronization (computer science)

In computer science, synchronization refers to one of two distinct but related concepts: synchronization of processes, and synchronization of data. Process synchronization refers to the idea that multiple processes are to join up or handshake at a certain point, in order to reach an agreement or commit to a certain sequence of action. Data synchronization refers to the idea of keeping multiple copies of a dataset in coherence with one another, or to maintain data integrity. Process synchronization primitives are commonly used to implement data synchronization.

Thread or process synchronization

Figure 1: Three processes accessing a shared resource (critical section) simultaneously.

Thread synchronization is defined as a mechanism which ensures that two or more concurrent processes or threads do not simultaneously execute some particular program segment known as critical section. When one thread starts executing the critical section (serialized segment of the program) the other thread should wait until the first thread finishes. If proper synchronization techniques^[1] are not applied, it may cause a race condition where, the values of variables may be unpredictable and vary depending on the timings of context switches of the processes or threads.

For example, suppose that there are three processes namely, 1, 2 and 3. All three of them are concurrently executing and then need to share a common resource (critical section) as shown in Figure 1. Synchronization should be used here to avoid any conflicts for accessing this shared resource. Hence, when Process 1 and 2 both try to access that resource it should be assigned to only one process at a time. If it is assigned to Process 1, the other process (Process 2) needs to wait until Process 1 frees that resource (as shown in Figure 2). ^[2]

Figure 2: A process accessing a shared resource if available, based on some synchronization technique.

Another synchronization requirement which needs to be considered is the order in which particular processes or threads should be executed. For example, we cannot board a plane until we buy the required ticket. Similarly, we cannot check emails before validating our credentials (i.e., user name and password). In the same way, an ATM will not provide any service until we provide it with a correct PIN.^[3]

Other than mutual exclusion, synchronization also deals with the following:

• deadlock, which occurs when many processes are waiting for a shared resource (critical section) which is being held by some other process. In this case the processes just keep waiting and execute no further;
• starvation, which occurs when a process is waiting to enter the critical section but other processes keep on executing the critical section and the first process just keeps on waiting;
• priority inversion, which occurs when a high priority process is in the critical section, it may be interrupted by a medium priority process. This is the violation of rules but this may happen and may lead to some serious consequences when dealing with real-time problems;
• busy waiting, which occurs when a process is waiting for its turn but is at the same time continuously checking to see if it is now its turn to process or not. This checking is basically robbing the processing time of other processes.

Processes access to critical section is controlled by using synchronization techniques. This may apply to a number of domains.

Classic problems of synchronization

The following are some classic problems of synchronization:

• The Producer–Consumer Problem (also called the The Bounded Buffer Problem);
• The Readers–Writers Problem;
• The Dining Philosophers Problem.

These problems are used to test nearly every newly proposed synchronization scheme or primitive.

this is data ,class and object in c++

Hardware synchronization

Many systems provide hardware support for critical section code.

A single processor or uniprocessor system could disable interrupts by executing currently running code without preemption, which is very inefficient on multiprocessor systems.^[4] "The key ability we require to implement synchronization in a multiprocessor is a set of hardware primitives with the ability to atomically read and modify a memory location. Without such a capability, the cost of building basic synchronization primitives will be too high and will increase as the processor count increases. There are a number of alternative formulations of the basic hardware primitives, all of which provide the ability to atomically read and modify a location, together with some way to tell if the read and write were performed atomically. These hardware primitives are the basic building blocks that are used to build a wide variety of user-level synchronization operations, including things such as locks and barriers. In general, architects do not expect users to employ the basic hardware primitives, but instead expect that the primitives will be used by system programmers to build a synchronization library, a process that is often complex and tricky."^[5] Many modern hardware provides special atomic hardware instructions by either test-and-set the memory word or compare-and-swap contents of two memory words.

Synchronization strategies in programming languages

In Java, there are two common synchronization strategies to prevent thread interference and memory consistency errors:^[2]

• synchronized method, which includes the synchronized keyword in the declaration of the method. So when any thread invokes this synchronized method, that method acquires the intrinsic lock by its own (automatically) for that method's object and it releases the lock when the method returns, even if the return was caused by some uncaught exception;
• synchronized statement, where we declare a block of code to be synchronized. Unlike synchronized methods, synchronized statements need to specify the objects that provide the intrinsic lock. To improve the concurrency with fine-grained synchronization, synchronized statements are very useful because they prevent unnecessary blocking.

The .NET framework has synchronization primitives. "Synchronization is designed to be cooperative, demanding that every thread or process follow the synchronization mechanism before accessing protected resources (critical section) for consistent results." In .NET, locking, signaling, lightweight synchronization types, spinwait and interlocked operations are some of mechanisms related to synchronization.^[6]

Synchronization examples

Following are some synchronization examples with respect to different platforms.^[7]

Synchronization in Windows

Windows provides:

• interrupt masks, which protect access to global resources (critical section) on uniprocessor systems;
• spinlocks, which prevent, in multiprocessor systems, spinlocking-thread from being preempted;
• dispatchers, which act like mutexes, semaphores, events, and timers.

Synchronization in Linux

Linux provides:

• semaphores;
• spinlocks;
• readers–writer locks, for the longer section of codes which are accessed very frequently but don't change very often.

Enabling and disabling of kernel preemption replaced spinlocks on uniprocessor systems. Prior to kernel version 2.6, Linux disabled interrupt to implement short critical sections. Since version 2.6 and later, Linux is fully preemptive.

Synchronization in Solaris

Solaris provides:

• semaphores;
• condition variables;
• adaptive mutexes, binary semaphores that are implemented differently depending upon the conditions;
• readers–writer locks:
• turnstiles, queue of threads which are waiting on acquired lock.

Pthreads synchronization

Pthreads is a platform-independent API that provides:

• mutexes;
• condition variables;
• readers–writer locks;
• spinlocks;
• barriers.

Data synchronization

Figure 3: Changes from both server and client(s) are synchronized.

A distinctly different (but related) concept is that of data synchronization. This refers to the need to keep multiple copies of a set of data coherent with one another or to maintain data integrity, Figure 3. For example, database replication is used to keep multiple copies of data synchronized with database servers that store data in different locations.

Examples include:

• file synchronization, such as syncing a hand-held MP3 player to a desktop computer;
• cluster file systems, which are file systems that maintain data or indexes in a coherent fashion across a whole computing cluster;
• cache coherency, maintaining multiple copies of data in sync across multiple caches;
• RAID, where data is written in a redundant fashion across multiple disks, so that the loss of any one disk does not lead to a loss of data;
• database replication, where copies of data on a database are kept in sync, despite possible large geographical separation;
• journaling, a technique used by many modern file systems to make sure that file metadata are updated on a disk in a coherent, consistent manner.

Challenges in data synchronization

Some of the challenges which user may face in data synchronization:^[8]

• data formats complexity;
• real-timeliness;
• data security;
• data quality;
• performance.

Data formats complexity

When we start doing something, the data we have usually is in a very simple format. It varies with time as the organization grows and evolves and results not only in building a simple interface between the two applications (source and target), but also in a need to transform the data while passing them to the target application. ETL (extraction transformation loading) tools can be very helpful at this stage for managing data format complexities.

Real-timeliness

This is an era of real-time systems. Customers want to see the current status of their order in e-shop, the current status of a parcel delivery—a real time parcel tracking—, the current balance on their account, etc. This shows the need of a real-time system, which is being updated as well to enable smooth manufacturing process in real-time, e.g., ordering material when enterprise is running out stock, synchronizing customer orders with manufacturing process, etc. From real life, there exist so many examples where real-time processing gives successful and competitive advantage.

Data security

There are no fixed rules and policies to enforce data security. It may vary depending on the system which you are using. Even though the security is maintained correctly in the source system which captures the data, the security and information access privileges must be enforced on the target systems as well to prevent any potential misuse of the information. This is a serious issue and particularly when it comes for handling secret, confidential and personal information. So because of the sensitivity and confidentiality, data transfer and all in-between information must be encrypted.

Data quality

Data quality is another serious constraint. For better management and to maintain good quality of data, the common practice is to store the data at one location and share with different people and different systems and/or applications from different locations. It helps in preventing inconsistencies in the data.

Performance

There are five different phases involved in the data synchronization process:

• data extraction from the source (or master, or main) system;
• data transfer;
• data transformation;
• data load to the target system.

Each of these steps is very critical. In case of large amounts of data, the synchronization process needs to be carefully planned and executed to avoid any negative impact on performance.

Mathematical foundations

Synchronization was originally a process-based concept whereby a lock could be obtained on an object. Its primary usage was in databases. There are two types of (file) lock; read-only and read–write. Read-only locks may be obtained by many processes or threads. Readers–writer locks are exclusive, as they may only be used by a single process/thread at a time.

Although locks were derived for file databases, data is also shared in memory between processes and threads. Sometimes more than one object (or file) is locked at a time. If they are not locked simultaneously they can overlap, causing a deadlock exception.

Java and Ada only have exclusive locks because they are thread based and rely on the compare-and-swap processor instruction.

An abstract mathematical foundation for synchronization primitives is given by the history monoid. There are also many higher-level theoretical devices, such as process calculi and Petri nets, which can be built on top of the history monoid.

See also

• Futures and promises, synchronization mechanisms in pure functional paradigms

References

• Schneider, Fred B. (1997). On concurrent programming. Springer-Verlag New York, Inc. ISBN 0-387-94942-9. 

External links

• Anatomy of Linux synchronization methods at IBM developerWorks
• The Little Book of Semaphores, by Allen B. Downey