A compendium of processor allocation strategies for two‐dimensional mesh connected systems

Abstract

SUMMARYMultiple processor systems are an integral part of today's high-performance computing environment. Such systems are often configured as a two-dimensional grid of processors called a mesh. Tasks compete for rectangular submeshes of this mesh. The choice of submesh allocation strategy can significantly affect the level of processor utilization and a task's waiting time. In addition, the execution speed of various allocation algorithms varies widely, which can further affect system performance. This paper describes and categorizes several submesh allocation strategies, including a previously unreported method that is superior to other methods in terms of execution speed. The paper includes results of simulation studies used to compare the performance characteristics of the most efficient allocation strategies in each category.

Distributed dynamic processor allocation for multicomputers

“…Several approaches to dealing with the processor allocation problem can be found in the literature [10][11][12][13]2,[14][15][16][17][18]. In spite of the fact that these contributions applied different policies in resource management, all schemes share one common characteristic: control of allocated resources is implemented by a global data structure localized mostly in a host machine.…”

“…In these experiments we simulated a dynamic and a static version of the distributed noncontiguous formfree Leak algorithm [23,22], and the contiguous structure preserving frame sliding (FS) [10]. The distributed Leak algorithm was described in Section 2.3.…”