An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems
- 1 August 1993
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 193-200
- https://doi.org/10.1109/icpp.1993.39
Abstract
In this paper, we propose an adaptive scan (AS) strategy for submesh allocation. The earlier frame sliding (FS) strategy allocates submeshes based on fixed orientations of incoming faska. It also slides fiunaes om mesh planes by fdzed strides. Our AS a1Iocation strategy differs from the FS strategy in the following two ways: (1) it does not fiz the orientations of incoming tasks; (2) it scans on mesh planes adapfively. Experimental studies show that our AS strategy outperforms the FS strategy in terms of external fragmentation, completion time, and processor uitilizaiion.Keywords
This publication has 6 references indexed in Scilit:
- An efficient submesh allocation strategy for mesh computer systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient processor allocation strategies for mesh-connected parallel computersJournal of Parallel and Distributed Computing, 1992
- The Tera computer systemPublished by Association for Computing Machinery (ACM) ,1990
- A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected systemPublished by Association for Computing Machinery (ACM) ,1990
- Processor Allocation in an N-Cube Multiprocessor Using Gray CodesIEEE Transactions on Computers, 1987
- Evaluation of On-Chip Static Interconnection NetworksIEEE Transactions on Computers, 1987