Parallel simulation by multi-instruction, longest-path algorithms

Parallel simulation by multi-instruction, longest-path algorithms

0.00 Avg rating0 Votes
Article ID: iaor20003116
Country: Netherlands
Volume: 27
Issue: 1/2
Start Page Number: 37
End Page Number: 54
Publication Date: Dec 1997
Journal: Queueing Systems
Authors:
Keywords: GI/G/1 queues, queueing networks
Abstract:

This paper presents several basic algorithms for the parallel simulation G/G/1 queueing systems and certain networks of such systems. The coverage includes systems subject to manufacturing or communication blocking, or to loss of customer due to capacity constraints. The key idea is that the customer departure times are represented by longest-path distance in directed graphs instead of by the usual recursive equations. This representation leads to scalable algorithms with a high degree of parallelism that can be implemented on either MIMD or SIMD parallel computers.

Reviews

Required fields are marked *. Your email address will not be published.