4,526 research outputs found
Artificial bee colony-inspired run-time task management for many-core systems
Efficient resource and application management is one of the most complex and challenging tasks in high performance computing. Large-scale computing systems that contain hundreds, thousands or even millions of cores demand solutions that can operate in a distributed, robust, and scalable fashion. However, while hardware parallelism is relatively straight forward to achieve, this is not generally the case for software. This leads to under-utilization of the hardware parallelism as well as imbalanced load distribution causing inefficiency and hotspots. In response to this challenge, this paper introduces a novel distributed and decentralized run-time management algorithm. The proposed method is guided by an optimization model inspired by artificial bee colonies (ABC). While ABC have proven useful for optimizing large sets of numerical test functions, this is the first time they are applied in the context of many-core system management. The initial result shows that, the ABC model is promising in context of run-time management for many-core systems. It is also anticipated that the algorithms bio-inspired foundations will inherently enable scalability, reliability, and adaptation. We are showing initial experiments, where the initial results indicate the capability of our model to improve the thermal distribution across the system
Memetic Artificial Bee Colony Algorithm for Large-Scale Global Optimization
Memetic computation (MC) has emerged recently as a new paradigm of efficient
algorithms for solving the hardest optimization problems. On the other hand,
artificial bees colony (ABC) algorithms demonstrate good performances when
solving continuous and combinatorial optimization problems. This study tries to
use these technologies under the same roof. As a result, a memetic ABC (MABC)
algorithm has been developed that is hybridized with two local search
heuristics: the Nelder-Mead algorithm (NMA) and the random walk with direction
exploitation (RWDE). The former is attended more towards exploration, while the
latter more towards exploitation of the search space. The stochastic adaptation
rule was employed in order to control the balancing between exploration and
exploitation. This MABC algorithm was applied to a Special suite on Large Scale
Continuous Global Optimization at the 2012 IEEE Congress on Evolutionary
Computation. The obtained results the MABC are comparable with the results of
DECC-G, DECC-G*, and MLCC.Comment: CONFERENCE: IEEE Congress on Evolutionary Computation, Brisbane,
Australia, 201
Recommended from our members
Personal mobile grids with a honeybee inspired resource scheduler
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The overall aim of the thesis has been to introduce Personal Mobile Grids (PMGrids)
as a novel paradigm in grid computing that scales grid infrastructures to mobile devices and extends grid entities to individual personal users. In this thesis, architectural designs as well as simulation models for PM-Grids are developed.
The core of any grid system is its resource scheduler. However, virtually all current conventional grid schedulers do not address the non-clairvoyant scheduling problem, where job information is not available before the end of execution. Therefore, this thesis proposes a honeybee inspired resource scheduling heuristic for PM-Grids (HoPe) incorporating a radical approach to grid resource scheduling to tackle this problem. A detailed design and implementation of HoPe with a decentralised self-management and adaptive policy are initiated.
Among the other main contributions are a comprehensive taxonomy of grid systems as well as a detailed analysis of the honeybee colony and its nectar acquisition process (NAP), from the resource scheduling perspective, which have not been presented in any previous work, to the best of our knowledge.
PM-Grid designs and HoPe implementation were evaluated thoroughly through a strictly controlled empirical evaluation framework with a well-established heuristic in high throughput computing, the opportunistic scheduling heuristic (OSH), as a benchmark algorithm. Comparisons with optimal values and worst bounds are conducted to gain a clear insight into HoPe behaviour, in terms of stability, throughput, turnaround time and speedup, under different running conditions of number of jobs and grid scales.
Experimental results demonstrate the superiority of HoPe performance where it
has successfully maintained optimum stability and throughput in more than 95%
of the experiments, with HoPe achieving three times better than the OSH under
extremely heavy loads. Regarding the turnaround time and speedup, HoPe has
effectively achieved less than 50% of the turnaround time incurred by the OSH, while doubling its speedup in more than 60% of the experiments.
These results indicate the potential of both PM-Grids and HoPe in realising futuristic grid visions. Therefore considering the deployment of PM-Grids in real life scenarios and the utilisation of HoPe in other parallel processing and high throughput computing systems are recommended
Hybrid scheduling algorithms in cloud computing: a review
Cloud computing is one of the emerging fields in computer science due to its several advancements like on-demand processing, resource sharing, and pay per use. There are several cloud computing issues like security, quality of service (QoS) management, data center energy consumption, and scaling. Scheduling is one of the several challenging problems in cloud computing, where several tasks need to be assigned to resources to optimize the quality of service parameters. Scheduling is a well-known NP-hard problem in cloud computing. This will require a suitable scheduling algorithm. Several heuristics and meta-heuristics algorithms were proposed for scheduling the user's task to the resources available in cloud computing in an optimal way. Hybrid scheduling algorithms have become popular in cloud computing. In this paper, we reviewed the hybrid algorithms, which are the combinations of two or more algorithms, used for scheduling in cloud computing. The basic idea behind the hybridization of the algorithm is to take useful features of the used algorithms. This article also classifies the hybrid algorithms and analyzes their objectives, quality of service (QoS) parameters, and future directions for hybrid scheduling algorithms
Scheduling Problems
Scheduling is defined as the process of assigning operations to resources over time to optimize a criterion. Problems with scheduling comprise both a set of resources and a set of a consumers. As such, managing scheduling problems involves managing the use of resources by several consumers. This book presents some new applications and trends related to task and data scheduling. In particular, chapters focus on data science, big data, high-performance computing, and Cloud computing environments. In addition, this book presents novel algorithms and literature reviews that will guide current and new researchers who work with load balancing, scheduling, and allocation problems
Victoria Amazonica Optimization (VAO): An Algorithm Inspired by the Giant Water Lily Plant
The Victoria Amazonica plant, often known as the Giant Water Lily, has the
largest floating spherical leaf in the world, with a maximum leaf diameter of 3
meters. It spreads its leaves by the force of its spines and creates a large
shadow underneath, killing any plants that require sunlight. These water
tyrants use their formidable spines to compel each other to the surface and
increase their strength to grab more space from the surface. As they spread
throughout the pond or basin, with the earliest-growing leaves having more room
to grow, each leaf gains a unique size. Its flowers are transsexual and when
they bloom, Cyclocephala beetles are responsible for the pollination process,
being attracted to the scent of the female flower. After entering the flower,
the beetle becomes covered with pollen and transfers it to another flower for
fertilization. After the beetle leaves, the flower turns into a male and
changes color from white to pink. The male flower dies and sinks into the
water, releasing its seed to help create a new generation. In this paper, the
mathematical life cycle of this magnificent plant is introduced, and each leaf
and blossom are treated as a single entity. The proposed bio-inspired algorithm
is tested with 24 benchmark optimization test functions, such as Ackley, and
compared to ten other famous algorithms, including the Genetic Algorithm. The
proposed algorithm is tested on 10 optimization problems: Minimum Spanning
Tree, Hub Location Allocation, Quadratic Assignment, Clustering, Feature
Selection, Regression, Economic Dispatching, Parallel Machine Scheduling, Color
Quantization, and Image Segmentation and compared to traditional and
bio-inspired algorithms. Overall, the performance of the algorithm in all tasks
is satisfactory.Comment: 45 page
Classification and Performance Study of Task Scheduling Algorithms in Cloud Computing Environment
Cloud computing is becoming very common in recent years and is growing rapidly due to its attractive benefits and features such as resource pooling, accessibility, availability, scalability, reliability, cost saving, security, flexibility, on-demand services, pay-per-use services, use from anywhere, quality of service, resilience, etc. With this rapid growth of cloud computing, there may exist too many users that require services or need to execute their tasks simultaneously by resources provided by service providers. To get these services with the best performance, and minimum cost, response time, makespan, effective use of resources, etc. an intelligent and efficient task scheduling technique is required and considered as one of the main and essential issues in the cloud computing environment. It is necessary for allocating tasks to the proper cloud resources and optimizing the overall system performance. To this end, researchers put huge efforts to develop several classes of scheduling algorithms to be suitable for the various computing environments and to satisfy the needs of the various types of individuals and organizations. This research article provides a classification of proposed scheduling strategies and developed algorithms in cloud computing environment along with the evaluation of their performance. A comparison of the performance of these algorithms with existing ones is also given. Additionally, the future research work in the reviewed articles (if available) is also pointed out. This research work includes a review of 88 task scheduling algorithms in cloud computing environment distributed over the seven scheduling classes suggested in this study. Each article deals with a novel scheduling technique and the performance improvement it introduces compared with previously existing task scheduling algorithms. Keywords: Cloud computing, Task scheduling, Load balancing, Makespan, Energy-aware, Turnaround time, Response time, Cost of task, QoS, Multi-objective. DOI: 10.7176/IKM/12-5-03 Publication date:September 30th 2022
- …