Title :
Decomposing nonproduct from queueing lattices through simulated annealing
Author_Institution :
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
Abstract :
A simulated annealing technique is adapted to decompose the state transition lattice of a class of nonproduct form queueing models which are useful in studying the behaviour of computer systems. Only the lattices of type A structure are considered. Applying this technique, the lattice is decomposed into solvable subsets which can be solved sequentially. A large amount of computation time can be saved in this way
Keywords :
performance evaluation; queueing theory; simulated annealing; computation time; computer systems; decomposition; nonproduct from queueing lattices; performance evaluation; sequentially solvable subsets; simulated annealing; state transition lattice; type A structure lattices; Closed-form solution; Computational modeling; Computer networks; Computer simulation; Equations; Lattices; Queueing analysis; Simulated annealing; Software performance; Software tools;
Conference_Titel :
Industrial Electronics Society, 1990. IECON '90., 16th Annual Conference of IEEE
Conference_Location :
Pacific Grove, CA
Print_ISBN :
0-87942-600-4
DOI :
10.1109/IECON.1990.149168
