Grid Scheduling Model Based on Petri Net

2014 ◽  
Vol 687-691 ◽  
pp. 2268-2271
Author(s):  
Li Mei Chen
Keyword(s):  
Resource Allocation ◽  
Petri Net ◽  
Scheduling Algorithm ◽  
Variable Structure ◽  
Exception Handling ◽  
Loose Coupling ◽  
Grid Scheduling ◽  
Resource Allocation Algorithm ◽  
Model Based ◽  
Scheduling Model

In order to solve the task allocation and scheduling problem, based on the analysis and research of hierarchical Petri net, this paper proposed a grid scheduling model based on hierarchical scheduling model. This model can ensure that the various elements of the loose coupling between the scheduling, to facilitate data resources deployment in grid environment; in addition, this paper proposed thought of the variable structure Petri network, through this technology can dynamic adjust work modeling and resource allocation, and to support the mission of exception handling; finally, to verify the rationality of the scheduling algorithm, and analyzes the performance and the efficiency of resource allocation algorithm.

A Security Prioritized Computational Grid Scheduling Model

2011 ◽  
pp. 90-100
Author(s):  
Rekha Kashyap ◽  
Deo P. Vidyarthi
Keyword(s):  
Scheduling Algorithm ◽  
Computational Grid ◽  
Security Requirement ◽  
Computational Power ◽  
Grid Scheduling ◽  
System Utilization ◽  
Scheduling Model ◽  
Grid Resources

Grid supports heterogeneities of resources in terms of security and computational power. Applications with stringent security requirement introduce challenging concerns when executed on the grid resources. Though grid scheduler considers the computational heterogeneity while making scheduling decisions, little is done to address their security heterogeneity. This work proposes a security aware computational grid scheduling model, which schedules the tasks taking into account both kinds of heterogeneities. The approach is known as Security Prioritized MinMin (SPMinMin). Comparing it with one of the widely used grid scheduling algorithm MinMin (secured) shows that SPMinMin performs better and sometimes behaves similar to MinMin under all possible situations in terms of makespan and system utilization.

Research on the inventory scheduling model based on agent‐oriented Petri net in supply chain

Kybernetes ◽  
2008 ◽  
Vol 37 (9/10) ◽  
pp. 1234-1241 ◽  
Author(s):  
Dejun Chen ◽  
Zude Zhou ◽  
Rui Hu
Keyword(s):  
Supply Chain ◽  
Petri Net ◽  
Model Based ◽  
Scheduling Model

scholarly journals Optimization and Simulation of a Reasonable Scheduling Model under Multiple Tasks in Company Management

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Zhuo Wang
Keyword(s):  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Rapid Development ◽  
Optimal Solution ◽  
Solution Space ◽  
Corporate Management ◽  
Model Based ◽  
Scheduling Model ◽  
Optimization And Simulation ◽  
The Stability

With the rapid development of market economy, the task scheduling model has become the core problem in the field of corporate management. In order to solve the problem that the stability of the model will decline due to the interference of human factors in the process of multitask scheduling in the traditional algorithm, a reasonable scheduling model based on the priority principle is proposed in this paper. This paper expounds the principle of multitask scheduling in company management, constructs a multitask scheduling network model based on priority, performs virtual scheduling on the model, searches the optimal solution in the solution space of the scheduling problem, and obtains the reasonable multitask scheduling method in the company management. Through the analysis of relevant simulation experiments, it can be concluded that the task scheduling algorithm proposed in this paper can not only allocate the corresponding resources for high-priority tasks effectively, but also can save the cost, so as to show better execution efficiency.

scholarly journals A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
P. Keerthika ◽  
P. Suresh
Keyword(s):  
Resource Allocation ◽  
Fault Tolerance ◽  
Load Balancing ◽  
User Satisfaction ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Grid Environment ◽  
Resource Allocation Algorithm ◽  
Processing Cost ◽  
Comparison Results

Grid environment consists of millions of dynamic and heterogeneous resources. A grid environment which deals with computing resources is computational grid and is meant for applications that involve larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Allocation of resources is a tedious issue since it has to consider several requirements such as system load, processing cost and time, user’s deadline, and resource failure. This work attempts to design a resource allocation algorithm which is budget constrained and also targets load balancing, fault tolerance, and user satisfaction by considering the above requirements. The proposed Multiconstrained Load Balancing Fault Tolerant algorithm (MLFT) reduces the schedule makespan, schedule cost, and task failure rate and improves resource utilization. The proposed MLFT algorithm is evaluated using Gridsim toolkit and the results are compared with the recent algorithms which separately concentrate on all these factors. The comparison results ensure that the proposed algorithm works better than its counterparts.

scholarly journals IEEE 802.11ax OFDMA Resource Allocation with Frequency-Selective Fading

Sensors ◽  
2021 ◽  
Vol 21 (18) ◽  
pp. 6099
Author(s):  
Sergei Tutelian ◽  
Dmitry Bankov ◽  
Dmitri Shmelkin ◽  
Evgeny Khorov
Keyword(s):  
Resource Allocation ◽  
Scheduling Algorithm ◽  
Access Point ◽  
Selective Fading ◽  
Resource Allocation Algorithm ◽  
Frequency Selective Fading ◽  
Ieee 802.11Ax ◽  
Channel Conditions ◽  
Efficient Resource ◽  
Frequency Selective

This paper studies the usage of orthogonal frequency division multiple access (OFDMA) for uplink transmissions in IEEE 802.11ax networks. OFDMA enables simultaneous multi-user transmissions in Wi-Fi, but its usage requires efficient resource allocation algorithms. These algorithms should be able to adapt to the changing channel conditions, including the frequency-selective fading. This paper presents an OFDMA resource allocation algorithm for channels with frequency-selective fading and proposes an approach to adapt the user transmission power and modulation and coding schemes to the varying channel conditions, which is efficient even in the case when the access point has outdated channel state information. The proposed scheduling algorithm and power allocation approach can double the goodput and halve the data transmission time in Wi-Fi networks even in dense deployments of access points.

scholarly journals 5thgeneration Wireless Network using Distributed Power Control, Novel and round Robin Scheduling Algorithms

2019 ◽  
Vol 8 (4) ◽  
pp. 9493-9497
Keyword(s):  
Resource Allocation ◽  
Power Control ◽  
Packet Scheduling ◽  
Power Transmission ◽  
Scheduling Algorithm ◽  
Energy Levels ◽  
Round Robin ◽  
Total Power ◽  
Resource Allocation Algorithm ◽  
Available Energy

The demand for higher networking quality i.e., 5G technology and improved wireless connectivity is increasing rapidly in emerging Cyber-Physical Systems (CPS). In this paper, we looked at the question of reducing total power transmission with power control and resource allocation in 5 G networks where there is mutual interference between cells using the distributed resource allocation algorithm, Packet Scheduling and compared with Round Robin Scheduling algorithm. Power control was indeed an efficient way to enhance wireless system ability. It was assumed that energy levels can be allocated from a constant spectrum in prior job on energy control. But energy levels are allocated from a discrete set in practice. In this work, we consider minimizing the complete transmitted energy over specified discrete sets of available energy levels subject to maintaining an acceptable quality of signal for each mobile. Our algorithm has reduced computational complexity compared to the current optimization algorithm, where each resource is assigned to a maximum of one user over a period of time. Numerical results verify our proposed algorithm's efficiency and convergence.

Sign in / Sign up

Export Citation Format

Share Document