Load Balancing Methods for Ray Tracing and Binary Tree Computing Using PVM
暂无分享,去创建一个
[1] Kai Hwang,et al. Advanced computer architecture - parallelism, scalability, programmability , 1992 .
[2] Chandrasekharan Narayanan. Fast Parallel Algorithms and Enumeration Techniques for Partial k-trees , 1989 .
[3] Gary L. Miller,et al. Parallel Tree Contraction, Part 2: Further Applications , 1991, SIAM J. Comput..
[4] David G. Kirkpatrick,et al. A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.
[5] Thomas W. Calvert,et al. Multiprocessor experiments for high-speed ray tracing , 1988, TOGS.
[6] Turner Whitted,et al. An improved illumination model for shaded display , 1979, CACM.
[7] Al Geist,et al. Network-based concurrent computing on the PVM system , 1992, Concurr. Pract. Exp..
[8] Andrew S. Glassner,et al. Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.
[9] Oscar H. Ibarra,et al. Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..
[10] J. Reif,et al. Parallel Tree Contraction Part 1: Fundamentals , 1989, Adv. Comput. Res..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.
[13] Oscar H. Ibarra,et al. Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.
[14] Takayuki Tanaka,et al. ARTS: Accelerated Ray-Tracing System , 1986, IEEE Computer Graphics and Applications.