A simulation study of a parallel processor with unbalanced loads

  • Authors:
  • Wade H. Shaw;Timothy S. Moore

  • Affiliations:
  • Department of Electrical and Computer Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio;Department of Electrical and Computer Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio

  • Venue:
  • WSC '87 Proceedings of the 19th conference on Winter simulation
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

It has been well established that the performance of a parallel processor computer system is affected by many design alternatives and the underlying degree of parallelism in the workload. We look at the impact of workloads which load processors in the network unevenly to observe the performance degradation. We constrain the parallel processor architecture to the family of hypercube networks. Each node is loaded with some portion of the workload composed of CPU bursts and I/O, and allowed to run at its on pace until it completes. Since message transmission preempts node processing, communication between nodes complicates the concurrent operation of the network. We vary the degree of load balance, the processing node locality and the ratio of CPU burst time to message transmission time across a generic 16 node hypercube and use total processing time speedup as the performance criteria. Regression models indicate strong nonlinear correlation between the degree of load imbalance and job speedup and a linear effect due to CPU/IO intensity. The locality of workload is shown to be a minor but significant effect. The impact of the load balance, CPU/IO intensity and locality effects on algorithm decomposition is discussed.