goto hell;

Race Conditions Can Be Useful for Parallelism

Everything you want to know about the CAP theorem

Issue #273



Hope you're having a good morning/day/afternoon/evening/whatever. I actually have another product question! A reader wrote in and brought up something that was a step beyond one of the ideas I had in my idea list document and I wanted to put out some feelers to see what you think. Would you be interested in a browser extension that lets your train your own curating machine learning model? Basically on a page you visit in your browser, you can choose to use the extension to rate the article as good or bad. Once you've trained it up, it'll tell you what pages are worth reading and which aren't. Training period would be free, then a monthly sub ($10 / month) to use the model to curate. What do you think?
Anyway here are some links I came across and the issue!
Here's an interesting article on how people are impersonating software devs for interviews.
Here are some tips for good API design.
This articles elaborates on who controls the internet.


goto hell;

Published: 5 September 2022
Tags: c

Christopher Bazley argues that the use of goto statements in C programming is not as effective as other methods of error handling, despite being a widely used practice. Christopher cites several examples of why this is the case and argues that programmers should be more open to other methods of error handling.
Some highlights:

  • goto should only really be used to abandon processing in some deeply nested structure, such as breaking out of two or more loops at once
  • Deferred error handling > Error handling by early exit from a function


Race Conditions Can Be Useful for Parallelism

Published: 27 September 2022
Tags: algorithms

Sam Westrick discusses how race conditions can be used to improve performance in some situations, with the example of priority updates in a parallel breadth-first search.
Some highlights:

  • A small amount of non-determinism can help eliminate a performance bottleneck
  • Racy code is more difficult to debug and prove correct


Everything you want to know about the CAP theorem

Published: 27 September 2022
Tags: distributed systems

"CAP in CAP theorem (or Brewer's theorem) stands for Consistency, Availability and Partition tolerance.". Vaibhav Rabber describes the theorem and applies to examples.
Some highlights:

  • Designing distributed systems, like most engineering, requires considering tradeoffs between, mostly between availability and consistency

How did I do?

5 4 3 2 1


Want to help?

Thank you for reading! If you enjoy the newsletter, I would really appreciate you helping me spread the word by forwarding this to your friends and colleagues or sharing it on social media! Get cool stuff for your referrals using your link

Your referrals:

If you want to discuss or comment on this issue, head on over to this page at A Byte of Coding. You can also subscribe there if you're new!

Have comments or feedback? Just reply to this email or hit me up on Twitter @AByteOfCoding.

Email landed in your promotions tab? Please move it over to primary so you don't miss the latest issues in the future.
Thanks for your Support! 

Big thanks to all of the Patreon supports and company sponsors. If you want to support the newsletter you can checkout the Patreon page. It's not necessary, but it lets me know that I'm doing a good job and that you're finding value in the content.

Stats (updated daily)

Sent: 2972

Opens: 1413

Clicks: 506

Link Clicks Clicks % Unique Clicks Unique Clicks %
goto hell; Awaiting Update Awaiting Update Awaiting Update Awaiting Update
Race Conditions Can Be Useful for Parallelism 97 43.30% 107 45.53
Everything you want to know about the CAP theorem 127 56.70% 128 54.47


Back to Issues