An affine partitioning algorithm to maximize parallelism and minimize communication

作者: Amy W. Lim , Gerald I. Cheong , Monica S. Lam

DOI: 10.1145/305138.305197

关键词: Affine transformationPath vector protocolStatic routingLink-state routing protocolParallel computingDistance-vector routing protocolRouting tableComputer scienceParallelism (grammar)Multipath routing

摘要:

参考文章(22)
W. Appelbe, K. Smith, Determining Transformation Sequences for Loop Parallelization languages and compilers for parallel computing. pp. 208- 222 ,(1992) , 10.1007/3-540-57502-2_49
Michael Edward Wolf, Improving locality and parallelism in nested loops Stanford University. ,(1992)
Alexander Schrijver, Theory of Linear and Integer Programming ,(1986)
Kathryn S. McKinley, Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors Proceedings of the 8th international conference on Supercomputing - ICS '94. pp. 54- 63 ,(1994) , 10.1145/181181.181265
Amy W. Lim, Monica S. Lam, Maximizing parallelism and minimizing synchronization with affine partitions parallel computing. ,vol. 24, pp. 445- 475 ,(1998) , 10.1016/S0167-8191(98)00021-0
Paul Feautrier, Some efficient solutions to the affine scheduling problem: I. One-dimensional time International Journal of Parallel Programming. ,vol. 21, pp. 313- 348 ,(1992) , 10.1007/BF01407835
Wayne Kelly, William Plugh, Minimizing communication while preserving parallelism international conference on supercomputing. pp. 52- 60 ,(1996) , 10.1145/237578.237585
Chau-Wen Tseng, Compiler optimizations for eliminating barrier synchronization acm sigplan symposium on principles and practice of parallel programming. ,vol. 30, pp. 144- 155 ,(1995) , 10.1145/209936.209952