Modeling the communication behavior of distributed memory machines by genetic programming
Due to load imbalance and communication overhead the behavior of the runtime of distributed memory machines is very complex. The contribution of this paper is to show that runtime functions predicting the execution time of the communication operations can be generated by means of the genetic programming paradigm. The runtime functions generated dominate those presented in literature, till today.
Unable to display preview. Download preview PDF.
- 1.Foschia, R., Rauber, Th., and Rünger, G.: Prediction of the Communication Behavior of the Intel Paragon. In Proceedings of the 1997 IEEE MASCOTS Conference, pp.117–124, 1997.Google Scholar
- 2.Gen, M., and Cheng, R.: Genetic Algorithms & Engineering Design. John Wiley & Sons, Inc., New York, 1997.Google Scholar
- 3.Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, Reading, MA, 1989.Google Scholar
- 7.Koza, J.: Genetic Programming. The MIT Press, 1992.Google Scholar
- 8.Rauber, Th., and Rünger, G.: PVM and MPI Communication Operations on the IBM SP2: Modeling and Comparison. In Proceedings of HPCS 97, 1997.Google Scholar