409 search results - page 21 / 82 » GSA: scheduling and allocation using genetic algorithm |
ISHPC
2003
Springer
15 years 5 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
100
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—With the power consumption issue of mobile handset taken into account, Single-carrier FDMA (SC-FDMA) has been selected for 3GPP Long-Term Evolution (LTE) uplink multiple access ...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
127
click to vote
ENC
2004
IEEE
15 years 3 months ago
2004
IEEE
In this paper, we consider parallel tasks scheduling problems for hierarchical decentralized systems that consist of homogeneous computational resources such as clusters, PCs and ...
AICCSA
2007
IEEE
15 years 3 months ago
2007
IEEE
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In noncontiguous allocation, a ...