Multiple Wirelessly Powered Sensing Platform Scheduling Algorithm Based on Dynamic Priority Preemption

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Zhijun Xie ◽  
Tao Zhang ◽  
Chenlu Wang ◽  
Jiancheng Yu ◽  
Roozbeh Zarei
Keyword(s):  
Execution Time ◽  
Energy Intensity ◽  
Scheduling Algorithm ◽  
Allocation Policy ◽  
Dynamic Task ◽  
Sensing System ◽  
Available Energy ◽  
Sensing Platform ◽  
Priority Allocation ◽  
Execution Order

The available energy of a wirelessly powered sensing platform is not enough, and there are constant real-time tasks to join the wirelessly powered sensing platform to run. So the wirelessly powered sensing system composed of many wirelessly powered sensing platforms is easy to enter the overloaded state, which may cause some tasks not to be executed on time. Therefore, to obtain as much task value as possible for the wirelessly powered sensing system when it is under the overloaded state, it is essential to design a reasonable task scheduling algorithm to arrange the task execution order. In this paper, we propose a policy named Wirelessly Dynamic Allocation Priority (WDAP) policy suitable for the wirelessly powered sensing system. The proposed WDAP is divided into a dynamic task priority allocation policy and a dynamic node priority allocation policy. Firstly, this paper analyzes the dynamic value density based on task value and execution time, studies the urgency of execution according to the execution time and the remaining idle time, and proposes the energy intensity through the task energy consumption and execution time. Based on the three impact factors of dynamic value density, urgency, and energy intensity, a policy for dynamic task priority allocation is proposed. Then, a policy for dynamic node priority allocation is proposed by combining the available energy and the energy acquisition speed of the nodes. Finally, the algorithm suitable for the wirelessly powered sensing system is proposed named Wirelessly Dynamic Real-time Task Scheduling (WDRTS) algorithm based on the WDAP. The algorithm clarifies the execution order of each task, responds to high-priority tasks first, and effectively guarantees task benefits. The experimental results show that compared with the main algorithms used in the literature among which is Generalized Earliest Deadline First, the WDRTS algorithm reduces the number of preemptive tasks by at least 36.49% and increases the successful scheduling rate of tasks by at least 15.17% and the overall system task income by at least 16.37% under high load.

High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem

2016 ◽  
Vol 8 (4) ◽  
pp. 55-77 ◽  
Author(s):  
Vianney Kengne Tchendji ◽  
Jean Frederic Myoupo ◽  
Gilles Dequen
Keyword(s):  
Parallel Algorithms ◽  
Execution Time ◽  
High Performance ◽  
Scheduling Algorithm ◽  
Search Tree ◽  
Binary Search ◽  
Coarse Grained ◽  
Binary Search Tree ◽  
Parameter Dependent ◽  
The Impact

In this paper, the authors highlight the existence of close relations between the execution time, efficiency and number of communication rounds in a family of CGM-based parallel algorithms for the optimal binary search tree problem (OBST). In this case, these three parameters cannot be simultaneously improved. The family of CGM (Coarse Grained Multicomputer) algorithms they derive is based on Knuth's sequential solution running in time and space, where n is the size of the problem. These CGM algorithms use p processors, each with local memory. In general, the authors show that each algorithms runs in with communications rounds. is the granularity of their model, and is a parameter that depends on and . The special case of yields a load-balanced CGM-based parallel algorithm with communication rounds and execution steps. Alternately, if , they obtain another algorithm with better execution time, say , the absence of any load-balancing and communication rounds, i.e., not better than the first algorithm. The authors show that the granularity has a crucial role in the different techniques they use to partition the problem to solve and study the impact of each scheduling algorithm. To the best of their knowledge, this is the first unified method to derive a set of parameter-dependent CGM-based parallel algorithms for the OBST problem.

scholarly journals Dynamic Job Scheduling Strategy Using Jobs Characteristics in Cloud Computing

Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1638 ◽  
Author(s):  
Mohammed A. Alsaih ◽  
Rohaya Latip ◽  
Azizol Abdullah ◽  
Shamala K. Subramaniam ◽  
Kamal Ali Alezabi
Keyword(s):  
Execution Time ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Job Characteristics ◽  
Available Bandwidth ◽  
Scheduling Strategy ◽  
Cloud Users ◽  
Performance Variations ◽  
Available Resources

A crucial performance concern in distributed decentralized environments, like clouds, is how to guarantee that jobs complete their execution within the estimated completion times using the available resources’ bandwidth fairly and efficiently while considering the resource performance variations. Formerly, several models including reservation, migration, and replication heuristics have been implemented to solve this concern under a variety of scheduling techniques; however, they have some undetermined obstacles. This paper proposes a dynamic job scheduling model (DTSCA) that uses job characteristics to map them to resources with minimum execution time taking into account utilizing the available resources bandwidth fairly to satisfy the cloud users quality of service (QoS) requirements and utilize the providers’ resources efficiently. The scheduling algorithm makes use of job characteristics (length, expected execution time, expected bandwidth) with regards to available symmetrical and non-symmetrical resources characteristics (CPU, memory, and available bandwidth). This scheduling strategy is based on generating an expectation value for each job that is proportional to how these job’s characteristics are related to all other jobs in total. That should make their virtual machine choice closer to their expectation, thus fairer. It also builds a feedback method which deals with reallocation of failed jobs that do not meet the mapping criteria.

scholarly journals Energy Intensity and Human Mobility after the Anthropocene

2020 ◽  
Vol 12 (6) ◽  
pp. 2376 ◽  
Author(s):  
J. Mohorčich
Keyword(s):  
Energy Intensity ◽  
Human Mobility ◽  
Human Settlements ◽  
Transportation Mode ◽  
Electric Cars ◽  
Available Energy ◽  
Energy Constrained ◽  
Mode Of Transportation ◽  
Settlement Size ◽  
Transportation Mode Choice

After the Anthropocene, human settlements will likely have less available energy to move people and things. This paper considers the feasibility of five modes of transportation under two energy-constrained scenarios. It analyzes the effects transportation mode choice is likely to have on the size of post-Anthropocene human settlements, as well as the role speed and energy play in such considerations. I find that cars, including battery-electric cars, are not feasible under a highly energy-constrained scenario, that buses, metros, and walking are feasible but will limit human settlement size, and that cycling is likely the only mode of transportation that would make suburbs possible in an energy-constrained post-Anthropocene scenario.

A Novel Approach in Scheduling Of the Real- Time Tasks In Heterogeneous Multicore Processor with Fuzzy Logic Technique For Micro-grid Power Management

2018 ◽  
Vol 9 (1) ◽  
pp. 80
Author(s):  
Lavanya Dhanesh ◽  
P. Murugesan
Keyword(s):  
Fuzzy Logic ◽  
Real Time ◽  
Power Management ◽  
Execution Time ◽  
High Performance ◽  
Scheduling Algorithm ◽  
Multicore Processor ◽  
Heterogeneous Multicore ◽  
Micro Grid ◽  
Low Performance

Scheduling of tasks based on real time requirement is a major issue in the heterogeneous multicore systemsfor micro-grid power management . Heterogeneous multicore processor schedules the serial tasks in the high performance core and parallel tasks are executed on the low performance cores. The aim of this paper is to implement a scheduling algorithm based on fuzzy logic for heterogeneous multicore processor for effective micro-grid application. Real – time tasks generally have different execution time and dead line. The main idea is to use two fuzzy logic based scheduling algorithm, first is to assign priority based on execution time and deadline of the task. Second , the task which has assigned higher priority get allotted for execution in high performance core and remaining tasks which are assigned low priority get allotted in low performance cores. The main objective of this scheduling algorithm is to increase the throughput and to improve CPU utilization there by reducing the overall power consumption of the micro-grid power management systems. Test cases with different task execution time and deadline were generated to evaluate the algorithms using  MATLAB software.

Based on Improved Genetic Algorithm for Task Scheduling of Heterogeneous Multi-Core Processor

2014 ◽  
Vol 1030-1032 ◽  
pp. 1671-1675
Author(s):  
Yue Qiu ◽  
Jing Feng Zang
Keyword(s):  
Genetic Algorithm ◽  
Task Scheduling ◽  
Execution Time ◽  
Scheduling Algorithm ◽  
Experimental Results ◽  
Initial Population ◽  
Improved Genetic Algorithm ◽  
High Quality ◽  
Multi Core Processor ◽  
Better Than

This paper puts forward an improved genetic scheduling algorithm in order to improve the execution efficiency of task scheduling of the heterogeneous multi-core processor system and give full play to its performance. The attribute values and the high value of tasks were introduced to structure the initial population, randomly selected a method with the 50% probability to sort for task of individuals of the population, thus to get high quality initial population and ensured the diversity of the population. The experimental results have shown that the performance of the improved algorithm was better than that of the traditional genetic algorithm and the HEFT algorithm. The execution time of tasks was reduced.

GENETIC ALGORITHM WITH TWO OBJECTIVE FOR REAL-TIME TASK SCHEDULING WITH COMMUNICATION TIME

2018 ◽  
Vol 6 (1) ◽  
pp. 14-17
Author(s):  
Myungryun Yoo ◽  
Takanori Yokoyama
Keyword(s):  
Real Time ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Multiprocessor System ◽  
Time Task ◽  
Communication Time ◽  
Adaptive Weight ◽  
Np Hard Problem ◽  
Heuristics Algorithm ◽  
Execution Order

Purpose of the study:The real-time task scheduling on multiprocessor system is known as an NP-hard problem. This paper proposes a new real-time task scheduling algorithmwhich considers the communication time between processors and the execution order between tasks. Methodology:Genetic Algorithm (GA)with Adaptive Weight Approach (AWA) is used in our approach. Main Findings:Our approach has two objectives. The first objective is to minimize the total amount of deadline-miss. And the second objective is to minimize the total number of processors used. Applications of this study:For two objectives,the range of each objective is readjusted through Adaptive Weight Approach (AWA) and more useful result is obtained. Novelty/Originality of this study:This study never been done before.This study also wasprovided current information about scheduling algorithm and heuristics algorithm.

scholarly journals Reduction of Task Queue Execution Time in GRID-systems with Inalienable Resources

2021 ◽  
Vol 43 (2) ◽  
pp. 86-96
Author(s):  
T.A. Uzdenov ◽  
Keyword(s):  
Execution Time ◽  
Scheduling Algorithm ◽  
Grid Systems ◽  
First Come First Serve

Наведено математичну постановку задачі диспетчеризації потоків завдань в GRID-сис­темах з невідчужуваними ресурсами з врахуванням потужності вузла та потужності за­дачі як ключових факторів, що впливають на продуктивність системи. Проведено порівняння часу виконання черги завдань при розподілі методами FSA (Flow Scheduling Algorithm), FSA_P(Flow Scheduling Algorithm Parallel) та FCFS(First Come First Serve). Описано клієнт-серверну архітектурну модель побудови про­грам­ного забезпечення для розподілених обчислень та задач, які потребують великої обчислювальної потужності системи. Обґрунтовано доцільність порівняння ефективнос­ті запропонованих методів з загальновідомим методом FCFS, який зазвичай використо­вується у GRID-системах. Подано результати тестування, яке засвідчило, що запропоно­вані методи дають кращий результат, ніж FCFS.

Sign in / Sign up

Export Citation Format

Share Document