Journal of Parallel and Distributed Computing
The Stanford Dash Multiprocessor
Computer
The J-machine multicomputer: an architectural evaluation
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Fast processor allocation and dynamic scheduling for mesh multiprocessors
Computer Systems Science and Engineering
ICS '90 Proceedings of the 4th international conference on Supercomputing
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead
IEEE Transactions on Parallel and Distributed Systems
Parallel Computers Two: Architecture, Programming and Algorithms
Parallel Computers Two: Architecture, Programming and Algorithms
Non-contiguous processor allocation algorithms for distributed memory multicomputers
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Allocating Precise Submeshes in Mesh Connected Systems
IEEE Transactions on Parallel and Distributed Systems
Thread Placement on the Intel Paragon: Modeling and Experimentation
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
(R) A Flexible Processor Allocation Strategy for Mesh Connected Parallel Systems
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 3
Task migration in n-dimensional wormhole-routed mesh multicomputers
Journal of Systems Architecture: the EUROMICRO Journal
Distributed dynamic processor allocation for multicomputers
Parallel Computing
A Novel Non-exclusive Dual-Mode Architecture for MPSoCs-Oriented Network on Chip Designs
SAMOS '08 Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation
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
A fast MPI-based parallel framework for cycle-accurate HDL multi-parametric simulations
International Journal of High Performance Systems Architecture
Task migration in all-port wormhole-routed 2D mesh multicomputers
Information Sciences: an International Journal
Concurrent hybrid switching for massively parallel systems-on-chip: the CYBER architecture
Proceedings of the 9th conference on Computing Frontiers
Task allocation in mesh structure: 2side leapfrog algorithm and q-learning based algorithm
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
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
| Hi-index | 0.00 |
The mesh-connected multiprocessor has become popular for its simple and regular structure. In this paper, a new data structure, theR{\hbox{-}}{\rm{array}} , is proposed to represent the mesh at first. The element in theR{\hbox{-}}{\rm{array}}stores the statistical information about the occupied conditions of the mesh. The statistical information of theR{\hbox{-}}{\rm{array}}can direct the allocation process to jump to the processors that can serve as a base of a free submesh. Based on a simple and reasonable assumption, we develop a stochastic process to analyze the behaviors of the proposed scheme. The proposed scheme is the first one whose probabilities of locating free submeshes under different workloads are precisely computed. These results can be applied to each full-recognition scheme. In addition, the execution costs of the proposed scheme can also be accurately calculated. Finally, the simulations are performed. Compared with a lot of the previous schemes, the simulations show that the proposed schemes are faster than most of them.