scholarly journals Improved Model of Scheduling Algorithm

2018 ◽  
pp. 104-106
Author(s):  
Artur Vardanyan
Keyword(s):  
High Performance ◽  
Cluster Computing ◽  
Scheduling Algorithm ◽  
Great Influence ◽  
Cluster Management ◽  
Task Scheduling Algorithm ◽  
Long Time ◽  
Improved Model ◽  
First In First Out

Cluster computing is becoming increasingly practical for high performance computing research and development. A computer cluster is a set of connected computers that work together so that, they can be viewed as a single system. Clusters offer a scalable means of linking computers together to provide an expansive environment for hosting enterprise applications. As the number of nodes in cluster configurations grows, the cluster administration becomes more challenging. We need to study the challenges of cluster management and to provide a solution. To have an effective cluster management we need to have an effective task scheduling algorithm. With the explosive growth of information, the demand on computing is sharply increasing. Due to a large number of computing tasks, the scheduling algorithm is an important part of cluster computing and has a great influence on the quality of claster service. In cluster computing, some large tasks may occupy too many resources and some small tasks may wait for a long time based on First-In-First-Out (FIFO) scheduling algorithm. This paper provides an overview of an improved scheduling algorithm that shortens the execution time of tasks and increases the resource utilization.

scholarly journals Complications in Infrastructure as a Service Layer of Cloud and its Solution

2019 ◽  
Vol 8 (2S6) ◽  
pp. 576-580
Keyword(s):  
High Performance ◽  
Scheduling Algorithm ◽  
Service Level Agreement ◽  
Service Level ◽  
Infrastructure As A Service ◽  
Physical Computing ◽  
Task Scheduling Algorithm ◽  
Cloud Users ◽  
The Universe

Cloud computing shows a vibrant role in existing scenario and the enactment of infrastructure as a service is perilous because of its discrepancy in the area. The cloud users have increased hastily, and the accessibility of resources for the users are less. Infrastructure as a service (IaaS) mentions the particulars of infrastructure like physical computing resources such as stowage, compute, and networking services. IaaS- cloud providers underwrite these resources based on their necessity from their vast content of resources presents any where all over the universe. Observing of these resources continually is precarious. For monitoring the availability of resources and notifying to the users about the resources is one of the challenges taken in Iaas layer is Service Level Agreement (SLA) and provided with a solution. The foremost objective of the scheduling algorithms in a cloud environment is to exploit the resources proficiently while balancing the load between resources, to get the least possible execution time. Hence, rank based task scheduling algorithm is proposed to utilize the resources efficiently and perform high performance. A simulation result gives the Quality of Service (QoS) Parameters such as length (size), CPU, throughput, and bandwidth.

Task scheduling algorithm based on improved genetic algorithm in cloud computing environment

2020 ◽  
Vol 13 ◽  
Author(s):  
Ge Weiqing ◽  
Cui Yanru
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Task Completion ◽  
Improved Genetic Algorithm ◽  
Fitness Functions ◽  
Task Scheduling Algorithm ◽  
Simulation Results

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

ON MESSAGE PACKAGING IN TASK SCHEDULING FOR DISTRIBUTED MEMORY PARALLEL MACHINES

2001 ◽  
Vol 12 (03) ◽  
pp. 285-306 ◽  
Author(s):  
NORIYUKI FUJIMOTO ◽  
TOMOKI BABA ◽  
TAKASHI HASHIMOTO ◽  
KENICHI HAGIHARA
Keyword(s):  
Task Scheduling ◽  
High Performance ◽  
Distributed Memory ◽  
Parallel Machines ◽  
Scheduling Algorithm ◽  
Parallel Programs ◽  
Parallel Program ◽  
Interprocessor Communication ◽  
Task Scheduling Algorithm ◽  
Software Overhead

In this paper, we report a performance gap betweeen a schedule with small makespan on the task scheduling model and the corresponding parallel program on distributed memory parallel machines. The main reason of the gap is the software overhead in the interprocessor communication. Therefore, speedup ratios of schedules on the model do not approximate well to those of parallel programs on the machines. The purpose of the paper is to get a task scheduling algorithm that generates a schedule with good approximation to the corresponding parallel program and with small makespan. For this purpose, we propose algorithm BCSH that generates only bulk synchronous schedules. In those schedules, no-communication phases and communication phases appear alternately. All interprocessor communications are done only in the latter phases, and thus the corresponding parallel programs can make better use of the message packaging technique easily. It reduces many software overheads of messages form a source processor to the same destination processor to almost one software overhead, and improves the performance of a parallel program significantly. Finally, we show some experimental results of performance gaps on BCSH, Kruatrachue's algorithm DSH, and Ahmad et al's algorithm ECPFD. The schedules by DSH and ECPFD are famous for their small makespans, but message packaging can not be effectively applied to the corresponding program. The results show that a bulk synchronous schedule with small makespan has advantages that the gap is small and the corresponding program is a high performance parallel one.

scholarly journals Load Balancing Technique with an Efficient Method

2019 ◽  
Vol 8 (6) ◽  
pp. 1257-1262
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Efficient Method ◽  
Load Balance ◽  
Completion Time ◽  
Scheduling Algorithm ◽  
Quality Of Services ◽  
Huge Number ◽  
Task Scheduling Algorithm

There are a huge number of nodes connected to web computing to offer various types of web services to provide cloud clients. Limited numbers of nodes connected to cloud computing have to execute more than a thousand or a million tasks at the same time. So it is not so simple to execute all tasks at the same particular time. Some nodes execute all tasks, so there is a need to balance all the tasks or loads at a time. Load balance minimizes the completion time and executes all the tasks in a particular way.There is no possibility to keep an equal number of servers in cloud computing to execute an equal number of tasks. Tasks that are to be performed in cloud computing would be more than the connected servers. Limited servers have to perform a great number of tasks.We propose a task scheduling algorithm where few nodes perform the jobs, where jobs are more than the nodes and balance all loads to the available nodes to make the best use of the quality of services with load balancing.

scholarly journals EHEFT-R: multi-objective task scheduling scheme in cloud computing

2021 ◽  
Author(s):  
Honglin Zhang ◽  
Yaohua Wu ◽  
Zaixing Sun
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Solution Space ◽  
Finish Time ◽  
Task Scheduling Algorithm ◽  
Matching Efficiency ◽  
Earliest Finish Time ◽  
Core Issues

AbstractIn cloud computing, task scheduling and resource allocation are the two core issues of the IaaS layer. Efficient task scheduling algorithm can improve the matching efficiency between tasks and resources. In this paper, an enhanced heterogeneous earliest finish time based on rule (EHEFT-R) task scheduling algorithm is proposed to optimize task execution efficiency, quality of service (QoS) and energy consumption. In EHEFT-R, ordering rules based on priority constraints are used to optimize the quality of the initial solution, and the enhanced heterogeneous earliest finish time (HEFT) algorithm is used to ensure the global performance of the solution space. Simulation experiments verify the effectiveness and superiority of EHEFT-R.

scholarly journals Evaluation of the Influence of Sulfur-FumigatedPaeoniae Radix Albaon the Quality of Si Wu Tang by Chromatographic and Chemometric Analysis

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Ke Pei ◽  
Hao Cai ◽  
Yu Duan ◽  
Feng-Xian Qiao ◽  
Si-Cong Tu ◽  
...  
Keyword(s):  
High Performance ◽  
Chemical Constituents ◽  
Great Influence ◽  
Principal Component ◽  
Hierarchical Cluster ◽  
High Performance Liquid Chromatographic ◽  
Chromatographic Fingerprint ◽  
Paeoniae Radix ◽  
Liquid Chromatographic

An accurate and reliable method of high-performance liquid chromatographic fingerprint combining with multi-ingredient determination was developed and validated to evaluate the influence of sulfur-fumigatedPaeoniae Radix Albaon the quality and chemical constituents of Si Wu Tang. Multivariate data analysis including hierarchical cluster analysis and principal component analysis, which integrated with high-performance liquid chromatographic fingerprint and multi-ingredient determination, was employed to evaluate Si Wu Tang in a more objective and scientific way. Interestingly, in this paper, a total of 37 and 36 peaks were marked as common peaks in ten batches of Si Wu Tang containing sun-driedPaeoniae Radix Albaand ten batches of Si Wu Tang containing sulfur-fumigatedPaeoniae Radix Alba, respectively, which indicated the changed fingerprint profile of Si Wu Tang when containing sulfur-fumigated herb. Furthermore, the results of simultaneous determination for multiple ingredients showed that the contents of albiflorin and paeoniflorin decreased significantly (P<0.01) and the contents of gallic acid andZ-ligustilide decreased to some extent at the same time when Si Wu Tang contained sulfur-fumigatedPaeoniae Radix Alba. Therefore, sulfur-fumigation processing may have great influence on the quality of Chinese herbal prescription.

Sign in / Sign up

Export Citation Format

Share Document