Abstract
Partitioning-Based (RPB) allocation schemes remedy the problem of fragmentation by allowing parallel requests to be allocated non-contiguously in case contiguous allocation fails. Two RPB allocation schemes are proposed in literature; the Adaptive Non-Contiguous Allocation (ANCA) and the Bounded-Gradual-Partitioning (BGP) allocation. In ANCA, the frame requested by the parallel job is subdivided into two subframes of equal sizes at the longest dimension of the request. In BGP, requests are gradually partitioned into one large and another small subframe of multicomputers. In this paper, ANCA and BGP based allocation strategies are comparatively evaluated through exhaustive simulation-based experiments. Our experimental results also showed that the ANCA scheme can sustain higher system and communication loads compared to BGP in terms of major system performance metrics. We also observed that, in the BGP approach, increasing the partitioning bound value can slightly improve the performance of the parallel system. Comparatively, increasing the partitioning bound in the ANCA approach could significantly improve the performance of the parallel system.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
