scholarly journals Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies

2003 ◽  
Author(s):  
V.J. Leung ◽  
E.M. Arkin ◽  
Ma. Bender ◽  
D. Bunde ◽  
J. Johnston ◽  
...  
Keyword(s):  
Processor Allocation ◽  
One Dimensional ◽  
Allocation Strategies

scholarly journals Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies

2002 ◽  
Author(s):  
VITUS J LEUNG ◽  
ESTHER M ARKIN ◽  
MICHAEL A BENDER ◽  
DAVID BUNDE ◽  
JEANETTE R JOHNSTON ◽  
...  
Keyword(s):  
Processor Allocation ◽  
One Dimensional ◽  
Allocation Strategies

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

1995 ◽  
Vol 7 (5) ◽  
pp. 497-514 ◽  
Author(s):  
Bonnie E. Melhart ◽  
Craig A. Morgenstern ◽  
Tom Nute
Keyword(s):  
Two Dimensional ◽  
Processor Allocation ◽  
Allocation Strategies

A New Compacting Non-Contiguous Processor Allocation Algorithm for 2D Mesh Multicomputers

2015 ◽  
Vol 8 (4) ◽  
pp. 57-75 ◽  
Author(s):  
Saad Bani-Mohammad ◽  
Ismail M. Ababneh ◽  
Mohammad Yassen
Keyword(s):  
Performance Improvement ◽  
Communication Overhead ◽  
Allocation Strategy ◽  
Processor Allocation ◽  
Improve Performance ◽  
Simulation Experiments ◽  
Extensive Simulation ◽  
System Utilization ◽  
Selection Of ◽  
Allocation Strategies

In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is likely to increase. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Compacting Non-Contiguous Processor Allocation Strategy (CNCPA), is suggested for the 2D mesh multicomputers. In the proposed strategy, a job is compacted into free locations. The selection of the free locations has for goal leaving large free sub-meshes in the system. To evaluate the performance improvement achieved by the proposed strategy and compare it against well-known existing non-contiguous allocation strategies, the authors conducted extensive simulation experiments. The results show that the proposed strategy can improve performance in terms of job turnaround times and system utilization.

An Efficient All Shapes Busy List Processor Allocation Algorithm for 3D Mesh Multicomputers

2017 ◽  
Vol 7 (2) ◽  
pp. 10-26 ◽  
Author(s):  
Saad Bani-Mohammad
Keyword(s):  
System Performance ◽  
Turnaround Time ◽  
Allocation Strategy ◽  
Processor Allocation ◽  
3D Mesh ◽  
System Utilization ◽  
Size And Shape ◽  
Shape Constraint ◽  
Scheduling Strategies ◽  
Allocation Strategies

Contiguous processor allocation is useful for security and accounting reasons. This is due to the allocated jobs are separated from one another, where each sub-mesh of processors is allocated to an exclusive job request, and the allocated sub-mesh has the same size and shape of the requested job. The size and shape constraint leads to high processor fragmentation. Most recent contiguous allocation strategies suggested for 3D mesh-connected multiconputers try all possible orientations of an allocation request when allocation fails for the requested orientation, which reduces processor fragmentation and hence improves system performance. However, none of them considers all shapes of the request in the process of allocation. To generalize this restricted rotation, we propose, in this paper, a new contiguous allocation strategy for 3D mesh-connected multicomputers, referred to as All Shapes Busy List (ASBL for short), which takes into consideration all possible contiguous request shapes when attempting allocation for a job request. ASBL depends on the list of allocated sub-meshes, in the method suggested in (Bani-Mohammad et al., 2006), for selecting an allocated sub-mesh. The performance of the proposed ASBL allocation strategy has been evaluated considering several important scheduling strategies under a variety of system loads based on different job size distributions. The simulation results have shown that the ASBL allocation strategy improves system performance in terms of parameters such as the average turnaround time of jobs and system utilization under all scheduling strategies considered.

Corner-Boundary Processor Allocation for 3D Mesh-Connected Multicomputers

2015 ◽  
Vol 5 (1) ◽  
pp. 1-13 ◽  
Author(s):  
Ismail M. Ababneh ◽  
Saad Bani-Mohammad ◽  
Motasem Al Smadi
Keyword(s):  
System Performance ◽  
Allocation Strategy ◽  
Processor Allocation ◽  
Simulation Experiments ◽  
3D Mesh ◽  
Extensive Simulation ◽  
System Utilization ◽  
Free List ◽  
Simulation Results ◽  
Allocation Strategies

This research paper presents a new contiguous allocation strategy for 3D mesh-connected multicomputers. The proposed strategy maintains a list of maximal free sub-meshes and gives priority to allocating corner and boundary free sub-meshes. The goal of corner and boundary allocation is to decrease the number of leftover free sub-meshes and increase their sizes, which is expected to reduce processor fragmentation and improve overall system performance. The proposed strategy, which is referred to as Turning Corner-Boundary Free List (TCBFL) strategy, is compared, using extensive simulation experiments, to several existing allocation strategies for 3D meshes. These are the First-Fit (FF), Turning First-Fit Free List (TFFFL), and Turning Busy List (TBL) allocation strategies. The simulation results show that TCBFL produces average turnaround times and mean system utilization values that are superior to those of previous strategies.

Sign in / Sign up

Export Citation Format

Share Document