Method for analyzing performances of single closed fork-join queuing network based on horizontal decomposition
A technology of queuing network and analysis method, which is applied in the field of single-class closed fork-convergence queuing network performance analysis based on horizontal decomposition, and can solve problems such as high computational complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0026] The present invention will be further described below in conjunction with accompanying drawing and embodiment:
[0027] The present invention first establishes a single-type closed queuing network model for a system that has only one type of request and includes fork-join operations, wherein each computing resource corresponds to a service center. The two input parameters required to analyze the model are the number of requests N and the service time D of each service center i . The number of requests N can be set according to the system load scale, and the service time of the service center is D i It can be obtained from the history records of the corresponding computing resources. Then the computer uses the horizontal decomposition method to decompose a single-type closed fork-join queuing network model into several product-type queuing network models. Such as figure 1 As shown, a fork-join operation consists of 2 pairs (F 1 -J 1 and F 2 -J 2 )’s single-class ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com