Processor allocation in the mesh multiprocessors using the leapfrog method

IEEE Transactions on Parallel and Distributed Systems

Volumn 14, Issue 3, 2003, Pages 276-289

  Wu, Fan ^a   Hsu, Ching Chi ^b   Chou, Li Ping ^c  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b YUAN ZE UNIVERSITY   (Taiwan)

^c NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Allocation; Best fit; Buddy; First fit; Markov chain; Mesh; Random walk

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; INTERCONNECTION NETWORKS; MARKOV PROCESSES; PROBABILITY; SUPERCOMPUTERS;

BEST FIT ALLOCATION; FIRST FIT ALLOCATION; LEAPFROG METHOD; MESH MULTIPROCESSORS; PROCESSOR ALLOCATION; RANDOM WALK;

MULTIPROCESSING SYSTEMS;

EID: 0037624697     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2003.1189585     Document Type: Article

References (19)

1. R. Hockney and C. Jesshope, Parallel Computers 2: Architecture, Programming and Algorithms. IOP Publishing Ltd., 1988.
2. G. Barnes et al. "The Illiac IV Computers," IEEE Trans. Computers, vol. 17, no. 8, pp. 746-757, Aug. 1968.
3. R. Alverson et al. "The Tera Computer System," Proc. Fourth ACM Int'l Conf. Supercomputing, pp. 1-6, 1990.
4. D. Lenoski and J. Laudon et al. "The Stanford DASH Multiprocessor," IEEE Trans. Computers, vol. 25, no. 3, pp. 63-79, 1992.
5. Intel Corp., A Touchstone DELTA System Description. 1991.
6. Intel Corp., Paragon Network Queuing System Manual. 1993.
7. M. Noakes, D. Wallach, and W. Dally, "The J-Machine Multi-Computer: An Architectural Evaluation," Proc. Int'l Symp. Computer Architecture, pp. 224-235, 1993.
8. R. Kessler and J. Schwartzmeier, "CRAY T3D: A New Dimension for Cray Research," Proc. Compcon Spring 93, pp. 176-182, 1993.
9. K. Li and K. Cheng, "A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System," J. Parallel and Distributed Computing, vol. 12, pp. 79-83, 1991.
10. P. Chuang and N. Tzeng, "Allocating Precise Submeshes in Mesh Connected Systems," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 2, pp. 211-217, Feb. 1994.
11. J. Ding and L.N. Bhuyan, "An Adaptive Submesh Allocation for Two-Dimensional Mesh Connected Systems," Proc. 1993 Int'l Conf. Parallel Processing, vol. 2, pp. 193-200, 1993.
12. Y. Zhu, "Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers," J. Parallel and Distributed Computing, vol. 16, pp. 328-377, Dec. 1992.
13. Y. Zhu, "Fast Processor Allocation and Dynamic Scheduling for Mesh Multiprocessors," J. Computer Systems Science and Eng., vol. 11, pp. 99-107, May 1996.
14. G.M. Chiu and S.K. Chen, "An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead," IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 3, pp. 471-486, May 1999.
15. V. Gupta and A. Jayendran, "A Flexible Processor Allocation Strategy for Mesh Connected Parallel System," Proc. 1996 Int'l Conf. Parallel Processing, vol. 3, pp. 166-173, 1996.
16. W. Liu, V. Lo, K. Windisch, and B. Nitzberg, "Non-contiguous Processor Allocation Algorithms for Distributed Memory Multi-computers," Proc. ACM Int'l Conf. Supercomputing, pp. 227-236, 1994.
17. E. Smirni, C. Childers, E. Rosti, and L. Dowdy, "Thread Placement on the Intel Paragon: Modeling and Experimentation," Proc. Third Int'l Workshop Modeling, Analysis, and Simulation of Computer and Telecomm. Systems, pp. 226-231, 1995.
18. S. Chittor and R. Enbody, "Performance Degradation in Large Wormhole-Routed Interprocessor Communication Networks," Proc. 1990 Int'l Conf. Parallel Processing, vol. 1, pp. 424-428, 1990.
19. L. Kleinrock, Queuing Systems Vol. 1: Theory. Wiley-Interscience, 1975.