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

Active Publication Date: 2013-06-19
ZHEJIANG UNIV
View PDF3 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, the analysis method based on hierarchical decomposition has high computational complexity for large-scale fork-sink queuing network models

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 performances of single closed fork-join queuing network based on horizontal decomposition
  • Method for analyzing performances of single closed fork-join queuing network based on horizontal decomposition
  • Method for analyzing performances of single closed fork-join queuing network based on horizontal decomposition

Examples

Experimental program
Comparison scheme
Effect test

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 ...

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 performances of a single closed fork-join queuing network based on horizontal decomposition. The method is characterized in that a horizontal decomposition method is utilized to decompose a single closed fork-join queuing network model into a plurality of product-form queuing network models, thus an average value analysis method can be used to quickly solve the model, and the horizontal decomposition is only carried out on a queuing network comprising nested fork-joint operations once without recursive decomposition like a layer decomposition method, thereby greatly reducing the computational complexity, improving the efficiency that a computer computes and analyzes the single closed fork-join queuing network model, and promoting the computational performance.

Description

technical field [0001] The invention relates to the field of queuing network performance analysis, and mainly relates to a single-type closed bifurcation-convergence queuing network performance analysis method based on horizontal decomposition. Background technique [0002] Queuing Network (Queueing Network) model is a classic system performance analysis method, it uses a service center (Service Center) to describe a hardware and software resource, the whole system can be seen 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 open model (Open Model) and closed mode...

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 Patents(China)
IPC IPC(8): H04L12/24H04L12/70
Inventor 尹建伟陈韩玮卢兴见邓水光李莹吴朝晖吴健
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap