Processor Allocation Using Partitioning in Mesh Connected Parallel Computers

✍ Scribed by Prasant Mohapatra

• Publisher: Elsevier Science
• Year: 1996
• Tongue: English
• Weight: 326 KB
• Volume: 39
• Category: Article
• ISSN: 0743-7315
• DOI: 10.1006/jpdc.1996.0165

✦ Synopsis

Several processor allocation schemes for mesh connected parallel computers have been proposed in the literature. These schemes aim at improving system performance by reducing internal fragmentation or by enhancing submesh recognition ability. In this paper, we propose a system partitioning approach to reduce external fragmentation and thereby improve system performance. The target systems considered here are two-dimensional meshes where the side lengths are powers of 2. Processors are allocated to a partitioned mesh based on their submesh size requirements. The proposed scheme can be implemented in conjunction with any of the existing processor allocation schemes and thereby can also exploit the advantages offered by those schemes. The performance measurements are done through simulation experiments. Completion time for a fixed number of jobs, internal and external fragmentation, and system utilization are measured as performance indicators. It is observed that, in most cases, the proposed scheme demonstrates better performance than the previously proposed algorithms. Time complexity of the proposed scheme is less by a factor of n than the corresponding allocation scheme without partitioning, where n ‫؍‬ log 2 ͕min(w, h)͖, and w and h are the width and height of a two-dimensional mesh.