I am trying to understand the chan chan
construct in Go by writing a small piece of code, as shown below, I You want 3 worker subroutines to handle 10 jobs. Each worker subroutine has its own channel where it receives "jobs" to be processed. The main Go routine distributes jobs to worker channels by getting channels from the channel pool (hence the chan chan
construct).
But this code will cause a deadlock situation! I tried some variations of this code but got the same error.
Is it because the worker subroutine waits forever to read the job from its channel? Or is it due to other reasons (maybe the channel is closed prematurely, etc.)? I'm obviously missing something in my understanding of the whole structure.
Can someone help me understand this problem and how to solve it?
Code from the playground and copied below as requested.
package main import ( "fmt" "sync" ) type Job struct { ID int } func worker(id int, jobs <-chan Job, wg *sync.WaitGroup) { defer wg.Done() fmt.Printf("Worker %d starting\n", id) for job := range jobs { fmt.Printf("Worker %d processing job %d\n", id, job.ID) } fmt.Printf("Worker %d done\n", id) } func main() { numWorkers := 3 maxJobs := 10 var wg sync.WaitGroup // Create the pool of worker channels pool := make(chan chan Job, numWorkers) for i := 0; i < numWorkers; i++ { workerChan := make(chan Job) // Create a new channel for each worker pool <- workerChan // Add the worker channel to the pool go worker(i, workerChan, &wg) } defer close(pool) // Create jobs and distribute them to workers for i := 0; i < maxJobs; i++ { job := Job{ID: i} wg.Add(1) workerChan := <-pool workerChan <- job } // Wait for all workers to complete wg.Wait() fmt.Println("All jobs are processed") }
Correct answer
First of all: there is no need for a channel of channels here. To distribute work to multiple workers, you simply have all workers read from a single shared channel. When you send a piece of work to a channel, if there are workers available, one of them will receive it, otherwise the channel send operation will block until there is a worker available.
If you want to use separate channels for each worker, you still don't need a channel of channels, you just need a subset of them. Each worker will listen from a dedicated channel and you will manage your own work assignments:
numWorkers := 3 maxJobs := 10 var wg sync.WaitGroup pool := make([]chan Job, numWorkers) for i := 0; i < numWorkers; i++ { pool[i] = make(chan Job) wg.Add(1) go worker(i, pool[i], &wg) } for i := 0; i < maxJobs; i++ { job := Job{ID: i} pool[i%len(pool)] <- job } for _,c:=range pool { close(c) } wg.Wait()
There are two problems with your code:
- You should add to the wait group when creating the Goroutine, not when sending the job to the channel
- When you read a channel from the channel, the channel is removed from the pool. So after you read 3 channels,
workerChannel := will block because there are no other channels. If you insist on using the channel's channel, you have to put it back:
workerChan := <-pool workerChan <- job pool<-workerChan
This way you can use the channel's channel as a circular queue
- Close
pool
will have no effect. You must close the channel inpool
.
The above is the detailed content of chan chan construct causes deadlock. For more information, please follow other related articles on the PHP Chinese website!

Mastering the strings package in Go language can improve text processing capabilities and development efficiency. 1) Use the Contains function to check substrings, 2) Use the Index function to find the substring position, 3) Join function efficiently splice string slices, 4) Replace function to replace substrings. Be careful to avoid common errors, such as not checking for empty strings and large string operation performance issues.

You should care about the strings package in Go because it simplifies string manipulation and makes the code clearer and more efficient. 1) Use strings.Join to efficiently splice strings; 2) Use strings.Fields to divide strings by blank characters; 3) Find substring positions through strings.Index and strings.LastIndex; 4) Use strings.ReplaceAll to replace strings; 5) Use strings.Builder to efficiently splice strings; 6) Always verify input to avoid unexpected results.

ThestringspackageinGoisessentialforefficientstringmanipulation.1)Itofferssimpleyetpowerfulfunctionsfortaskslikecheckingsubstringsandjoiningstrings.2)IthandlesUnicodewell,withfunctionslikestrings.Fieldsforwhitespace-separatedvalues.3)Forperformance,st

WhendecidingbetweenGo'sbytespackageandstringspackage,usebytes.Bufferforbinarydataandstrings.Builderforstringoperations.1)Usebytes.Bufferforworkingwithbyteslices,binarydata,appendingdifferentdatatypes,andwritingtoio.Writer.2)Usestrings.Builderforstrin

Go's strings package provides a variety of string manipulation functions. 1) Use strings.Contains to check substrings. 2) Use strings.Split to split the string into substring slices. 3) Merge strings through strings.Join. 4) Use strings.TrimSpace or strings.Trim to remove blanks or specified characters at the beginning and end of a string. 5) Replace all specified substrings with strings.ReplaceAll. 6) Use strings.HasPrefix or strings.HasSuffix to check the prefix or suffix of the string.

Using the Go language strings package can improve code quality. 1) Use strings.Join() to elegantly connect string arrays to avoid performance overhead. 2) Combine strings.Split() and strings.Contains() to process text and pay attention to case sensitivity issues. 3) Avoid abuse of strings.Replace() and consider using regular expressions for a large number of substitutions. 4) Use strings.Builder to improve the performance of frequently splicing strings.

Go's bytes package provides a variety of practical functions to handle byte slicing. 1.bytes.Contains is used to check whether the byte slice contains a specific sequence. 2.bytes.Split is used to split byte slices into smallerpieces. 3.bytes.Join is used to concatenate multiple byte slices into one. 4.bytes.TrimSpace is used to remove the front and back blanks of byte slices. 5.bytes.Equal is used to compare whether two byte slices are equal. 6.bytes.Index is used to find the starting index of sub-slices in largerslices.

Theencoding/binarypackageinGoisessentialbecauseitprovidesastandardizedwaytoreadandwritebinarydata,ensuringcross-platformcompatibilityandhandlingdifferentendianness.ItoffersfunctionslikeRead,Write,ReadUvarint,andWriteUvarintforprecisecontroloverbinary


Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

SublimeText3 Linux new version
SublimeText3 Linux latest version

SecLists
SecLists is the ultimate security tester's companion. It is a collection of various types of lists that are frequently used during security assessments, all in one place. SecLists helps make security testing more efficient and productive by conveniently providing all the lists a security tester might need. List types include usernames, passwords, URLs, fuzzing payloads, sensitive data patterns, web shells, and more. The tester can simply pull this repository onto a new test machine and he will have access to every type of list he needs.

ZendStudio 13.5.1 Mac
Powerful PHP integrated development environment

DVWA
Damn Vulnerable Web App (DVWA) is a PHP/MySQL web application that is very vulnerable. Its main goals are to be an aid for security professionals to test their skills and tools in a legal environment, to help web developers better understand the process of securing web applications, and to help teachers/students teach/learn in a classroom environment Web application security. The goal of DVWA is to practice some of the most common web vulnerabilities through a simple and straightforward interface, with varying degrees of difficulty. Please note that this software

Notepad++7.3.1
Easy-to-use and free code editor
