Load balancing technique for parallel search with statistical model
暂无分享,去创建一个
[1] Benjamin W. Wah,et al. Coping with Anomalies in Parallel Branch-and-Bound Algorithms , 1986, IEEE Transactions on Computers.
[2] Azriel Rosenfeld,et al. Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.
[3] S. Madala,et al. Performance of Synchronous Parallel Algorithms with Regular Structures , 1991, IEEE Trans. Parallel Distributed Syst..
[4] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..
[5] Thomas C. Henderson. Discrete relaxation techniques , 1989 .
[6] Vipin Kumar,et al. On the Efficiency of Parallel Backtracking , 1993, IEEE Trans. Parallel Distributed Syst..
[7] John Gaschnig,et al. A General Backtrack Algorithm That Eliminates Most Redundant Tests , 1977, IJCAI.
[8] J. T. Robinson,et al. Some Analysis Techniques for Asynchronous Multiprocessor Algorithms , 1979, IEEE Transactions on Software Engineering.
[9] Vivek Sarkar,et al. Processor Scheduling Algorithms for Constraint-Satisfaction Search Problems , 1988, ICPP.
[10] Alan Weiss,et al. Allocating Independent Subtasks on Parallel Processors , 1985, IEEE Transactions on Software Engineering.
[11] Michel Dubois,et al. Performance of Synchronized Iterative Processes in Multiprocessor Systems , 1982, IEEE Transactions on Software Engineering.
[12] Dharma P. Agrawal,et al. A Randomized Parallel Backtracking Algorithm , 1988, IEEE Trans. Computers.
[13] Vipin Kumar,et al. Parallel depth first search. Part II. Analysis , 1987, International Journal of Parallel Programming.
[14] Richard E. Korf,et al. Optimal path-finding algorithms* , 1988 .
[15] Stephen F. Lundstrom,et al. Predicting Performance of Parallel Computations , 1990, IEEE Trans. Parallel Distributed Syst..
[16] V. Nageshwara Rao,et al. Scalable parallel formulations of depth-first search , 1990 .