Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for analyzing performance of multi-class closed fork-join queuing network based on horizontal decomposition

A technology of queuing network and analysis method, which is applied in the field of performance analysis of multi-type closed bifurcation-convergence queuing network models, can solve the problems of high solution complexity and inability to analyze the performance of multi-type closed bifurcation-convergence queuing network models, etc. The effect of improving efficiency

Active Publication Date: 2011-07-13
ZHEJIANG UNIV
View PDF2 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, due to the high complexity of the solution, the computer in the prior art can only analyze and calculate the single-class (Single-Class) fork-convergence queuing network model, and it is still unable to analyze the performance of the multi-class closed fork-convergence queuing network model. analyze

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for analyzing performance of multi-class closed fork-join queuing network based on horizontal decomposition
  • Method for analyzing performance of multi-class closed fork-join queuing network based on horizontal decomposition
  • Method for analyzing performance of multi-class closed fork-join queuing network based on horizontal decomposition

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0038]The present invention will be further described below in conjunction with accompanying drawing and embodiment:

[0039] The invention aims at multiple types of closed fork-and-converge queuing network models, and decomposes each type of non-product queuing network model including fork-closing operations into one closed and several open product queuing network models by using a horizontal decomposition method on a computer. The horizontal decomposition method is to parallelize the fork-collection N B Subtasks are split into a trunk and branches, where the backbone is determined by providing a reasonable initial value for the average queue length of each service center (e.g. , N is the total number of requests in the closed queuing network model, K is the total number of service centers in the closed queuing network model), so as to estimate the response time (Response Time) of each subtask, and set the subtask execution path with the longest response time as the tru...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for analyzing performance of a multi-class closed fork-join queuing network based on horizontal decomposition. According to the method, each class of model including fork-join operation in the models is subjected to horizontal decomposition so that a computer can implement rapid and accurate analysis on the performance of the queuing network models to obtain analyzable parameters of actual system performance, thereby improving the efficiency of the computer in analyzing the system performance.

Description

technical field [0001] The invention relates to the field of performance analysis of queuing network models, and mainly relates to a method for analyzing the performance of multi-category closed bifurcation-convergence queuing network models based on horizontal decomposition. Background technique [0002] The Queuing Network model is a classic system performance analysis method. It uses a service center (Service Center) to describe a software and hardware resource. The entire system can be regarded as a combination of several service centers according to certain relationships. network of. The service center can be divided into two types: queue type and delay type: the queue type service center consists of a queue and several servers, the server is used to perform operations, and the queue is used to cache requests waiting for service; while the delay type service center Mainly used for simulating delay operation. The queue network model can be divided into an open model an...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/24H04L12/56
Inventor 尹建伟陈韩玮卢兴见邓水光李莹吴朝晖吴健
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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