Skip to main content

C++ Multithreading - Basic thread creation

C++11 standard introduces integrated sublibrary for multithreading. It has been moved from Boost library. However because multithreading is very important topic in software development I decided to make multithreading tutorial as separate section of this blog.

I will not explain here theory about multithreading, but I will try to explain usage of multithreading based on thread library from C++11 standard. If theory explanation will be required for some aspects I will try to put links to separate articles explaining them.

Introduction theory about multithreading you can find on Wikipedia article here

This article will present basic threads creation and usage in C++. Code of example you can find here:
Output of the example is (it can be little other - depends how thread will be invoked by OS):
In point I we are creating new thread where print() function will be invoked. This thread will work in parallel to the main function (main application is second thread called main thread)

Point II shows printing values using for loop invoked from main thread.

Point III is invoking function join() which will wait until thread1 will finish. This is basic synchronization. Without that function there is possible that we will receive termination error if main thread finished and thread1 did not finished its job.

If we do not want to wait until thread1 will finish and do not want to receive termination error we could use detach() function (look point IV). Thanks to that function thread1 will be detached from our main application and will work in the background as deamon thread. We will be able to operate our next function without waiting for its finish if we do not need it.

Of course output of this example can be different on your machine. It depends how your OS schedule threads invoking. Threads are managed by OS so you can see different results if your threads are not synchronized properly. This is basic application so it does not contain sophisticated thread synchronization. I will explain how to synchronize threads in next articles.

This is first basic tutorial which presents how to create basic thread to run two separate function in parallel. In next multithreading articles I will show how to pass parameters for multithreading functions, return values, synchronize variables between threads and other thread-related topics.

Code of this example you can find on our GitHub account here: https://github.com/xmementoit/CppAdventureExamples/tree/master/multithreading/basicThreads

Source: http://www.javastudychannel.com/attachments/Resources/5002-23399-Multi-threaded-program.jpg

Comments

Post a Comment

Popular posts from this blog

GDB Automatic Deadlock Detector

Have you ever had a problem with detection deadlock between threads in your C/C++ application? Would you like to do that automatically? Try this GDB Automatic Deadlock Detector from my github: GDB Automatic Deadlock Detector Picture source: http://csunplugged.org/wp-content/uploads/2015/03/deadlock.jpg1286488735

STL - count and count_if algorithms

One of the basic and most useful STL algorithms is algorithm which can be used to count number of elements within selected container according to specified criteria. In order to do that we can use std::count or std::count_if algorithm. std::count (firstElementIterator, lastElementIterator, elementForSearch) - is function which will go through container using firstElementIterator and lastElementIterator and return number of container elements which value is equal elementForSearch std::count_if (firstElementIterator, lastElementIterator, UnaryPredicateFunction) - is function which examine range from firstElementIterator to lastElementIterator and return number of container elements which fulfill UnaryPredicateFunction criteria. UnaryPredicateFunction is function having following signature: bool functionName(const Type& a) . So, count_if returns number of elements where UnaryPredicateFunction returns true for. For better understanding let's take a

Advanced C++ - Stack unwinding

Stack unwinding is normally a concept of removing function entries from call stack (also known as Execution stack, Control stack, Function stack or Run-time stack). Call Stack is a stack data structure that stores active functions' addresses and helps in supporting function call/return mechanism. Every time when a function is called, an entry is made into Call stack which contains the return address of the calling function where the control needs to return after the execution of called function. This entry is called by various names like stack frame , activation frame or activation record. With respect to exception handling , stack Unwinding is a process of linearly searching function call stack to reach exception handler. When an exception occurs, if it is not handled in current function where it is thrown, the function Call Stack is unwound until the control reaches try block and then passes to catch block at the end of try block to handle exception. Also, in this proc