Welcome to the InfoSci Platform
Reference Hub2
Chaotic Walk in Simulated Annealing Search Space for Task Allocation in a Multiprocessing System

Chaotic Walk in Simulated Annealing Search Space for Task Allocation in a Multiprocessing System

Ken Ferens, Darcy Cook, Witold Kinsner
Copyright: © 2013 |Volume: 7 |Issue: 3 |Pages: 22
ISSN: 1557-3958|EISSN: 1557-3966|EISBN13: 9781466633896|DOI: 10.4018/ijcini.2013070104
Cite Article Cite Article

MLA

Ferens, Ken, et al. "Chaotic Walk in Simulated Annealing Search Space for Task Allocation in a Multiprocessing System." IJCINI vol.7, no.3 2013: pp.58-79. http://doi.org/10.4018/ijcini.2013070104

APA

Ferens, K., Cook, D., & Kinsner, W. (2013). Chaotic Walk in Simulated Annealing Search Space for Task Allocation in a Multiprocessing System. International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), 7(3), 58-79. http://doi.org/10.4018/ijcini.2013070104

Chicago

Ferens, Ken, Darcy Cook, and Witold Kinsner. "Chaotic Walk in Simulated Annealing Search Space for Task Allocation in a Multiprocessing System," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) 7, no.3: 58-79. http://doi.org/10.4018/ijcini.2013070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper proposes the application of chaos in large search space problems, and suggests that this represents the next evolutionary step in the development of adaptive and intelligent systems towards cognitive machines and systems. Three different versions of chaotic simulated annealing (XSA) were applied to combinatorial optimization problems in multiprocessor task allocation. Chaotic walks in the solution space were taken to search for the global optimum or “good enough” task-to-processor allocation solutions. Chaotic variables were generated to set the number of perturbations made in each iteration of a XSA algorithm. In addition, parameters of a chaotic variable generator were adjusted to create different chaotic distributions with which to search the solution space. The results show that the convergence rate of the XSA algorithm is faster than simulated annealing when the solutions are far apart in the solution space. In particular, the XSA algorithms found simulated annealing’s best result on average about 4 times faster than simulated annealing.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.