Atomic operations are a way to safely modify variables shared between multiple goroutines in Go. The `sync/atomic` package provides low-level atomic operations for synchronizing access to variables without using explicit locks.
Using atomic operations can greatly improve performance by avoiding the overhead associated with locks. This is particularly useful in scenarios requiring high concurrency.
package main
import (
"fmt"
"sync"
"sync/atomic"
)
func main() {
var counter int64 // The shared counter
var wg sync.WaitGroup
numGoroutines := 100
for i := 0; i < numGoroutines; i++ {
wg.Add(1)
go func() {
// Increment the counter atomically
atomic.AddInt64(&counter, 1)
wg.Done()
}()
}
wg.Wait() // Wait for all goroutines to finish
fmt.Println("Final counter:", counter) // Should print 100
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?