Dynamic partitioning of large multicomputer systems

We consider multiprogramming operation in large scale grid-connected multicomputer systems where the grid is spatially partitioned among the programs. We regard the problem as a two-dimensional resource allocation problem for which different algorithms are proposed. Results from simulation experiments indicate the performance that can be achieved in terms of fragmentation and throughput.<
>