Ongoing Optimization

3 August 2016

Contents[Show]

Now it's time to put the theory into practice. The job is quite easy. A small program should undergo an ongoing optimization.

The program

// ongoingOptimization.cpp

#include <iostream>
#include <thread>

int x= 0;
int y= 0;

void writing(){
  x= 2000;
  y= 11;
}

void reading(){ 
  std::cout << "y: " << y << " ";
  std::cout << "x: " << x << std::endl;
}

int main(){
  std::thread thread1(writing);
  std::thread thread2(reading);
  thread1.join();
  thread2.join();
}

The program is quite simple. It consists of two threads thread1 and thread2.thread1 writes the values x and y. thread 2 reads the values x and y in the opposite direction. The execution of the program is not so thrilling either.

ongoingOptimization

But you see, even this simple program has different results. So I finally come to my key idea.

In the process of the ongoing optimization of the program, I have two questions in my mind.

Is the program well defined? Precisely, is there a data race?
Which values for x and y are possible?

The first question is often very challenging to answer. So I will reason in the first step about the program and I will verify in the second step my reasoning with CppMem. If I have answered the first question, the second answer can easily be derived. I will provide the possible values in a table.

schabloneEng

But still, one question isn't answered yet? What do I mean by ongoing optimization? I mean by ongoing optimization, that I try to improve the program by weakening the C++ memory model. So in my journey, I discuss the following stations.

Non-atomic variables
Locks
Atomics with sequential consistency
Atomics with acquire-release semantic
Atomics with relaxed semantic
Volatile variables

What's next?

Of course, this was a very short post. But this post should provide you only the context of my ongoing optimization. In case you are bored, reason about the small program and answer the two question.

Is the program well defined?
Which values for x and y are possible?

Still bored? Then reason about the weakening of the memory model in the program and about the consequences. In the next post, I will analyse the unsynchronized access with the help of CppMem. Stay tuned.

Thanks a lot to my Patreon Supporters: Matt Braun, Roman Postanciuc, Tobias Zindl, Marko, G Prvulovic, Reinhold Dröge, Abernitzke, Frank Grimm, Sakib, Broeserl, António Pina, Sergey Agafyin, Андрей Бурмистров, Jake, GS, Lawton Shoemake, Animus24, Jozo Leko, John Breland, Louis St-Amour, Venkat Nandam, Jose Francisco, Douglas Tinkham, Kuchlong Kuchlong, Robert Blanch, Truels Wissneth, Kris Kafka, Mario Luoni, Neil Wang, Friedrich Huber, lennonli, Pramod Tikare Muralidhara, Peter Ware, Daniel Hufschläger, Alessandro Pezzato, Evangelos Denaxas, Bob Perry, Satish Vangipuram, Andi Ireland, Richard Ohnemus, Michael Dunsky, Leo Goodstadt, John Wiederhirn, Yacob Cohen-Arazi, Florian Tischler, Robin Furness, Michael Young, Holger Detering, Bernd Mühlhaus, Matthieu Bolt, Stephen Kelley, Kyle Dean, Tusar Palauri, Dmitry Farberov, Ralf Holly, Juan Dent, George Liao, Daniel Ceperley, and Jon T Hess.

Thanks in particular to Jon Hess, Lakshman, Christian Wittenhorst, Sherhy Pyton, Dendi Suhubdy, Sudhakar Belagurusamy, Richard Sargeant, Rusty Fleming, Ralf Abramowitsch, John Nebel, and Mipko.

My special thanks to Embarcadero

My special thanks to PVS-Studio

Mentoring Program in English

"Fundamentals for C++ Professionals": Reopens October 2022
"Design Patterns and Architectural Patterns in C++": Start January 2023

Do you want to stay informed about my mentoring programs? Write to This email address is being protected from spambots. You need JavaScript enabled to view it..

Seminars

I'm happy to give online seminars or face-to-face seminars worldwide. Please call me if you have any questions.

Bookable (Online)

German

Embedded Programmierung mit modernem C++: 28.06.2022 - 30.06.2022 (Termingarantie)
C++20: 23.08.2022 - 25.08.2022 (Termingarantie)
Clean Code: Best Practices für modernes C++: 11.10.2022 - 13.10.2022
Design Pattern und Architekturpattern mit C++: 08.11.2022 - 10.11.2022 (Termingarantie)

Standard Seminars (English/German)

Here is a compilation of my standard seminars. These seminars are only meant to give you a first orientation.

New

Contact Me

Phone: +49 7472 917441
Mobil:: +49 176 5506 5086
Mail: This email address is being protected from spambots. You need JavaScript enabled to view it.
German Seminar Page: www.ModernesCpp.de
English Seminar Page: www.ModernesCpp.net

Modernes C++,

RainerGrimmSmall

Tags: CppMem, Ongoing Optimization

Comments

0 #1 http://s600.net 2016-10-02 01:39

I enjoy the efforts you have put in this, appreciate it for
all the great posts.

Quote

0 #2 datablog 2016-10-05 00:14

Hiya, I am really glad I've found this info. Nowadays bloggers publish only about
gossips and internet and this is actually frustrating.
A good web site with interesting content, that is what I need.
Thank you for keeping this web site, I will be visiting it.
Do you do newsletters? Cant find it.

Quote

0 #3 Paul 2016-10-25 19:26

You have remarked very interesting points! ps nice web site.

Quote

0 #4 Photos For instagram 2016-10-29 01:54

I don't commonly comment but I gotta admit appreciate it
for the post on this perfect one :D.

Quote

0 #5 http://Iprps.mx 2016-11-16 12:32

Really wonderful visual appeal on this internet
site, I'd rate it 10 10.

Quote

0 #6 datenschmutz weblog 2016-11-18 19:26

Hello I am so grateful I found your site, I really found you
by mistake, while I was looking on Aol for something else, Anyways I am here now and would just like to say
thank you for a incredible post and a all round exciting blog (I
also love the theme/design), I don't have time to go through it all at the moment but I have book-marked it
and also included your RSS feeds, so when I have time I will be back to read
much more, Please do keep up the superb
job.

Quote

0 #7 Weldon 2016-12-03 16:05

Appreciate it for this wonderful post, I am glad I found this web site on yahoo.

Quote

Refresh comments list
RSS feed for comments to this post

Add comment

JComments