Performance analysis of a scheme for concurrency/synchronization using queueing network models

Journal Article · Mon Dec 01 04:00:00 EST 1986 · Int. J. Parallel Program.; (United States)

DOI:https://doi.org/10.1007/BF01407412· OSTI ID:5606462

Almeida, V A.F.; Dowdy, L W

Queueing network models have been used extensively to analyze performance of computer systems. However, queueing network models with product form solutions are not directly applicable to systems that process programs with internal concurrency/synchronization. An exact solution of system systems is often not feasible because of its large state space. Approximation techniques, based on queueing network theory, are presented which analyze the performance of closed systems with a specific scheme of concurrency/synchronization. The techniques are applicable to multitasking systems, distributed database systems, packet routing environments, and fork/join situations.

• Research Organization: Vanderbilt Univ., Nashville, TN
• OSTI ID: 5606462
• Journal Information: Int. J. Parallel Program.; (United States), Journal Name: Int. J. Parallel Program.; (United States) Vol. 15:6; ISSN IJPPE
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMPUTER CODES
COMPUTER NETWORKS
COMPUTERIZED SIMULATION
COMPUTERS
CRAY COMPUTERS
DATA PROCESSING
DIGITAL COMPUTERS
MATHEMATICAL LOGIC
MATHEMATICAL MODELS
OPTIMIZATION
PARALLEL PROCESSING
PERFORMANCE TESTING
PROCESSING
PROGRAMMING
SIMULATION
SUPERCOMPUTERS
SYNCHRONIZATION
SYSTEMS ANALYSIS
TASK SCHEDULING
TESTING