Golang의 동기화 메커니즘을 사용하여 높은 동시성 시나리오에서 성능을 최적화합니다.

import (
    "sync"
)

var mu sync.Mutex
var count int

func main() {
    wg := sync.WaitGroup{}
    for i := 0; i < 1000; i++ {
        wg.Add(1)
        go func() {
            mu.Lock()
            count++
            mu.Unlock()
            wg.Done()
        }()
    }
    wg.Wait()
    fmt.Println(count)
}

import (
    "sync"
)

var rwmu sync.RWMutex
var count int

func main() {
    wg := sync.WaitGroup{}
    for i := 0; i < 1000; i++ {
        wg.Add(1)
        go func() {
            rwmu.Lock()
            count++
            rwmu.Unlock()
            wg.Done()
        }()
    }
    wg.Wait()
    fmt.Println(count)
}

import (
    "sync"
    "time"
)

var mu sync.Mutex
var cond = sync.NewCond(&mu)
var ready bool

func main() {
    wg := sync.WaitGroup{}
    for i := 0; i < 100; i++ {
        wg.Add(1)
        go func() {
            mu.Lock()
            for !ready {
                cond.Wait()
            }
            fmt.Println("goroutine wakes up")
            mu.Unlock()
            wg.Done()
        }()
    }
    time.Sleep(time.Second)
    mu.Lock()
    ready = true
    cond.Broadcast()
    mu.Unlock()
    wg.Wait()
}

import (
    "sync"
)

var mu sync.Mutex
var counter int

func worker(pool chan bool) {
    for {
        select {
        case <-pool:
            mu.Lock()
            counter++
            mu.Unlock()
        }
    }
}

func main() {
    pool := make(chan bool, 10)
    for i := 0; i < 10; i++ {
        go worker(pool)
    }

    // 向协程池中分发任务
    for i := 0; i < 1000; i++ {
        pool <- true
    }

    // 等待所有任务完成
    for i := 0; i < 10; i++ {
        pool <- false
    }

    fmt.Println(counter)
}