This thesis proposes a submesh allocation algorithm that has complete submesh recognition capability. It uses a novel function, called the reservation factor to evaluate possible candidate free submeshes. By using reservation factor as the best-fit criteria to determine the best possible candidate for an incoming request, the algorithm achieves better results than all the previously proposed algorithms. --Abstract, page iii
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
Processor allocation and task scheduling are two important aspects of partitionable multiprocessor s...
[[abstract]]We propose a new processor allocation strategy that applies to any mesh system and recog...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
In this article we describe and compare several recently proposed algorithms for precise submesh all...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Abstract-Until now, several continuous and discontinuous techniques have been given for processor al...
We consider the problem of subsystem allocation in the mesh, torus, and hypercube multicomputers. Al...
Efficient allocation of distinct subsets of processors to different jobs (i.e., space sharing) is cr...
[[abstract]]Fully recognizing various subcubes in a hypercube computer efficiently is addressed. A m...
Abstract—Many of the proposed algorithms for allocating processors to jobs in supercomputers choose ...
Current processor allocation techniques for highly parallel systems are typically restricted to cont...
Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation a...
[[sponsorship]]Institute of Electrical and Electronics Engineers[[notice]]待補頁數[[conferencetype]]國內[[...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
Processor allocation and task scheduling are two important aspects of partitionable multiprocessor s...
[[abstract]]We propose a new processor allocation strategy that applies to any mesh system and recog...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
In this article we describe and compare several recently proposed algorithms for precise submesh all...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Abstract-Until now, several continuous and discontinuous techniques have been given for processor al...
We consider the problem of subsystem allocation in the mesh, torus, and hypercube multicomputers. Al...
Efficient allocation of distinct subsets of processors to different jobs (i.e., space sharing) is cr...
[[abstract]]Fully recognizing various subcubes in a hypercube computer efficiently is addressed. A m...
Abstract—Many of the proposed algorithms for allocating processors to jobs in supercomputers choose ...
Current processor allocation techniques for highly parallel systems are typically restricted to cont...
Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation a...
[[sponsorship]]Institute of Electrical and Electronics Engineers[[notice]]待補頁數[[conferencetype]]國內[[...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
Processor allocation and task scheduling are two important aspects of partitionable multiprocessor s...