Dynamic partitioning in a class of parallel systems

Systems that have the capability of executing tasks with various sizes and computation structures simultaneously are considered. When some of the tasks are completed, part of the system becomes idle and is reconfigured for new tasks. Inappropriate reconfiguration strategies can create resource fragments and result in a loss of computation power. This problem can be alleviated by partitioning the system dynamically. Partitioning consists of two processes: splitting the system or a subsystem into smaller subsystems, and combining unallocated subsystems into larger subsystems. These two processes are investigated analytically for a lattice model that uses a special partial ordering relation on a set. The complexities of these two processes are also analyzed. The method can be applied to any system that can be modeled by a lattice.< >