Assigning and scheduling threads for multiple prioritized queues
A queue and priority technology, applied in the field of allocating and scheduling threads for multiple prioritized queues, can solve problems such as inability to change priority, priority inversion, and number limited by system resources
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0015] The following sections describe an example computer system on which an operating system can be implemented that allocates and schedules worker threads to items from multiple prioritized queues.
[0016] The following description is intended to provide a brief, general description of a suitable computer with which such a system may be implemented. A computer can be any of a variety of general-purpose or special-purpose computing hardware configurations. Examples of well-known computers that may be suitable include, but are not limited to, personal computers, server computers, handheld or laptop devices (e.g., media players, notebook computers, tablet computers, cellular phones, personal data assistants, voice recorders), multimedia Processor systems, microprocessor-based systems, set-top boxes, game consoles, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 