[[abstract]]We propose a new processor allocation strategy that applies to any mesh system and recognizes submeshes of arbitrary sizes at any locations in a mesh system. The proposed strategy allocates a submesh of exactly the size requested by an incoming task, completely avoiding internal fragmentation. Because of its efficient allocation, this strategy exhibits better performance than an earlier allocation strategy based on the buddy principle. An efficient implementation of this strategy is presented. Extensive simulation runs are carried out to collect experimental cost and performance measures of interest under different allocation schemes[[booktype]]電子
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with ...
[[sponsorship]]Institute of Electrical and Electronics Engineers[[notice]]待補頁數[[conferencetype]]國內[[...
Abstract Efficient processor allocation and job scheduling algorithms are critical if the full compu...
This thesis proposes a submesh allocation algorithm that has complete submesh recognition capability...
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...
Current processor allocation techniques for highly parallel systems are typically restricted to cont...
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...
Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation a...
In this article we describe and compare several recently proposed algorithms for precise submesh all...
Efficient allocation of distinct subsets of processors to different jobs (i.e., space sharing) is cr...
Processor allocation and task scheduling are two important aspects of partitionable multiprocessor s...
Processor allocation and task scheduling are two important aspects of partitionable multiprocessor s...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with ...
[[sponsorship]]Institute of Electrical and Electronics Engineers[[notice]]待補頁數[[conferencetype]]國內[[...
Abstract Efficient processor allocation and job scheduling algorithms are critical if the full compu...
This thesis proposes a submesh allocation algorithm that has complete submesh recognition capability...
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...
Current processor allocation techniques for highly parallel systems are typically restricted to cont...
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...
Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation a...
In this article we describe and compare several recently proposed algorithms for precise submesh all...
Efficient allocation of distinct subsets of processors to different jobs (i.e., space sharing) is cr...
Processor allocation and task scheduling are two important aspects of partitionable multiprocessor s...
Processor allocation and task scheduling are two important aspects of partitionable multiprocessor s...
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: conti...
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with ...
[[sponsorship]]Institute of Electrical and Electronics Engineers[[notice]]待補頁數[[conferencetype]]國內[[...
Abstract Efficient processor allocation and job scheduling algorithms are critical if the full compu...