Predicting Multiprocessor Memory Access Patterns with Learning Models

Machine learning techniques are applicable to computer system optimization. We show that shared memory multiprocessors can successfully utilize machine learning algorithms for memory access pattern prediction. In particular three different on-line machine learning prediction techniques were tested to learn and predict repetitive memory access patterns for three typical parallel processing applications, the 2-D relaxation algorithm, matrix multiply and Fast Fourier Transform on a shared memory multiprocessor. The predictions were then used by a routing control algorithm to reduce control latency in the interconnection network by configuring the interconnection network to provide needed memory access paths before they were requested. Three trainable prediction techniques were used and tested: 1). a Markov predictor, 2). a linear predictor and 3). a time delay neural network (TDNN) predictor. Different predictors performed best on different applications, but the TDNN produced uniformly good results.

[1]  C. G. Bell Multis: A New Class of Multiprocessor Computers , 1985, Science.

[2]  Compiler-directed data prefetching in multiprocessors with memory hierarchies , 1990 .

[3]  Geoffrey E. Hinton,et al.  A time-delay neural network architecture for isolated word recognition , 1990, Neural Networks.

[4]  J. E. Jensen,et al.  Neural network controller for adaptive routing in survivable communications networks , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[5]  T. Fritsch,et al.  Communication network routing using neural nets-numerical aspects and alternative approaches , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[6]  Kirk L. Johnson The impact of communication locality on large-scale multiprocessor performance , 1992, ISCA '92.

[7]  Yoshiyasu Takefuji,et al.  Comparisons of Seven Neural Network Models on Traffic Control Problems in Multistage Interconnection Networks , 1993, IEEE Trans. Computers.

[8]  Robert A. Jacobs,et al.  Hierarchical Mixtures of Experts and the EM Algorithm , 1993, Neural Computation.

[9]  C. L. Giles,et al.  Routing in Optical Multistage Interconnection Networks: a Neural Network Solution UMIACS-TR-94-21 AN , 1994 .

[10]  Franciszek Seredynski Dynamic mapping and load balancing with parallel genetic algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[11]  Willard Korfhage,et al.  Process scheduling using genetic algorithms , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

[12]  Marcus Dormanns,et al.  Partitioning and mapping of large FEM-graphs by self-organization , 1995, Proceedings Euromicro Workshop on Parallel and Distributed Processing.

[13]  C. Lee Giles,et al.  Using recurrent neural networks to learn the structure of interconnection networks , 1995, Neural Networks.

[14]  Donald M. Chiarulli,et al.  Online prediction of multiprocessor memory access patterns , 1996, Proceedings of International Conference on Neural Networks (ICNN'96).

[15]  Donald M. Chiarulli,et al.  Performance of On-Line Learning Methods in Predicting MultiprocessorMemory Access Patterns , 1998 .

[16]  Keith W. Miller,et al.  Using the Multistage Cube Network Topology in Parallel Supercomputers. in Interconnection Networks for Large-scale Parallel Processing , 2022 .