An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems

Ding, Jiachen; Bhuyan, Laxmi N.

doi:10.1109/icpp.1993.39

Cited by 107 publications

(78 citation statements)

References 7 publications

(3 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A similar approach is also proposed by Chmaj et al (2004), Yoo and Das (2002) as well as Ding and Bhuyan (1993). As in the IFF case, the IAS is based on the fact that for any job J none of the nodes inside C J ∪ R J can serve as the base.…”

Section: Improved Adaptive Scan (Ias)mentioning

confidence: 99%

Energy characteristic of a processor allocator and a network-on-chip

Zydek

Selvaraj

Borowik

et al. 2011

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

Energy consumption in a Chip MultiProcessor (CMP) is one of the most important costs. It is related to design aspects such as thermal and power constrains. Besides efficient on-chip processing elements, a well-designed Processor Allocator (PA) and a Network-on-Chip (NoC) are also important factors in the energy budget of novel CMPs. In this paper, the authors propose an energy model for NoCs with 2D-mesh and 2D-torus topologies. All important NoC architectures are described and discussed. Energy estimation is presented for PAs. The estimation is based on synthesis results for PAs targeting FPGA. The PAs are driven by allocation algorithms that are studied as well. The proposed energy model is employed in a simulation environment, where exhaustive experiments are performed. Simulation results show that a PA with an IFF allocation algorithm for mesh systems and a torus-based NoC with express-virtual-channel flow control are very energy efficient. Combination of these two solutions is a clear choice for modern CMPs.

show abstract

Section: Improved Adaptive Scan (Ias)mentioning

confidence: 99%

Energy characteristic of a processor allocator and a network-on-chip

Zydek

Selvaraj

Borowik

et al. 2011

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

show abstract

“…However, the main problem of this approach is the lower system utilization, since an application has to wait for a properly sized and shaped contiguous sub-mesh, while there may be sufficient number of free processors in non-contiguous regions. Scientists have extensively investigated contiguous allocation for twodimensional (2D) mesh multicomputer [10][11][12][13]. In most previous studies, they have focused on reducing the effects of external fragmentation that are caused by the contiguous allocation strategies.…”

Section: Processor Allocationmentioning

confidence: 99%

“…Each node of mesh is a processor that is known with the address of its characteristics [9]. A node in column c and row r has the coordinate of <c, r> where ≤ c < and ≤ r < .…”

Section: Definitionsmentioning

confidence: 99%

“…In most previous studies, they have focused on reducing the effects of external fragmentation that are caused by the contiguous allocation strategies. Hereinafter, contiguous processor allocation schemes include a wide range of methods such as stack-based allocation [14,15], adjacency allocation [15], adaptive scan allocation [12], and best/first fit allocation [13,16].…”

Section: Processor Allocationmentioning

confidence: 99%

See 1 more Smart Citation

Performance Improvement in Multiprocessors using Two Row Boundary Allocation Method and Online Dynamic Compaction Algorithm

Reza¹,

Rafie²

2015

IJCA

View full text Add to dashboard Cite

In this paper, two row boundary (TRB) allocation algorithm and limited top-down compaction (LT-DC) migration method are proposed. The first scheme, attempts to allocate the free nodes in the center of the mesh and decrease the problem of external fragmentation. The next mechanism use task migration to improve the performance of existing sub-mesh allocation strategies. It should be noted that in this process three key metrics are considered. They are average execution time, average response time, and average wait time. In fact, we perform rigorous simulation experiments based on practical workloads as reported in the literature to quantify all our proposed schemes and compare them against standard schemes existing in the literature. Based on the results, we make clear recommendations on the choice of the strategies. General TermsNetwork on Chip

show abstract

“…The adaptive-scan [11] changes the orientation of the submesh being searched for if the required submesh in the original orientation is not available. Thus, the AS strategy has better recognition capabilities than that of the BS and FF schemes.…”

Section: Adaptive-scan (As) Schemementioning

confidence: 99%

Comparative Evaluation of RequestPartitioningbased Processor Allocation Strategies in 2D Meshbased Multicomputers

Bani‐Ahmad¹

2011

IJCA

View full text Add to dashboard Cite

Request-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.

show abstract

An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems

Cited by 107 publications

References 7 publications

Energy characteristic of a processor allocator and a network-on-chip

Energy characteristic of a processor allocator and a network-on-chip

Performance Improvement in Multiprocessors using Two Row Boundary Allocation Method and Online Dynamic Compaction Algorithm

Comparative Evaluation of RequestPartitioningbased Processor Allocation Strategies in 2D Meshbased Multicomputers

Contact Info

Product

Resources

About