Dompq

Dompq is a term used in computer science to refer to a domain-oriented priority queue, an abstract data type and family of software implementations designed to manage and schedule tasks whose priority is determined by domain-specific criteria. The concept combines the familiar operations of a priority queue with a domain bucketing mechanism that groups items by domain and can favor certain domains under policy rules. This allows systems that handle heterogeneous workloads to prioritize tasks according to contextual requirements such as quality-of-service guarantees, latency targets, or resource constraints.

Core design features include a push operation with a domain label and priority, a pop or extract-min that returns the globally highest-priority task, and support for priority updates. Many models also provide domain-aware operations, such as domain-based reservations or the ability to promote or demote all items within a domain. Implementations typically balance a heap-based core with per-domain queues, allowing fast domain-level adjustments while preserving global ordering.

Typical complexities are similar to standard priority queues: insert and extract-min in O(log n) time, and decrease-key in O(log n) with a suitable data structure; some variants offer amortized or approximate behaviors for large-scale systems.

Applications include real-time scheduling, simulations with diverse task classes, event-driven frameworks, and environments that must allocate CPU time across multiple subsystems. Dompq has appeared primarily in academic discussions and experimental libraries; it is not a standardized interface and terminology can vary across sources.

See also: Priority queue, Scheduling, Domain-driven design, Event queue.