🐜🐜🐜 ants is a high-performance and low-cost goroutine pool in Go, inspired by fasthttp./ ants 是一个高性能且低损耗的 goroutine 池。
Go to file
andy pan cca93c8dfc release the pool in testing 2018-07-02 14:35:02 +08:00
examples update example code 2018-07-02 14:16:39 +08:00
.travis.yml add travis test 2018-06-29 10:25:18 +08:00
LICENSE Initial commit 2018-05-19 09:13:39 +08:00
README.md update travis-ci branch to develop 2018-07-02 14:22:33 +08:00
README_ZH.md add travis-ci badge 2018-06-29 10:59:02 +08:00
ants.go Auto stash before merge of "develop" and "origin/develop" 2018-05-24 23:43:34 +08:00
ants_bench_10w.png update readme 2018-05-27 22:48:44 +08:00
ants_bench_100w.png update readme 2018-05-27 22:48:44 +08:00
ants_bench_1000w.png update readme 2018-05-27 22:48:44 +08:00
ants_bench_poolwithfunc.png update readme 2018-05-27 22:48:44 +08:00
ants_benchmark_test.go release the pool in testing 2018-07-02 14:35:02 +08:00
ants_benchmarks.png update the readme 2018-05-20 23:27:20 +08:00
ants_logo.png init proj 2018-05-19 09:15:54 +08:00
ants_test.go release the pool in testing 2018-07-02 14:35:02 +08:00
benchmark_pool.png update readme 2018-05-27 22:48:44 +08:00
pool.go optimization for releasing pool 2018-06-22 11:42:05 +08:00
pool_func.go optimization for releasing pool 2018-06-22 11:42:05 +08:00
worker.go finish the ReSize() and Release() methods 2018-05-30 12:57:20 +08:00
worker_func.go finish the ReSize() and Release() methods 2018-05-30 12:57:20 +08:00

README.md

ants

A goroutine pool for Go

Build Status godoc for panjf2000/ants goreportcard for panjf2000/ants MIT Licence

中文项目说明 | Project Tutorial

Package ants implements a fixed goroutine pool for managing and recycling a massive number of goroutines, allowing developers to limit the number of goroutines that created by your concurrent programs.

Features:

  • Automatically managing and recycling a massive number of goroutines.
  • Friendly interfaces: submitting tasks, getting the number of running goroutines, readjusting capacity of pool dynamically, closing pool.
  • Efficient in memory usage and it even achieves higher performance than unlimited goroutines in golang.

How to install

go get -u github.com/panjf2000/ants

Or, using glide:

glide get github.com/panjf2000/ants

How to use

If your program will generate a massive number of goroutines and you don't want them to consume a vast amount of memory, with ants, all you need to do is to import ants package and submit all your tasks to the default limited pool created when ants was imported:


package main

import (
	"fmt"
	"sync"
	"sync/atomic"

	"github.com/panjf2000/ants"
	"time"
)

var sum int32

func myFunc(i interface{}) error {
	n := i.(int)
	atomic.AddInt32(&sum, int32(n))
	fmt.Printf("run with %d\n", n)
	return nil
}

func demoFunc() error {
	time.Sleep(10 * time.Millisecond)
	fmt.Println("Hello World!")
	return nil
}

func main() {
	runTimes := 1000

	// use the common pool
	var wg sync.WaitGroup
	for i := 0; i < runTimes; i++ {
		wg.Add(1)
		ants.Submit(func() error {
			demoFunc()
			wg.Done()
			return nil
		})
	}
	wg.Wait()
	fmt.Printf("running goroutines: %d\n", ants.Running())
	fmt.Printf("finish all tasks.\n")

	// use the pool with a function
	// set 10 the size of goroutine pool
	p, _ := ants.NewPoolWithFunc(10, func(i interface{}) error {
		myFunc(i)
		wg.Done()
		return nil
	})
	// submit tasks
	for i := 0; i < runTimes; i++ {
		wg.Add(1)
		p.Serve(i)
	}
	wg.Wait()
	fmt.Printf("running goroutines: %d\n", p.Running())
	fmt.Printf("finish all tasks, result is %d\n", sum)
}

Submit tasks

Tasks can be submitted by calling ants.Submit(func())

ants.Submit(func() {})

Custom limited pool

Ants also supports custom limited pool. You can use the NewPool method to create a pool with the given capacity, as following:

// set 10000 the size of goroutine pool
p, _ := ants.NewPool(10000)
// submit a task
p.Submit(func() {})

Readjusting pool capacity

You can change ants pool capacity at any time with ReSize(int):

pool.ReSize(1000) // Readjust its capacity to 1000
pool.ReSize(100000) // Readjust its capacity to 100000

Don't worry about the synchronous problems in this case, this method is thread-safe.

About sequence

All the tasks submitted to ants pool will not be guaranteed to be processed in order, because those tasks distribute among a series of concurrent workers, thus those tasks are processed concurrently.

Benchmarks

In that benchmark-picture, the first and second benchmarks performed test with 100w tasks and the rest of benchmarks performed test with 1000w tasks, both unlimited goroutines and ants pool, and the capacity of this ants goroutine-pool was limited to 5w.

  • BenchmarkGoroutine-4 represent the benchmarks with unlimited goroutines in golang.

  • BenchmarkPoolGroutine-4 represent the benchmarks with a ants pool.

The test data above is a basic benchmark and the more detailed benchmarks will be uploaded later.

Benchmarks with Pool

In that benchmark-picture, the first and second benchmarks performed test with 100w tasks and the rest of benchmarks performed test with 1000w tasks, both unlimited goroutines and ants pool, and the capacity of this ants goroutine-pool was limited to 5w.

As you can see, ants can up to 2x faster than goroutines without pool (1000w tasks) and it only consumes half memory comparing with goroutines without pool. (both 100w and 1000w tasks)

Benchmarks with PoolWithFunc

Throughput ( situation for only submitting tasks and need not waiting for all the tasks to be completed)

10w tasks

100w tasks

1000W tasks

There was only the test of ants Pool because my computer was crash when it reached 1000w goroutines.

As you can see, ants can up to 2x~6x faster than goroutines without pool and the memory consumption is reduced by 10 to 20 times.