Processor Allocation in the Mesh Multiprocessors Using the Leapfrog Method
IEEE Transactions on Parallel and Distributed Systems
Largest-job-first-scan-all scheduling policy for 2D mesh-connected systems
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Improving system performance in contiguous processor allocation for mesh-connected parallel systems
Journal of Systems and Software
A dynamic processor management strategy on the reconfigurable meshes
International Journal of High Performance Computing and Networking
Flexible DOR routing for virtualization of multicore chips
SOC'09 Proceedings of the 11th international conference on System-on-chip
Routing-contained virtualization based on Up*/Down* forwarding
HiPC'07 Proceedings of the 14th international conference on High performance computing
Comparison of allocation algorithms in mesh oriented structures for different scheduling techniques
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
An efficient, low-cost routing framework for convex mesh partitions to support virtualization
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Wireless Health Systems, On-Chip and Off-Chip Network Architectures
RISO: relaxed network-on-chip isolation for cloud processors
Proceedings of the 50th Annual Design Automation Conference
| Hi-index | 0.00 |
Abstract: Large mesh connected parallel systems callow multiple applications to run simultaneously on distinct, non-overlapping sub-meshes. This improves overall efficiency, since few (if any) individual applications can effectively use all of the available processors. The sub-mesh allocation strategy forms a crucial component in such systems and affects many performance criteria including system throughput, processor utilization, and application turnaround time. We propose a new sub-mesh allocation strategy called flexfold. When a request for an a/spl times/b sub-mesh arrives, flexfold first searches for a/spl times/b and b/spl times/a sub-meshes, as expected. If appropriate, it may additionally search for a/2/spl times/2b, 2a/spl times/b/2, 2b/spl times/a/2, and b/2/spl times/2a sub-meshes. At the expense of sometimes increasing their execution time, flexfold accommodates incoming applications earlier than other strategies. Simulation results indicate that a simple test suffices to determine when this trade-off is beneficial and flexfold achieves better overall performance compared to other algorithms. Flexfold is completely transparent to the application programmer and does not require additional architectural support beyond what already exists.