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

Ababneh, Ismail; Bani-Mohammad, Saad; Smadi, Motasem Al

doi:10.4018/ijcac.2015010101

Cited by 8 publications

(11 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…x y z , where 0 ≤ < x W , 0 ≤ < y D and 0 ≤ < z H . The size of the mesh, N , is the number of processors it has, where N WDH = (Ababneh et al, 2015;Bani-Mohammad et al, 2006). The following definitions have been adopted from (Chiu & Chen, 1999;Ababneh et al, 2010;Bani-Mohammad et al, 2006).…”

Section: Preliminariesmentioning

confidence: 99%

“…The previous contiguous allocation strategies suggested for 3D mesh multicomputers (Choo et al, 2000;Ababneh, 2001;Ababneh et al, 2015;Bani-Mohammad et al, 2006) differ in their ability to identify free sub-meshes, and in the method used for choosing an allocated sub-mesh. In these allocation strategies, it is normally assumed that an incoming job makes a request for the allocation of some α β γ × × free sub-mesh.…”

Section: Previous Allocation Strategiesmentioning

confidence: 99%

“…In distributed memory multicomputers, separate contiguous processor sub-meshes are assigned to jobs for the duration of their execution (Yoo & Das, 2002;Ababneh, 2006;Ababneh, 2001;Ababneh, 2009;Ababneh et al, 2015;Ababneh et al, 2010;Bani-Mohammad et al, 2006;Bani-Mohammad et al, 2007b;Bani-Mohammad et al, 2009;Zhu, 1992). Both two-dimensional (2D) and three-dimensional (3D) meshes and tori have been utilized in recent experimental and commercial multicomputers.…”

mentioning

confidence: 99%

“…The vast majority of the existing processor allocation strategies use contiguous sub-mesh allocation (Yoo & Das, 2002;Sharma & Pradhan, 1996;Gabrani & Mulkar, 2005;Kim & Yoon, 1998;Chiu & Chen, 1999;Choo et al, 2000;Ababneh, 2006;Ababneh, 2001;Ababneh, 2009;Ababneh et al, 2015;Ababneh et al, 2010;Bani-Mohammad et al, 2006;Bani-Mohammad et al, 2007b;Bani-Mohammad et al, 2009;Zhu, 1992), where a distinct contiguous sub-mesh of processors is allocated to a parallel job for the duration of its execution. This can lead to high external processor fragmentation that happens when the processor allocation strategy cannot allocate available sub-mesh of processors to an incoming job because the available processors are not contiguous or they do not have the same topology as the interconnection system network.…”

mentioning

confidence: 99%

“…The latest contiguous allocation strategies proposed for 3D mesh multiconputers (Choo et al, 2000;Ababneh, 2001;Ababneh et al, 2015;Bani-Mohammad et al, 2006) try all orientations of the job request when allocation fails for the original job request, which decreases processor fragmentation and consequently improves system performance. Let ( , , ) α β γ be the width, depth and height of a sub-mesh allocation request.…”

mentioning

confidence: 99%

See 4 more Smart Citations

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

Bani-Mohammad

2017

International Journal of Cloud Applications and Computing

Self Cite

View full text Add to dashboard Cite

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.

show abstract