Exploiting Knowledge of Temporal Behaviour in Parallel Programs for Improving Distributed Mapping
暂无分享,去创建一个
[1] Thomas Fahringer. Compile-Time Estimation of Communication Costs for Data Parallel Programs , 1996, J. Parallel Distributed Comput..
[2] Fernando Guirado,et al. Modelling message-passing programs for static mapping , 2000, Proceedings 8th Euromicro Workshop on Parallel and Distributed Processing.
[3] Jack Dongarra,et al. PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing , 1995 .
[4] Ana Cortés,et al. Performance Comparison of Strategies for Static Mapping of Parallel Programs , 1997, HPCN Europe.
[5] Manish Gupta,et al. Compile-time estimation of communication costs on multicomputers , 1992, Proceedings Sixth International Parallel Processing Symposium.
[6] Ishfaq Ahmad,et al. Benchmarking the task graph scheduling algorithms , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.
[7] Ana Cortés,et al. Clustering and reassignment-based mapping strategy for message-passing architectures , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.
[8] Samuel T. Chanson,et al. Allocating Task Interaction Graphs to Processors in Heterogeneous Networks , 1997, IEEE Trans. Parallel Distributed Syst..
[9] J. Ramanujam,et al. Cluster partitioning approaches to mapping parallel programs onto a hypercube , 1987, Parallel Comput..