2018-06-08 09:50:56 +03:00
|
|
|
|
# ants
|
|
|
|
|
|
|
|
|
|
<div align="center"><img src="ants_logo.png"/></div>
|
|
|
|
|
|
|
|
|
|
<p align="center">A goroutine pool for Go</p>
|
|
|
|
|
|
2018-06-29 05:57:03 +03:00
|
|
|
|
[![Build Status][1]][2]
|
2018-07-16 07:25:25 +03:00
|
|
|
|
[![codecov][3]][4]
|
2018-06-29 05:57:03 +03:00
|
|
|
|
[![goreportcard for panjf2000/ants][5]][6]
|
2018-07-16 07:25:25 +03:00
|
|
|
|
[![godoc for panjf2000/ants][7]][8]
|
|
|
|
|
[![MIT Licence][9]][10]
|
2018-06-08 09:50:56 +03:00
|
|
|
|
|
2018-07-23 17:19:03 +03:00
|
|
|
|
[英文说明页](README.md) | [项目介绍文章传送门](http://blog.taohuawu.club/article/goroutine-pool)
|
2018-06-08 09:50:56 +03:00
|
|
|
|
|
|
|
|
|
`ants`是一个高性能的协程池,实现了对大规模goroutine的调度管理、goroutine复用,允许使用者在开发并发程序的时候限制协程数量,复用资源,达到更高效执行任务的效果。
|
|
|
|
|
|
|
|
|
|
## 功能:
|
|
|
|
|
|
|
|
|
|
- 实现了自动调度并发的goroutine,复用goroutine
|
2018-07-09 11:36:42 +03:00
|
|
|
|
- 定时清理过期的goroutine,进一步节省资源
|
2018-06-08 09:50:56 +03:00
|
|
|
|
- 提供了友好的接口:任务提交、获取运行中的协程数量、动态调整协程池大小
|
|
|
|
|
- 资源复用,极大节省内存使用量;在大规模批量并发任务场景下比原生goroutine并发具有更高的性能
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## 安装
|
|
|
|
|
|
|
|
|
|
``` sh
|
|
|
|
|
go get -u github.com/panjf2000/ants
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
使用包管理工具 glide 安装:
|
|
|
|
|
|
|
|
|
|
``` sh
|
|
|
|
|
glide get github.com/panjf2000/ants
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
## 使用
|
|
|
|
|
写 go 并发程序的时候如果程序会启动大量的 goroutine ,势必会消耗大量的系统资源(内存,CPU),通过使用 `ants`,可以实例化一个协程池,复用 goroutine ,节省资源,提升性能:
|
|
|
|
|
|
|
|
|
|
``` go
|
|
|
|
|
package main
|
|
|
|
|
|
|
|
|
|
import (
|
|
|
|
|
"fmt"
|
|
|
|
|
"sync"
|
|
|
|
|
"sync/atomic"
|
2018-07-02 09:45:25 +03:00
|
|
|
|
"time"
|
2018-06-08 09:50:56 +03:00
|
|
|
|
|
|
|
|
|
"github.com/panjf2000/ants"
|
|
|
|
|
)
|
|
|
|
|
|
|
|
|
|
var sum int32
|
|
|
|
|
|
2018-12-03 06:23:37 +03:00
|
|
|
|
func myFunc(i interface{}) {
|
2018-07-02 09:45:25 +03:00
|
|
|
|
n := i.(int32)
|
|
|
|
|
atomic.AddInt32(&sum, n)
|
2018-06-08 09:50:56 +03:00
|
|
|
|
fmt.Printf("run with %d\n", n)
|
|
|
|
|
}
|
|
|
|
|
|
2018-12-03 06:23:37 +03:00
|
|
|
|
func demoFunc() {
|
2018-06-08 09:50:56 +03:00
|
|
|
|
time.Sleep(10 * time.Millisecond)
|
|
|
|
|
fmt.Println("Hello World!")
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func main() {
|
2018-07-02 09:45:25 +03:00
|
|
|
|
defer ants.Release()
|
|
|
|
|
|
2018-06-08 09:50:56 +03:00
|
|
|
|
runTimes := 1000
|
|
|
|
|
|
2018-12-05 19:26:28 +03:00
|
|
|
|
// Uses the common pool
|
2018-06-08 09:50:56 +03:00
|
|
|
|
var wg sync.WaitGroup
|
|
|
|
|
for i := 0; i < runTimes; i++ {
|
|
|
|
|
wg.Add(1)
|
2018-12-01 14:41:02 +03:00
|
|
|
|
ants.Submit(func() {
|
2018-06-08 09:50:56 +03:00
|
|
|
|
demoFunc()
|
|
|
|
|
wg.Done()
|
|
|
|
|
})
|
|
|
|
|
}
|
|
|
|
|
wg.Wait()
|
|
|
|
|
fmt.Printf("running goroutines: %d\n", ants.Running())
|
|
|
|
|
fmt.Printf("finish all tasks.\n")
|
|
|
|
|
|
2018-12-05 19:26:28 +03:00
|
|
|
|
// Uses the pool with a function,
|
2018-12-05 19:37:12 +03:00
|
|
|
|
// sets 10 to the size of goroutine pool and 1 second for expired duration
|
2018-12-01 14:41:02 +03:00
|
|
|
|
p, _ := ants.NewPoolWithFunc(10, func(i interface{}) {
|
2018-06-08 09:50:56 +03:00
|
|
|
|
myFunc(i)
|
|
|
|
|
wg.Done()
|
|
|
|
|
})
|
2018-07-02 09:45:25 +03:00
|
|
|
|
defer p.Release()
|
2018-12-05 19:26:28 +03:00
|
|
|
|
// Submits tasks
|
2018-06-08 09:50:56 +03:00
|
|
|
|
for i := 0; i < runTimes; i++ {
|
|
|
|
|
wg.Add(1)
|
2018-07-02 09:45:25 +03:00
|
|
|
|
p.Serve(int32(i))
|
2018-06-08 09:50:56 +03:00
|
|
|
|
}
|
|
|
|
|
wg.Wait()
|
|
|
|
|
fmt.Printf("running goroutines: %d\n", p.Running())
|
|
|
|
|
fmt.Printf("finish all tasks, result is %d\n", sum)
|
|
|
|
|
}
|
2018-12-05 19:50:33 +03:00
|
|
|
|
```
|
2018-12-02 08:48:44 +03:00
|
|
|
|
|
|
|
|
|
## 与http server集成
|
|
|
|
|
```go
|
|
|
|
|
package main
|
|
|
|
|
|
|
|
|
|
import (
|
|
|
|
|
"io/ioutil"
|
|
|
|
|
"net/http"
|
|
|
|
|
|
|
|
|
|
"github.com/panjf2000/ants"
|
|
|
|
|
)
|
|
|
|
|
|
2018-12-02 16:53:43 +03:00
|
|
|
|
type Request struct {
|
|
|
|
|
Param []byte
|
|
|
|
|
Result chan []byte
|
|
|
|
|
}
|
|
|
|
|
|
2018-12-02 08:48:44 +03:00
|
|
|
|
func main() {
|
|
|
|
|
pool, _ := ants.NewPoolWithFunc(100, func(payload interface{}) {
|
2018-12-03 05:13:53 +03:00
|
|
|
|
request, ok := payload.(*Request)
|
2018-12-02 08:48:44 +03:00
|
|
|
|
if !ok {
|
2018-12-03 09:31:49 +03:00
|
|
|
|
return
|
2018-12-02 08:48:44 +03:00
|
|
|
|
}
|
|
|
|
|
reverseParam := func(s []byte) []byte {
|
|
|
|
|
for i, j := 0, len(s)-1; i < j; i, j = i+1, j-1 {
|
|
|
|
|
s[i], s[j] = s[j], s[i]
|
|
|
|
|
}
|
|
|
|
|
return s
|
2018-12-02 16:53:43 +03:00
|
|
|
|
}(request.Param)
|
2018-12-02 08:48:44 +03:00
|
|
|
|
|
2018-12-02 16:53:43 +03:00
|
|
|
|
request.Result <- reverseParam
|
2018-12-02 08:48:44 +03:00
|
|
|
|
})
|
|
|
|
|
defer pool.Release()
|
|
|
|
|
|
|
|
|
|
http.HandleFunc("/reverse", func(w http.ResponseWriter, r *http.Request) {
|
2018-12-02 16:53:43 +03:00
|
|
|
|
param, err := ioutil.ReadAll(r.Body)
|
2018-12-02 08:48:44 +03:00
|
|
|
|
if err != nil {
|
|
|
|
|
http.Error(w, "request error", http.StatusInternalServerError)
|
|
|
|
|
}
|
|
|
|
|
defer r.Body.Close()
|
|
|
|
|
|
2018-12-03 05:13:53 +03:00
|
|
|
|
request := &Request{Param: param, Result: make(chan []byte)}
|
2018-12-02 16:53:43 +03:00
|
|
|
|
|
2018-12-05 19:26:28 +03:00
|
|
|
|
// Throttles the requests with ants pool. This process is asynchronous and
|
2018-12-02 08:48:44 +03:00
|
|
|
|
// you can receive a result from the channel defined outside.
|
2018-12-02 16:53:43 +03:00
|
|
|
|
if err := pool.Serve(request); err != nil {
|
2018-12-02 08:48:44 +03:00
|
|
|
|
http.Error(w, "throttle limit error", http.StatusInternalServerError)
|
|
|
|
|
}
|
|
|
|
|
|
2018-12-02 16:53:43 +03:00
|
|
|
|
w.Write(<-request.Result)
|
2018-12-02 08:48:44 +03:00
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
http.ListenAndServe(":8080", nil)
|
|
|
|
|
}
|
2018-06-08 09:50:56 +03:00
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
## 任务提交
|
|
|
|
|
提交任务通过调用 `ants.Submit(func())`方法:
|
|
|
|
|
```go
|
2018-12-02 08:48:44 +03:00
|
|
|
|
ants.Submit(func(){})
|
2018-06-08 09:50:56 +03:00
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
## 自定义池
|
|
|
|
|
`ants`支持实例化使用者自己的一个 Pool ,指定具体的池容量;通过调用 `NewPool` 方法可以实例化一个新的带有指定容量的 Pool ,如下:
|
|
|
|
|
|
|
|
|
|
``` go
|
2018-12-05 19:26:28 +03:00
|
|
|
|
// Sets 10000 the size of goroutine pool
|
2018-07-24 16:53:34 +03:00
|
|
|
|
p, _ := ants.NewPool(10000)
|
2018-12-05 19:26:28 +03:00
|
|
|
|
// Submits a task
|
2018-12-02 08:48:44 +03:00
|
|
|
|
p.Submit(func(){})
|
2018-06-08 09:50:56 +03:00
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
## 动态调整协程池容量
|
|
|
|
|
需要动态调整协程池容量可以通过调用`ReSize(int)`:
|
|
|
|
|
|
|
|
|
|
``` go
|
2018-12-05 19:26:28 +03:00
|
|
|
|
pool.ReSize(1000) // Tuning its capacity to 1000
|
|
|
|
|
pool.ReSize(100000) // Tuning its capacity to 100000
|
2018-06-08 09:50:56 +03:00
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
该方法是线程安全的。
|
|
|
|
|
|
|
|
|
|
## Benchmarks
|
|
|
|
|
|
|
|
|
|
系统参数:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
OS : macOS High Sierra
|
|
|
|
|
Processor : 2.7 GHz Intel Core i5
|
|
|
|
|
Memory : 8 GB 1867 MHz DDR3
|
2018-07-06 15:39:23 +03:00
|
|
|
|
|
|
|
|
|
Go1.9
|
2018-06-08 09:50:56 +03:00
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
<div align="center"><img src="ants_benchmarks.png"/></div>
|
|
|
|
|
|
|
|
|
|
上图中的前两个 benchmark 测试结果是基于100w任务量的条件,剩下的几个是基于1000w任务量的测试结果,`ants`的默认池容量是5w。
|
|
|
|
|
|
|
|
|
|
- BenchmarkGoroutine-4 代表原生goroutine
|
|
|
|
|
|
|
|
|
|
- BenchmarkPoolGroutine-4 代表使用协程池`ants`
|
|
|
|
|
|
|
|
|
|
### Benchmarks with Pool
|
|
|
|
|
|
|
|
|
|
![](benchmark_pool.png)
|
|
|
|
|
|
2018-06-28 17:27:53 +03:00
|
|
|
|
**这里为了模拟大规模goroutine的场景,两次测试的并发次数分别是100w和1000w,前两个测试分别是执行100w个并发任务不使用Pool和使用了`ants`的Goroutine Pool的性能,后两个则是1000w个任务下的表现,可以直观的看出在执行速度和内存使用上,`ants`的Pool都占有明显的优势。100w的任务量,使用`ants`,执行速度与原生goroutine相当甚至略快,但只实际使用了不到5w个goroutine完成了全部任务,且内存消耗仅为原生并发的40%;而当任务量达到1000w,优势则更加明显了:用了70w左右的goroutine完成全部任务,执行速度比原生goroutine提高了100%,且内存消耗依旧保持在不使用Pool的40%左右。**
|
2018-06-08 09:50:56 +03:00
|
|
|
|
|
|
|
|
|
### Benchmarks with PoolWithFunc
|
|
|
|
|
|
|
|
|
|
![](ants_bench_poolwithfunc.png)
|
|
|
|
|
|
2018-06-28 17:27:53 +03:00
|
|
|
|
**因为`PoolWithFunc`这个Pool只绑定一个任务函数,也即所有任务都是运行同一个函数,所以相较于`Pool`对原生goroutine在执行速度和内存消耗的优势更大,上面的结果可以看出,执行速度可以达到原生goroutine的300%,而内存消耗的优势已经达到了两位数的差距,原生goroutine的内存消耗达到了`ants`的35倍且原生goroutine的每次执行的内存分配次数也达到了`ants`45倍,1000w的任务量,`ants`的初始分配容量是5w,因此它完成了所有的任务依旧只使用了5w个goroutine!事实上,`ants`的Goroutine Pool的容量是可以自定义的,也就是说使用者可以根据不同场景对这个参数进行调优直至达到最高性能。**
|
2018-06-28 05:52:20 +03:00
|
|
|
|
|
2018-12-05 19:26:28 +03:00
|
|
|
|
### 吞吐量测试(适用于那种只管提交异步任务而无须关心结果的场景)
|
2018-06-08 09:50:56 +03:00
|
|
|
|
|
|
|
|
|
#### 10w 任务量
|
|
|
|
|
|
|
|
|
|
![](ants_bench_10w.png)
|
|
|
|
|
|
|
|
|
|
#### 100w 任务量
|
|
|
|
|
|
|
|
|
|
![](ants_bench_100w.png)
|
|
|
|
|
|
|
|
|
|
#### 1000w 任务量
|
|
|
|
|
|
|
|
|
|
![](ants_bench_1000w.png)
|
|
|
|
|
|
|
|
|
|
1000w任务量的场景下,我的电脑已经无法支撑 golang 的原生 goroutine 并发,所以只测出了使用`ants`池的测试结果。
|
|
|
|
|
|
2018-12-05 19:50:33 +03:00
|
|
|
|
**从该demo测试吞吐性能对比可以看出,使用`ants`的吞吐性能相较于原生goroutine可以保持在2-6倍的性能压制,而内存消耗则可以达到10-20倍的节省优势。**
|
2018-06-28 05:52:20 +03:00
|
|
|
|
|
2018-12-01 13:43:46 +03:00
|
|
|
|
[1]: https://travis-ci.com/panjf2000/ants.svg?branch=master
|
2018-06-29 05:57:03 +03:00
|
|
|
|
[2]: https://travis-ci.com/panjf2000/ants
|
2018-12-01 13:43:46 +03:00
|
|
|
|
[3]: https://codecov.io/gh/panjf2000/ants/branch/master/graph/badge.svg
|
2018-07-16 07:25:25 +03:00
|
|
|
|
[4]: https://codecov.io/gh/panjf2000/ants
|
2018-06-29 05:57:03 +03:00
|
|
|
|
[5]: https://goreportcard.com/badge/github.com/panjf2000/ants
|
|
|
|
|
[6]: https://goreportcard.com/report/github.com/panjf2000/ants
|
2018-07-16 07:25:25 +03:00
|
|
|
|
[7]: https://godoc.org/github.com/panjf2000/ants?status.svg
|
|
|
|
|
[8]: https://godoc.org/github.com/panjf2000/ants
|
|
|
|
|
[9]: https://badges.frapsoft.com/os/mit/mit.svg?v=103
|
|
|
|
|
[10]: https://opensource.org/licenses/mit-license.php
|