Worst Case Scheduling for Parallel Functional Arograms

Journal of Functional Programming

Volumn 4, Issue 1, 1994, Pages 65-75

  Burton, F Warren ^a   Rayward Smith, V J ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF EAST ANGLIA   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84972168093     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796800000940     Document Type: Article

References (8)

1. Warren Burton, F. (1988) Storage management in virtual tree machines. IEEE Trans. Compute 37 (3): 321–328, March.
2. Warren Burton, F., McKeown, G.P. and Rayward-Smith, V.J. (1992) On process assignment in parallel computing. Info. Process. Lett.
3. Warren Burton, F., McKeown, G.P., Rayward-Smith, V.J. and Sleep, M.R. (1981) Parallel processing and combinatorial optimization. Proc. Conf. on Combinatorial Optimization, Stirling, Scotland, August, 19–36.
4. Coffman, E.G., Jr., editor, (1976) Computer and Job-Shop Scheduling Theory. John Wiley and Sons.
5. Eager, D.L., Lazowska, E.D. and Zahorjan, J. (1986) Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Softw. Eng., 12(5): 662–675, May.
6. Eager, D.L., Zahorjan, J. and Lazowska, E.D. (1989) Speedup versus efficiency in parallel systems. IEEE Trans. Comput., 38 (3): 408–423, March.
7. Jaffe, J.M. (1980) Bounds on the scheduling of typed task systems. SIAM J. Comput., 9: 541–551.
8. Ten-Hwang Lai, T.-H. and Sprague, A. (1985) Performance of parallel branch-and-bound algorithms. IEEE Trans. Comput., 34(10): 962–964, October.