Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Multi-installment divisible load processing in heterogeneous systems with limited memory

Authors

[ 1 ] Instytut Fizyki, Wydział Fizyki Technicznej, Politechnika Poznańska | [ P ] employee

Year of publication

2006

Chapter type

paper

Publication language

english

Abstract

EN Optimum divisible load processing in heterogeneous star system with limited memory is studied. We propose two algorithms to find multi-installment load distribution: Exact branch-and-bound algorithm and a heuristic using genetic search method. Characteristic features of the solutions and the performance of the algorithms are examined in a set of computational experiments.

Pages (from - to)

847 - 854

DOI

10.1007/11752578_102

URL

https://link.springer.com/chapter/10.1007/11752578_102

Book

Parallel Processing and Applied Mathematics : 6th International Conference, PPAM 2005, Poznań, Poland, September 11-14, 2005, Revised Selected Papers

Presented on

6th International Conference on Parallel Processing and Applied Mathematics, PPAM 2005, 11-14.09.2005, Poznań, Polska

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.