Fast processor allocation and dynamic scheduling for mesh multiprocessors

Computer Systems Science and Engineering

Volumn 11, Issue 2, 1996, Pages 99-107

  Zhu, Yahui ^a  

^a University of Central Florida   (United States)

Author keywords

Area tree; Fragmentation; Mesh connected multiprocessor; Processor allocation; Submesh; Task scheduling

Indexed keywords

DATA STRUCTURES; HIERARCHICAL SYSTEMS; IMAGE PROCESSING; TREES (MATHEMATICS);

AREA TREE; MESH-CONNECTED MULTIPROCESSOR; PROCESSOR ALLOCATION; TASK SCHEDULING;

MULTIPROCESSING SYSTEMS;

EID: 0030104973     PISSN: 02676192     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. Barnes, G H et al. 'The ILLIAC IV computers', IEEE Trans. Comput., Vol C-27 No 1 (January 1968) pp 84-87
2. Batcher, KE 'Bit-serial parallel processing systems', IEEE Trans. Comput., Vol C-31 No 5 (May 1982) pp 377-384
3. Alverson, R et al. 'The Tera computer system', Proc. Int. Conf. on Supercomputing (June 1990) pp 1-6
4. Annaratone, M et al. 'The K2 parallel processor: architecture and hardware implementation', Proc. Int. Symposium on Computer Architecture (May 1990) pp 92-101
5. Zorpette, G 'Technology 1991: minis and mainframes', IEEE Spectrum, Vol 28 No 1 (January 1991) pp 40-43
6. Zorpette, G 'The power of parallelism', IEEE Spectrum, Vol 29 No 9 (September 1992) pp 28-33
7. Dally, W J 'Performance analysis of k-ary n-cube interconnection networks', IEEE Trans. Comput., Vol C-39 No 6 (June 1990) pp 775-155
8. Vitanyi, PMB 'Locality, communication, and interconnect length in multi-computers', SIAM J. Comput., Vol 17 No 4 (August 1988) pp 659-672
9. Li, K and Chen, K H 'A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system', J. Parallel and Distrib. Comput., Vol 12 (May 1991) pp 79-83
10. Chuang, P J and Tzeng, N F 'An efficient submesh allocation strategy for mesh computer systems', Proc. Int. Conf. Distributed Computing Systems (May 1991) pp 256-263
11. Bentley, J L 'Solutions to Klee's rectangle problems', Department of Computer Science, Carnegie-Mellon University (1977)
12. Wu, A Y, Bhaskar, S K and Rosenfeld, A 'Parallel computation of geometric properties from the medial axis transform', Computer Vision, Graphics, and Image Processing, Vol 41 (1988) pp 323-332
13. Samet, H 'The quadtree and related hierarchical data structures', ACM Comput. Surveys, Vol 16 (1984) pp. 187-260
14. Zhu, Y 'Efficient processor allocation strategies for mesh-connected parallel computers', J. Parallel and Distrib. Comput., Vol 16 (December 1992) pp 328-337
15. Krueger, P, Lai, TH and Radiya, V A 'Processor allocation vs. job scheduling on hypercube computers', Proc. Int. Conf. Distributed Comput. Systems (May 1991) pp 394-401
16. Teorey, T J and Pinkerton, T B 'A comparative analysis of disk scheduling policies', Comm. ACM, Vol 15 No 3 (March 1972) pp 177-184
17. Peterson, JL and Norman, TA 'Buddy systems', Comm. ACM, Vol 20 No 6 (June 1977) pp 421-431
18. Knuth, D E The Art of Computer Programming, Vol. I: Fundamental Algorithms. 2nd Ed., Addison-Wesley, Reading, MA (1973)
19. Dyer, C R 'The Space efficiency of quadtrees', Computer Graphics and Image Processing, Vol 19 (1982) pp 335-345