TPControl provides a simple yet powerfull scheduler which allows to manage a given throughput for any number of workers and optionally allows to prioritize their requests as well.
-
Updated
May 13, 2016 - Go
TPControl provides a simple yet powerfull scheduler which allows to manage a given throughput for any number of workers and optionally allows to prioritize their requests as well.
A Go implementation of a priority queue data structure
Course Project for CS 249, Spring 2017 at UCLA. Added Priority-based Pod Preemption to system which previously suppoerted only QoS-based preemption.
Package kkn.fi/heap implements indexed minimum Fibonacci priority queue.
A simple max or min priority queue implemented using an heap
A priority queue that shuffles elements with the same priority. Written in Go and inspired by https://github.com/mafintosh/shuffled-priority-queue.
Priority Queue implementation on Go. FIFO, Concurrency safe.
Priority queue (heap) based cache with 'priority' evict policy
extension of standard "container" package, include a variety of commonly used data structures.
Message queue system written in Go and backed by Redis
Algorithms and data structures
A simple and smallest binary heap priority queue in golang
Fast numeric-based Queue in Golang
A lightweight job scheduler based on priority queue with timeout, retry, replica, context cancellation and easy semantics for job chaining. Build for golang web apps.
Unbuffered Generic Concurrent Priority Queue in GoLang.
Algorithms + Data Structures = Programs
Add a description, image, and links to the priority-queue topic page so that developers can more easily learn about it.
To associate your repository with the priority-queue topic, visit your repo's landing page and select "manage topics."