Reader-level: Intermediate — this article assumes you have some basic familiarity with Go and its concurrency model and are at least a little familiar with data synchronization in the form of locking and channel communication. : A dear friend of mine has inspired this post. As I’ve helped him troubleshoot some data races and have tried my best to give him some decent advice around the art of data synchronization I realized that this advice could benefit others. Should you find yourself inheriting a code-base where certain design decisions have already been made or if you just want to understand Go’s more traditional synchronization primitives than this article might be fore you. Reader Note When I first started working with the Go programming language I immediately bought into Go’s slogan of “ ” For me, this meant writing all concurrent-based code the “proper” way, by always-always using channels. My thought being that if you leverage channels, you are sure to avoid the pitfalls of contention, locking, deadlocks, etc. Don’t communicate by sharing memory; share memory by communicating. As I progressed with Go, learning to write idiomatic Go and learning about best-practices; I would stumble upon fairly large code-bases, where quite often you would find people using Go’s primitive, as well as a few other “lower-level” and perhaps “old-school” synchronization primitives. My first thought was, well they’re doing it wrong and they clearly haven’t watched any of Rob Pike’s talks regarding the merits of channel-based concurrency where he often references the design influence from by Tony Hoare. sync/mutex sync/atomic Communicating Sequential Processes The reality was harsh. The Go community recites the slogan above over and over but . I struggled with this conundrum for awhile but ultimately saw the light as it was time to get my hands dirty and push channels aside for a change. Now let’s fast-forward to 2015 where I’ve now been writing Go for around 2.5 years, and since have had a an epiphany or two in regards to the more traditional based synchronization approaches such as mutex-based locking. Go ahead, ask me again now in 2015? Hey @deckarep, do you still only write concurrent applications using channels only? Today I answer no, and here’s why. peeking into many open source projects, mutexes are abound and plenty First, let’s not forget the importance of being pragmatic. When it comes to protecting shared state with either traditional locking or channel based synchronization; let’s start with the following question: “So which approach should you use”? And it turns out there is a : nice little write up that summarizes the answer nicely Use whichever is most expressive and/or most simple. A common Go newbie mistake is to over-use channels and goroutines just because it’s possible, and/or because it’s fun. Don’t be afraid to use a if that fits your problem best. Go is pragmatic in letting you use the tools that solve your problem best and not forcing you into one style of code. sync.Mutex Please note the keywords in that example: I can admit a few things here: I was afraid when I first picked up Go. I was a newcomer to the language, and I needed to spend time with the language before drawing conclusions so quickly. You will draw your own conclusions as well in reference to the article above, and as we dig into some best practices using mutex-based locking and what to watch out for. The article referenced above additionally has some nice guidelines around mutex vs channels. expressive, simple, over-use, afraid, pragmatic. When to use Channels: passing ownership of data, distributing units of work and communicating async results When to use Mutexes: caches, state Ultimately every application is different and it may take some experimentation and false starts. For me, I follow the guidelines above but let me elaborate on them. When you need to protect access to a rather simple data structure such as a slice, or a map, or even something custom built, and if the interface to the said data structure is straightforward, start with a mutex. Additionally, it always helps to encapsulate the dirty details of the locking within your API. End-users of your data structure need not concern themselves with how your structure does its internal synchronization. If your mutex-based synchronization starts becoming unwieldy and , it’s time to move to a different strategy. Again, recognize that mutexes are useful and straightforward for to protect minimally shared state. Use them for what they are . Take back control of your application’s logic, and if you are fighting with mutexes then please consider re-thinking your design. Perhaps moving to channels would better suit your application logic, or even better, . you are playing the mutex dance simple scenarios but respect them and don’t let them get out of control don’t share state period Threading isn’t hard — locking is hard. Understand I am not advocating to use mutexes over channels. I am simply saying become familiar with both methods of synchronization, and should you find that your channel-based solution seems to be overly complicated, well you have another option. The topics in this article are here to help you write better, more maintainable and robust code. We as engineers . Go makes it incredibly easy to produce high performing concurrent and/or parallel applications but the pitfalls are there, and care must be taken to build a correct application. Let’s get into the details then: have to be conscientious of how we deal with shared state and avoid data-races in multi-threaded applications : When declaring a struct where the mutex must protect access to one or more fields, place the mutex above the fields that it will protect as a best practice. . Keep in mind this is purely convention and does not affect your application’s logic. Item 1 Here is an example of this idiom within Go’s own source code var sum struct {sync.Mutex // <-- this mutex protectsi int // <-- this integer underneath} : Hold a mutex lock only for as long as necessary. Example: If you can avoid it, don’t hold a mutex during an IO-based call. Instead, ensure to only protect your resource for only as long as needed. If you did something like this in a web handler for example, you effectively negate the effects of concurrency by serializing access to the handler. Item 2 // In the code below assume that `mu` solely exists// to protect access to the cache variable// NOTE: Excuse error-handling for brevity // Don't do the following if you can avoid itfunc doSomething(){mu.Lock()item := cache["myKey"]http.Get() // Some expensive io callmu.Unlock()} // Instead do the following where possiblefunc doSomething(){mu.Lock()item := cache["myKey"]mu.Unlock()http.Get() // This can take awhile and it's okay!} : Utilize defer to Unlock your mutex where a given function has multiple locations that it can return. This means less book-keeping for you and can mitigate deadlocks when someone comes long 3 months from now and adds a new case for returning early. Item 3 func doSomething(){mu.Lock()defer mu.Unlock() err := ... if err != nil{ //log error return // <-- your unlock will happen here } err = ... if err != nil{ //log error return // <-- or here here } return // <-- and of course here } However beware of just willy-nilly relying on defers in every case. The following code is a trap that can happen when you think that defers are are cleaned up in block scope rather than function scope. func doSomething(){for {mu.Lock()defer mu.Unlock() // some interesting code // <-- the defer is not executed here as one \*may\* think } // <-- it is executed here when the function exits} // Therefore the above code will Deadlock! Lastly, consider not using the defer statement at all when you have extremely simple functions that don’t have multiple return paths to squeeze out a little performance. Deferred statements do have a slight overhead cost that is very often negligible. . Regard this as a very premature and mostly unnecessary optimization : Fine-grained locking can lead to better performance at the cost of more complicated bookkeeping while course-grained locking may be less performant, yet yield much simpler bookkeeping. Again, be pragmatic in your design. If you find yourself playing the “mutex dance” it may be time to either refactor your code or move to channel based synchronization. Item 4 As mentioned earlier in this post, it’s always nice if you can hide or encapsulate the method of synchronization used. Users of your package need not concern themselves with the intricacies of how your shared state is protected. Item 5: In the example below let us consider the case where we provide a get() method call, that will only pull from the cache if there is at least one or more items in the cache. Well, since we need to take a lock to get the item out of the cache and get the caches count as well — . this code will deadlock package main import (“fmt”“sync”) type DataStore struct {sync.Mutex // ← this mutex protects the cache belowcache map[string]string} func New() *DataStore{return &DataStore{cache: make(map[string]string),}} func (ds *DataStore) set(key string, value string) {ds.Lock()defer ds.Unlock() ds.cache[key] = value} func (ds *DataStore) get(key string) string {ds.Lock()defer ds.Unlock() if ds.count() > 0 { <-- count() also takes a lock!item := ds.cache[key]return item}return “”} func (ds *DataStore) count() int {ds.Lock()defer ds.Unlock()return len(ds.cache)} func main() {/* Running this below will deadlock because the get() method will take a lock and will call the count() method which will also take a lock before the set() method unlocks()*/ store := New()store.set(“Go”, “Lang”)result := store.get(“Go”)fmt.Println(result)} A suggested pattern for dealing with the fact that is as follows: Go’s locks are not re-entrant package main import (“fmt”“sync”) type DataStore struct {sync.Mutex // ← this mutex protects the cache belowcache map[string]string} func New() *DataStore {return &DataStore{cache: make(map[string]string),}} func (ds *DataStore) set(key string, value string) {ds.cache[key] = value} func (ds *DataStore) get(key string) string {if ds.count() > 0 {item := ds.cache[key]return item}return “”} func (ds *DataStore) count() int {return len(ds.cache)} func (ds *DataStore) Set(key string, value string) {ds.Lock()defer ds.Unlock() ds.set(key, value)} func (ds *DataStore) Get(key string) string {ds.Lock()defer ds.Unlock() return ds.get(key)} func (ds *DataStore) Count() int {ds.Lock()defer ds.Unlock()return ds.count()} func main() {store := New()store.Set(“Go”, “Lang”)result := store.Get(“Go”)fmt.Println(result)} Notice in the above code that there is a matching exported method for each non-exported method. The exported methods that operate at the public API level will take care of locking and unlocking. They then forward to their respective non-exported methods which do not take any locks at all. This means that all exported invocations of your code will only take a lock once to avoid the re-entrant issue. In all the examples above we utilized the basic lock which can simply: Lock() and Unlock() only. The sync.Mutex lock provides the same mutual exclusion guarantee, no matter if the goroutine is reading or writing data. There exists as well the which offers a little more control with the semantics of the locking during read scenarios. When would you want to use the RWMutex over the standard Mutex? Item 6: sync.Mutex sync.RWMutex Answer: Use the RWMutex when you can absolutely guarantee that your code within your critical section does not mutate shared state. // I can safely use a RLock() for count, it does not mutatefunc count(){rw.RLock() // <-- notice the R in RLock (read-lock)defer rw.RUnlock() <-- notice the R in RUnlock() return len(sharedState)} // I must use Lock() for set, it mutates the sharedStatefunc set(key string, value string){rw.Lock() // <-- notice we take a 'regular' Lock (write-lock)defer rw.Unlock() // <-- notice we Unlock() has no R in it sharedState[key] = value // <-- mutates the sharedState} In the above code, we can assume that the `sharedState` variable is some type of object — it could be a map perhaps where we can query it’s length. Since the function`count()` above respects the rule that no mutation is happening on the `sharedState` variable, this means it is safe for an arbitrary number of readers (goroutines) to call this method concurrently. In certain scenarios this could reduce the number of goroutines in a blocking state, and potentially warrant a performance gain in a read-heavy scenario. But remember, when you have code that mutates shared state as in the `set()` you must not use a rw.RLock() command but rather the rw.Lock() command. Get to know . The race-detector has found scores of data races even within Go’s standard library. This is why the race detector is there and why there are quite a few talks and articles that will explain this tool better than I can. Item 7: Go’s Bad-Ass and built-in Race Detector If you aren’t yet running unit/integration tests under the race detector as part of your continuous build/delivery system, set it up now. If you don’t have good tests that exercise the concurrency of your application, the race detector won’t do you any good. Don’t run it in production unless you really need to, it will cost you a performance penalty If the race detector found a data race, it’s a real data race. Race conditions can still show up channel-based synchronization if you aren’t careful. All the locking in the world won’t save you if a goroutine somehow reads or writes shared data that is not within a critical section. If the Go team can write data races unknowingly so can you. In summary I hope this article offers some solid advice around dealing with Go’s mutexes. Please play with Go’s lower-level synchronization primitives, make your mistakes, respect and understand the tools. Above all, be pragmatic in your development and use the right tool for the job. Don’t be scared like I was originally. If I always listened to every negative thing said about multi-threaded programming and locking I wouldn’t be in this business today writing kick-ass distributed systems while getting to use a kick-ass language like Go. Note: I love feedback, if you found this useful please ping me, tweet it or give me constructive feedback. Cheers and Happy Coding! @deckarep
