Massively Parallel Simulation and Optimization of Queueing Networks,

Abstract

We simulate several variants of a class of queueing networks corresponding to different system parameter values or operating policies - simultaneously. One clock mechanism is used to drive all the variants. This clock synchronizes the system trajectories such that the same event takes place at the same time at all systems. This synchronization is the basis of the massively parallel algorithms we develop. Implementation of the algorithms on the massively parallel Connection Machine and the implications of the approach for performance optimization is discussed.

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1992
Accession Number
ADP007110

Entities

People

  • Edward Lau
  • Pirooz Vakili

Organizations

  • Boston University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Data Science
  • Engineering
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematics
  • Optimization
  • Simulations
  • Statistics
  • Theoretical Computer Science
  • Trajectories

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Parallel and Distributed Computing.