7
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Most cited references15

          • Record: found
          • Abstract: not found
          • Article: not found

          Genetic algorithms: a survey

            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Convergence analysis of canonical genetic algorithms.

            G. Rudolph (1994)
            This paper analyzes the convergence properties of the canonical genetic algorithm (CGA) with mutation, crossover and proportional reproduction applied to static optimization problems. It is proved by means of homogeneous finite Markov chain analysis that a CGA will never converge to the global optimum regardless of the initialization, crossover, operator and objective function. But variants of CGA's that always maintain the best solution in the population, either before or after selection, are shown to converge to the global optimum due to the irreducibility property of the underlying original nonconvergent CGA. These results are discussed with respect to the schema theorem.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures

                Bookmark

                Author and article information

                Journal
                Journal of Parallel and Distributed Computing
                Journal of Parallel and Distributed Computing
                Elsevier BV
                07437315
                June 2001
                June 2001
                : 61
                : 6
                : 810-837
                Article
                10.1006/jpdc.2000.1714
                eb9818df-0b7c-4421-bb2d-4f14ae593984
                © 2001

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article