A blazing‑fast, in‑memory, lock‑free event bus for Go—ideal for low‑latency pipelines, microservices, and game loops.
- Features
- Why GoEventBus?
- Installation
- Quick Start
- Transactions
- API Reference
- Back-pressure and Overrun Policies
- Use Cases
- Benchmarks
- Contributing
- License
- Lock‑free ring buffer: Efficient event dispatching using atomic operations and cache‑line padding.
- Context‑aware handlers: Every handler now receives a
context.Context, enabling deadlines, cancellation and tracing. - Back‑pressure policies: Choose whether to drop, block, or error when the buffer is full.
- Configurable buffer size: Specify the ring buffer size (must be a power of two) when creating the store.
- Async or Sync processing: Toggle between synchronous handling or async goroutine‑based processing via the
Asyncflag. - Metrics: Track published, processed, and errored event counts with a simple API.
- Simple API: Easy to subscribe, publish, and retrieve metrics.
Modern Go apps demand lightning‑fast, non‑blocking communication—but channels can bottleneck and external brokers add latency, complexity and ops overhead. GoEventBus is your in‑process, lock‑free solution:
- Micro‑latency dispatch
Atomic, cache‑aligned ring buffers deliver sub‑microsecond hand‑offs—no locks, no syscalls, zero garbage. - Sync or Async at will
Flip a switch to run handlers inline for predictability or in goroutines for massive parallelism. - Back‑pressure your way
Choose from DropOldest, Block or ReturnError to match your system’s tolerance for loss or latency. - Built‑in observability
Expose counters for published, processed and errored events out of the box—no extra instrumentation. - Drop‑in, zero deps
One import, no external services, no workers to manage—just Go 1.21+ and you’re off.
Whether you’re building real‑time analytics, high‑throughput microservices, or game engines, GoEventBus keeps your events moving at Go‑speed.
go get github.com/Protocol-Lattice/GoEventBus
package main
import (
"context""fmt""log""github.com/Protocol-Lattice/GoEventBus"
)
// Define a typed projection as a structtypeHouseWasSoldstruct{}
funcmain() {
// Create a dispatcher mapping projections (string or struct) to handlersdispatcher:= GoEventBus.Dispatcher{
"user_created": func(ctx context.Context, argsmap[string]any) (GoEventBus.Result, error) {
userID:=args["id"].(string)
fmt.Println("User created with ID:", userID)
return GoEventBus.Result{Message: "handled user_created"}, nil
},
HouseWasSold{}: func(ctx context.Context, argsmap[string]any) (GoEventBus.Result, error) {
address:=args["address"].(string)
price:=args["price"].(int)
fmt.Printf("House sold at %s for $%d\n", address, price)
return GoEventBus.Result{Message: "handled HouseWasSold"}, nil
},
}
// Initialise an EventStore with a 64K ring buffer and DropOldest overrun policystore:=GoEventBus.NewEventStore(&dispatcher, 1<<16, GoEventBus.DropOldest)
// Enable asynchronous processingstore.Async=true// Enqueue a string-based event_=store.Subscribe(context.Background(), GoEventBus.Event{
ID: "evt1",
Projection: "user_created",
Args: map[string]any{"id": "12345"},
})
// Enqueue a struct-based event_=store.Subscribe(context.Background(), GoEventBus.Event{
ID: "evt2",
Projection: HouseWasSold{},
Args: map[string]any{"address": "123 Main St", "price": 500000},
})
// Process pending eventsstore.Publish()
// Wait for all async handlers to finishiferr:=store.Drain(context.Background()); err!=nil {
log.Fatalf("Failed to drain EventStore: %v", err)
}
// Retrieve metricspublished, processed, errors:=store.Metrics()
fmt.Printf("published=%d processed=%d errors=%d\n", published, processed, errors)
}GoEventBus now supports atomic transactions, allowing you to group multiple events and commit them together. This ensures that either all events are successfully published and handled, or none are.
package main
import (
"context""log""github.com/Protocol-Lattice/GoEventBus"
)
funcmain() {
// Begin a new transaction on the existing EventStore// Create a dispatcher mapping projections to handlersdispatcher:= GoEventBus.Dispatcher{
"user_created": func(ctx context.Context, argsmap[string]any) (GoEventBus.Result, error) {
return GoEventBus.Result{Message: "handled user_created"}, nil
},
"send_email": func(ctx context.Context, argsmap[string]any) (GoEventBus.Result, error) {
log.Println("Hello")
return GoEventBus.Result{Message: "handled send_email"}, nil
},
}
// Initialise an EventStore with a 64K ring buffer and DropOldest policystore:=GoEventBus.NewEventStore(&dispatcher, 1<<16, GoEventBus.DropOldest)
tx:=store.BeginTransaction()
// Buffer multiple eventstx.Publish(GoEventBus.Event{
ID: "evtA",
Projection: "user_created",
Args: map[string]any{"id": "12345"},
})
tx.Publish(GoEventBus.Event{
ID: "evtB",
Projection: "send_email",
Args: map[string]any{"template": "welcome", "userID": "12345"},
})
tx.Rollback()
// Commit the transaction atomicallyiferr:=tx.Commit(context.Background()); err!=nil {
log.Fatalf("transaction failed: %v", err)
}
}typeResultstruct {
Messagestring// Outcome message from handler
}typeDispatchermap[interface{}]func(context.Context, map[string]any) (Result, error)A map from projection keys to handler functions. Handlers receive a context.Context and an argument map, and return a Result and an error.
typeEventstruct {
IDstring// Unique identifier for the eventProjectioninterface{} // Key to look up the handler in the dispatcherArgsmap[string]any// Payload data for the event
}typeTransactionstruct {
store*EventStoreevents []EventstartHeaduint64// head position when transaction began
}BeginTransaction() *Transaction: Start a new transaction.Publish(e Event): Buffer an event within the transaction.Commit(ctx context.Context) error: Atomically enqueue and process all buffered events, returning on the first error.Rollback(): Discard buffered events without publishing.
typeOverrunPolicyintconst (
DropOldestOverrunPolicy=iota// Default: discard oldest eventsBlock// Block until space is availableReturnError// Fail fast with ErrBufferFull
)typeEventStorestruct {
dispatcher*Dispatcher// Pointer to the dispatcher mapsizeuint64// Buffer size (power of two)buf []unsafe.Pointer// Ring buffer of event pointersevents []Event// Backing slice for Event dataheaduint64// Atomic write indextailuint64// Atomic read index// Config flagsAsyncboolOverrunPolicyOverrunPolicy// CounterspublishedCountuint64processedCountuint64errorCountuint64
}funcNewEventStore(dispatcher*Dispatcher, bufferSizeuint64, policyOverrunPolicy) *EventStoreCreates a new EventStore with the provided dispatcher, ring buffer size, and overrun policy.
func (es*EventStore) Subscribe(ctx context.Context, eEvent) errorAtomically enqueues an Event for later publication, applying back‑pressure according to OverrunPolicy. If OverrunPolicy is ReturnError and the buffer is full, the function returns ErrBufferFull.
func (es*EventStore) Publish()Dispatches all events from the last published position to the current head. If Async is true, handlers run in separate goroutines; otherwise they run in the caller's goroutine.
func (es*EventStore) Drain(ctx context.Context) errorBlocks until all in-flight asynchronous handlers complete, then stops the worker pool. Returns an error if the provided context.Context is canceled or its deadline is exceeded.
func (es*EventStore) Close(ctx context.Context) errorDrains all pending asynchronous handlers and shuts down the EventStore. Blocks until all in-flight handlers complete or the provided context.Context is canceled. Returns an error if the context’s deadline is exceeded or it is otherwise canceled.
func (es*EventStore) Metrics() (published, processed, errorsuint64)Returns the total count of published, processed, and errored events.
func (es*EventStore) Schedule(ctx context.Context, t time.Time, eEvent) *time.TimerSchedules an Event to be subscribed and published at a specific time t.
- If
tis in the future, the function returns a*time.Timerthat can be used to cancel the event before it fires by usingtimer.Stop(). - If
tis in the past or is the current time, the event is executed immediately and synchronously, bypassing the event queue, and the function returnsnil.
func (es*EventStore) ScheduleAfter(ctx context.Context, d time.Duration, eEvent) *time.TimerA convenience wrapper around Schedule that fires an event after a specified duration d.
- If the duration
dis greater than zero, it returns a cancellable*time.Timer. - If
dis zero or negative, the event is executed immediately and synchronously, bypassing the event queue, and the function returnsnil.
GoEventBus provides three strategies for handling a saturated ring buffer:
| Policy | Behaviour | When to use |
|---|---|---|
DropOldest | Atomically advances the read index, discarding the oldest event to make room for the new one. | Low‑latency scenarios where the newest data is most valuable and occasional loss is acceptable. |
Block | Causes Subscribe to block (respecting its context) until space becomes available. | Workloads that must not lose events but can tolerate the latency of back‑pressure. |
ReturnError | Subscribe returns ErrBufferFull immediately, allowing the caller to decide what to do. | Pipelines where upstream logic controls retries and failures explicitly. |
DropOldest is the default behaviour and matches releases prior to April 2025.
GoEventBus is ideal for scenarios where low‑latency, high‑throughput, and non‑blocking event dispatching is needed:
- 🔄 Real‑time event pipelines (e.g. analytics, telemetry)
- 📥 Background task execution or job queues
- 🧩 Microservice communication using in‑process events
- ⚙️ Observability/event sourcing in domain‑driven designs
- 🔁 In‑memory pub/sub for small‑scale distributed systems
- 🎮 Game loops or simulations requiring lock‑free dispatching
All benchmarks were run with Go’s testing harness (go test -bench .) on an -8 procs configuration. Numbers below are from the April 2025 release.
| Benchmark | Iterations | ns/op |
|---|---|---|
BenchmarkSubscribe-8 | 27,080,376 | 40.37 |
BenchmarkSubscribeParallel-8 | 26,418,999 | 38.42 |
BenchmarkPublish-8 | 295,661,464 | 3.910 |
BenchmarkPublishAfterPrefill-8 | 252,943,526 | 4.585 |
BenchmarkSubscribeLargePayload-8 | 1,613,017 | 771.5 |
BenchmarkPublishLargePayload-8 | 296,434,225 | 3.910 |
BenchmarkEventStore_Async-8 | 2,816,988 | 436.5 |
BenchmarkEventStore_Sync-8 | 2,638,519 | 428.5 |
BenchmarkFastHTTPSync-8 | 6,275,112 | 163.8 |
BenchmarkFastHTTPAsync-8 | 1,954,884 | 662.0 |
BenchmarkFastHTTPParallel-8 | 4,489,274 | 262.3 |
Contributions, issues, and feature requests are welcome! Feel free to check the issues page.
Distributed under the MIT License. See LICENSE for more information.
