For an allocation request, the strategy selects the best-fit submesh which causes the least amount of potential processor fragmentation. As many large free submeshes as possible are preserved for later allocations. For this purpose, we introduce a novel function quantifying the degree of potential fragmentation of submeshes. The proposed strategy has the capability of recognizing a complete submesh. We also propose an allocation strategy for faulty meshes which can maintain and allocate virtual submeshes derived from faulty submeshes.
Extensive simulation is carried out to compare the proposed strategy with previous strategies.
All Rights Reserved. The full text of is available to members of the IEEE Computer Society who have an online subscription and an e-account .