scholarly journals Shape-and Orientation-independent 2D-Buddy Processor Allocation Strategy in 2-D Mesh-based Multicomputers

2016 ◽  
Vol 13 (9) ◽  
pp. 682-689
Author(s):  
Othman Jabir ◽  
Saleh Oqeili ◽  
Sulieman Bani-Ahmad
Keyword(s):  
Allocation Strategy ◽  
Processor Allocation

NOVEL PIPELINING AND PROCESSOR ALLOCATION STRATEGY FOR MONOID COMPUTATIONS ON UNSHUFFLE-EXCHANGE NETWORKS

1993 ◽  
Vol 03 (02) ◽  
pp. 189-193 ◽  
Author(s):  
KUO-LIANG CHUNG ◽  
HSUN-WEN CHANG
Keyword(s):  
Short Paper ◽  
Allocation Strategy ◽  
Processor Allocation ◽  
Output Node ◽  
Exchange Networks ◽  
Processor Utilization ◽  
Single Output ◽  
Exchange Network ◽  
Hypercube Network

This short paper presents a novel pipelining and processor allocation strategy for monoid computations on an unshuffle-exchange network. In the strategy, the processor utilization is near 1 and the communication is collision-free. With the characteristics of constant connections to each processor and only a single output node on the network, the method given here can compete with the method of Barnard and Skillicorn based on a hypercube network with multiple output nodes.

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 non-contiguous processor allocation strategy for 2D mesh connected multicomputers

2007 ◽  
Vol 177 (14) ◽  
pp. 2867-2883 ◽  
Author(s):  
S. Bani-Mohammad ◽  
M. Ould-Khaoua ◽  
I. Ababneh
Keyword(s):  
Allocation Strategy ◽  
Processor Allocation

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.

AN EFFECTIVE TWO-DIMENSIONAL MESH PARTITIONING STRATEGY

1995 ◽  
Vol 05 (04) ◽  
pp. 623-634
Author(s):  
YUNG-KANG CHU ◽  
DIANE T. ROVER
Keyword(s):  
Job Characteristics ◽  
Parallel Architectures ◽  
Multiprocessor Systems ◽  
Two Dimensional ◽  
Allocation Strategy ◽  
Processor Allocation ◽  
Mean Response Time ◽  
Mesh Partitioning ◽  
Best Fit ◽  
Load Conditions

Mesh-connected parallel architectures have become increasingly popular in the design of multiprocessor systems in recent years. Many partitionable two-dimensional (2D) mesh systems have been built or are currently being developed. To allow the best usage of these systems, an effective mesh partitioning/submesh allocation strategy is desirable. In this paper, we report on a new best-fit processor allocation strategy for 2D mesh systems. An efficient implementation of this strategy is presented that keeps the searching overhead low. Extensive simulations have been performed to compare the performance of this strategy with existing ones. The results show that it outperforms existing strategies in terms of mean response time under all load conditions and different job characteristics.

Sign in / Sign up

Export Citation Format

Share Document