Nothing Special   »   [go: up one dir, main page]

Melikov et al., 2020 - Google Patents

Analyzing the models of systems with heterogeneous servers

Melikov et al., 2020

Document ID
1307123735782340608
Author
Melikov A
Ponomarenko L
Mekhbaliyeva E
Publication year
Publication venue
Cybernetics and Systems Analysis

External Links

Snippet

The mathematical model of a queueing system with heterogeneous servers, without queues, and with two types of requests is investigated. High-priority requests are processed in fast servers while low-priority calls are processed in slow servers. If all servers in some group …
Continue reading at link.springer.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5083—Techniques for rebalancing the load in a distributed system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control

Similar Documents

Publication Publication Date Title
Feng et al. Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems
Melikov et al. Analyzing the models of systems with heterogeneous servers
US7752628B2 (en) Method and apparatus for reassigning objects to processing units
He et al. Priority queue with customer upgrades
Kaur et al. Dynamic resource allocation for big data streams based on data characteristics (5 V s)
Suman et al. Analysis of tandem polling queues with finite buffers
Ahn et al. Staffing decisions for heterogeneous workers with turnover
Yadav et al. An efficient fuzzy‐based task offloading in edge‐fog‐cloud architecture
Xie et al. Performance analysis of service systems with priority upgrades
Altman et al. Stochastic scheduling games with Markov decision arrival processes
US20050125799A1 (en) Methods and systems for assigning objects to processing units
Atar et al. Workload-dependent dynamic priority for the multiclass queue with reneging
Larranaga Dynamic control of stochastic and fluid resource-sharing systems
Xie et al. On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers
Haji et al. A queueing loss model with heterogeneous skill based servers under idle time ordering policies
Konovalov et al. A Simple Dispatching Policy For Minimizing Mean Response Time In Non-Observable Queues With SRPT Policy Operating In Parallel.
Kim Finite‐Buffer M/G/1 Queues with Time and Space Priorities
Zhao et al. Analysis of a MAP/PH/1 queue with discretionary priority based on service stages
Silva et al. Admission control strategies for tandem Markovian loss systems
Tekin et al. Dynamic server allocation for unstable queueing networks with flexible servers
Qadeer et al. Real-time multi-resource allocation via a structured policy table
Kruk Stability of linear EDF networks with resource sharing
Bogachev Optimization of the fluid model of scheduling: local predictions
Степанюк Control in Gordon-Newell Networks
Ortega et al. Recent issues on stochastic directional convexity, and new results on the analysis of systems for communication, information, time scales and maintenance