CRITICAL: Assignment validation was running on EVERY LookupTopicBrokers call! Problem (from CPU profile): - ensureTopicActiveAssignments: 14.18% CPU (2.56s out of 18.05s) - EnsureAssignmentsToActiveBrokers: 14.18% CPU (2.56s) - ConcurrentMap.IterBuffered: 12.85% CPU (2.32s) - iterating all brokers - Called on EVERY LookupTopicBrokers request, even with cached config! Root Cause: LookupTopicBrokers flow was: 1. getTopicConfFromCache() - returns cached config (fast ✅) 2. ensureTopicActiveAssignments() - validates assignments (slow ❌) Even though config was cached, we still validated assignments every time, iterating through ALL active brokers on every single request. With 250 requests/sec, this meant 250 full broker iterations per second! Solution: Move assignment validation inside getTopicConfFromCache() and only run it on cache misses: Changes to broker_topic_conf_read_write.go: - Modified getTopicConfFromCache() to validate assignments after filer read - Validation only runs on cache miss (not on cache hit) - If hasChanges: Save to filer immediately, invalidate cache, return - If no changes: Cache config with validated assignments - Added ensureTopicActiveAssignmentsUnsafe() helper (returns bool) - Kept ensureTopicActiveAssignments() for other callers (saves to filer) Changes to broker_grpc_lookup.go: - Removed ensureTopicActiveAssignments() call from LookupTopicBrokers - Assignment validation now implicit in getTopicConfFromCache() - Added comments explaining the optimization Cache Behavior: - Cache HIT: Return config immediately, skip validation (saves 14% CPU!) - Cache MISS: Read filer -> validate assignments -> cache result - If broker changes detected: Save to filer, invalidate cache, return - Next request will re-read and re-validate (ensures consistency) Performance Impact: With 30-second cache TTL and 250 lookups/sec: - Before: 250 validations/sec × 10ms each = 2.5s CPU/sec (14% overhead) - After: 0.17 validations/sec (only on cache miss) - Reduction: 99.93% fewer validations Expected CPU Reduction: - Before (with cache): 18.05s total, 2.56s validation (14%) - After (with optimization): ~15.5s total (-14% = ~2.5s saved) - Combined with previous cache fix: 25.18s -> ~15.5s (38% total reduction) Cache Consistency: - Assignments validated when config first cached - If broker membership changes, assignments updated and saved - Cache invalidated to force fresh read - All brokers eventually converge on correct assignments Testing: - ✅ Compiles successfully - Ready to deploy and measure CPU improvement Priority: CRITICAL - Completes optimization of LookupTopicBrokers hot path
SeaweedMQ Message Queue on SeaweedFS (WIP, not ready)
What are the use cases it is designed for?
Message queues are like water pipes. Messages flow in the pipes to their destinations.
However, what if a flood comes? Of course, you can increase the number of partitions, add more brokers, restart, and watch the traffic level closely.
Sometimes the flood is expected. For example, backfill some old data in batch, and switch to online messages. You may want to ensure enough brokers to handle the data and reduce them later to cut cost.
SeaweedMQ is designed for use cases that need to:
- Receive and save large number of messages.
- Handle spike traffic automatically.
What is special about SeaweedMQ?
- Separate computation and storage nodes to scale independently.
- Unlimited storage space by adding volume servers.
- Unlimited message brokers to handle incoming messages.
- Offline messages can be operated as normal files.
- Scale up and down with auto split and merge message topics.
- Topics can automatically split into segments when traffic increases, and vice verse.
- Pass messages by reference instead of copying.
- Clients can optionally upload the messages first and just submit the references.
- Drastically reduce the broker load.
- Stateless brokers
- All brokers are equal. One broker is dynamically picked as the leader.
- Add brokers at any time.
- Allow rolling restart brokers or remove brokers at a pace.
Design
How it works?
Brokers are just computation nodes without storage. When a broker starts, it reports itself to masters. Among all the brokers, one of them will be selected as the leader by the masters.
A topic needs to define its partition key on its messages.
Messages for a topic are divided into segments. One segment can cover a range of partitions. A segment can be split into 2 segments, or 2 neighboring segments can be merged back to one segment.
During write time, the client will ask the broker leader for a few brokers to process the segment.
The broker leader will check whether the segment already has assigned the brokers. If not, select a few brokers based on their loads, save the selection into filer, and tell the client.
The client will write the messages for this segment to the selected brokers.
Failover
The broker leader does not contain any state. If it fails, the masters will select a different broker.
For a segment, if any one of the selected brokers is down, the remaining brokers should try to write received messages to the filer, and close the segment to the clients.
Then the clients should start a new segment. The masters should assign other healthy brokers to handle the new segment.
So any brokers can go down without losing data.
Auto Split or Merge
(The idea is learned from Pravega.)
The brokers should report its traffic load to the broker leader periodically.
If any segment has too much load, the broker leader will ask the brokers to tell the client to close current one and create two new segments.
If 2 neighboring segments have the combined load below average load per segment, the broker leader will ask the brokers to tell the client to close this 2 segments and create a new segment.