Efficient submesh allocation using interval sets

We present a new algorithm for precise submesh allocation in a mesh connected system. The algorithm utilizes a conceptually simple data structure to efficiently maintain the information needed to determine if and how the submesh requirements of a task can be satisfied. As a starting point, we build on an allocation scheme known as frame sliding introduced by Chuang and Tzeng (1991). Their scheme has better allocation performance than an earlier proposed scheme based on the buddy strategy. Our method represents an improvement over both methods in terms of run time and allocation efficiency. We present results drawn from an extensive simulation study to illustrate this.<>