The Leaky Bucket Algorithm

Explore the leaky bucket algorithm in Go to understand how buffers are managed between client and server goroutines using channels. Discover how this approach handles buffer allocation and reusability to improve concurrency efficiency, and identify why buffers may be dropped when the free list is full.

We'll cover the following...

Introduction
Example

Introduction

Consider the following client-server configuration. The client goroutine performs an infinite loop that is receiving data from some source, perhaps a network; the data are read in buffers of type Buffer. To avoid allocating and freeing buffers too much, it keeps a free list of them, and uses a buffered channel to represent them:

var freeList = make(chan *Buffer, 100)

This queue of reusable buffers is ...

1.Origin, Context and Popularity of GO

2.Basic Constructs and Elementary Data Types

3.Control Structures

4.Functions

5.Arrays and Slices

6.Maps

7.Packages

8.Structs and Methods

9.Interfaces and Reflection

10.Reading and Writing

11.Error-Handling and Testing

12.Goroutines and Channels

13.Networking, Templating and Web-Applications

14.Common Go Pitfalls and Patterns

15.Performance Advices

16.Building a Complete Application

17.Appendix

The Leaky Bucket Algorithm

Introduction