Toward efficient scheduling of evolving computations on rings of processors

Journal of Parallel and Distributed Computing

Volumn 38, Issue 1, 1996, Pages 92-100

  Gao, Li Xin ^a   Rosenberg, Arnold L ^a  

^a University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030579026     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0131     Document Type: Article

References (8)

1. 1. Brent, R. P. The parallel evaluation of general arithmetic expressions. J. Assoc. Comput. Mach. 21, (1974), 201-206.
2. 2. Cormen, T., Leiserson, C. E., and Rivest, R. L. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
3. 3. Even, G. Construction of Small Probability Spaces for Deterministic Simulation. M.Sc. thesis, The Technion, Israel. [In Hebrew]
4. 4. Gao, L.-X., Gregory, D. E., Rosenberg, A. L., and Cohen, P. R. Efficient scheduling of branching computations on rings of processors: An empirical study. Typescript, University of Massachusetts, 1996.
5. 5. Karp, R. M., and Zhang, Y. Randomized parallel algorithms for backtrack search and branch-and-bound computation. J. Assoc. Comput. Mach. 40, (1988), 765-789.
6. 6. Lüling, R. and Monien, B. A dynamic, distributed load-balancing algorithm with provable good performance. 5th ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 164-172.
7. 7. Ranade, A. G. Optimal speedup for backtrack search on a butterfly network. Math. Systems Theory 27, (1994), 85-101.
8. 8. Rudolph, L., Slivkin, M., and Upfal, E. A simple load balancing scheme for task allocation in parallel machines. 3rd ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 237-244.