Solving Irregular Problems through Parallel Irregular Trees
暂无分享,去创建一个
[1] Piet Hut,et al. A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.
[2] Scott B. Baden,et al. A robust parallel programming model for dynamic non-uniform scientific computations , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.
[3] Tony Field,et al. M-Tree: A Parallel Abstract Data Type for Block-Irregular Adaptive Applictions , 1997, Euro-Par.
[4] Paul S. Heckbert. Radiosity in Flatland , 1992, Comput. Graph. Forum.
[5] Scott B. Baden,et al. Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves , 1996, IEEE Trans. Parallel Distributed Syst..
[6] M. Berger,et al. Adaptive mesh refinement for hyperbolic partial differential equations , 1982 .
[7] James R. Larus,et al. Efficient support for irregular applications on distributed-memory machines , 1995, PPOPP '95.
[8] Donald P. Greenberg,et al. Modeling the interaction of light between diffuse surfaces , 1984, SIGGRAPH.
[9] William L. Briggs,et al. A multigrid tutorial, Second Edition , 2000 .
[10] Paul S. Heckhert,et al. Radiosity in Flatland , 1992 .
[11] William L. Briggs,et al. A multigrid tutorial , 1987 .
[12] Donald P. Greenberg,et al. An Efficient Radiosity Approach for Realistic Image Synthesis , 1986, IEEE Computer Graphics and Applications.
[13] Laura Ricci,et al. Integrating load balancing and locality in the parallelization of irregular problems , 2001, Future Gener. Comput. Syst..