Special issue : recent advances in soft computing : theories and applications

Soft Computing is an interdisciplinary area that encompasses a variety of computing paradigms. Examples of some popular soft computing paradigms include fuzzy computing, neural computing, evolutionary computing, and probabilistic computing. Soft computing paradigms, in general, aim to produce computing systems/machines that exhibit some useful properties, e.g. making inference with vague and/or ambiguous information, learning from noisy and/or incomplete data, adapting to changing environments, and reasoning with uncertainties. These properties are important for the systems/machines to be useful in assisting humans in our daily activities. Indeed, soft computing paradigms have been demonstrated to be capable of tackling a wide range of problems, e.g. optimization, decision making, information processing, pattern recognition, and intelligent data analysis. A number of papers pertaining to some recent advances in theoretical development and practical application of different soft computing paradigms are highlighted in this special issue.

GLOA : a new job scheduling algorithm for grid computing

The purpose of grid computing is to produce a virtual supercomputer by using free resources available through widespread networks such as the Internet. This resource distribution, changes in resource availability, and an unreliable communication infrastructure pose a major challenge for efficient resource allocation. Because of the geographical spread of resources and their distributed management, grid scheduling is considered to be a NP-complete problem. It has been shown that evolutionary algorithms offer good performance for grid scheduling. This article uses a new evaluation (distributed) algorithm inspired by the effect of leaders in social groups, the group leaders' optimization algorithm (GLOA), to solve the problem of scheduling independent tasks in a grid computing system. Simulation results comparing GLOA with several other evaluation algorithms show that GLOA produces shorter makespans.