In this article we describe and compare several recently proposed algorithms for precise submesh allocation in a two-dimensional mesh connected system. The methods surveyed include various frame sliding strategies, the maximum boundary value heuristic, and interval set scan techniques. In addition, a new enhancement to the interval set scan method is described. This enhancement results in an algorithm that has better allocation and run-time performance under a FCFS scheduling policy than any of the other proposed methods. We present results drawn from an extensive simulation study to illustrate the relative efficiency of the various methods
Multilevel algorithms are a successful class of optimisation techniques which address the mesh parti...
Efficient allocation of distinct subsets of processors to different jobs (i.e., space sharing) is cr...
We study streaming algorithms for the interval selection problem: finding a maximum car-dinality sub...
[[abstract]]We propose a new processor allocation strategy that applies to any mesh system and recog...
This thesis proposes a submesh allocation algorithm that has complete submesh recognition capability...
[[sponsorship]]Institute of Electrical and Electronics Engineers[[notice]]待補頁數[[conferencetype]]國內[[...
We consider the problem of subsystem allocation in the mesh, torus, and hypercube multicomputers. Al...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Abstract. The performance of contiguous allocation strategies can be significantly affected by the d...
The performance of contiguous allocation strategies can be significantly affected by the type of the...
The performance of contiguous allocation strategies can be significantly affected by the distributio...
Abstract-Until now, several continuous and discontinuous techniques have been given for processor al...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Abstract. The performance of contiguous allocation strategies can be significantly affected by the d...
Multilevel algorithms are a successful class of optimisation techniques which address the mesh parti...
Efficient allocation of distinct subsets of processors to different jobs (i.e., space sharing) is cr...
We study streaming algorithms for the interval selection problem: finding a maximum car-dinality sub...
[[abstract]]We propose a new processor allocation strategy that applies to any mesh system and recog...
This thesis proposes a submesh allocation algorithm that has complete submesh recognition capability...
[[sponsorship]]Institute of Electrical and Electronics Engineers[[notice]]待補頁數[[conferencetype]]國內[[...
We consider the problem of subsystem allocation in the mesh, torus, and hypercube multicomputers. Al...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Abstract. The performance of contiguous allocation strategies can be significantly affected by the d...
The performance of contiguous allocation strategies can be significantly affected by the type of the...
The performance of contiguous allocation strategies can be significantly affected by the distributio...
Abstract-Until now, several continuous and discontinuous techniques have been given for processor al...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Abstract. The performance of contiguous allocation strategies can be significantly affected by the d...
Multilevel algorithms are a successful class of optimisation techniques which address the mesh parti...
Efficient allocation of distinct subsets of processors to different jobs (i.e., space sharing) is cr...
We study streaming algorithms for the interval selection problem: finding a maximum car-dinality sub...