Static strategy and dynamic adjustment: An effective method for Grid task scheduling

2009 ◽  
Vol 25 (8) ◽  
pp. 884-892 ◽  
Author(s):  
Peijie Huang ◽  
Hong Peng ◽  
Piyuan Lin ◽  
Xuezhen Li
Keyword(s):  
Task Scheduling ◽  
Dynamic Adjustment ◽  
Static Strategy

Dynamic adjustment of emission from both singlets and triplets: the role of excited state conformation relaxation and charge transfer in phenothiazine derivates

2021 ◽  
Author(s):  
Weidong Qiu ◽  
Xinyi Cai ◽  
Mengke Li ◽  
Liangying Wang ◽  
Yanmei He ◽  
...  
Keyword(s):  
Excited State ◽  
Charge Transfer ◽  
Intramolecular Charge Transfer ◽  
Dynamic Adjustment ◽  
Twisted Intramolecular Charge Transfer

Dynamic adjustment of emission behaviours by controlling the extent of twisted intramolecular charge transfer character in excited state.

How does manipulation of secondary task scheduling affect human performance?

2006 ◽  
Author(s):  
Patrice D. Tremoulet ◽  
Kathleen M. Stibler ◽  
Patrick Craven ◽  
Joyce Barton ◽  
Adam Gifford ◽  
...  
Keyword(s):  
Task Scheduling ◽  
Secondary Task ◽  
Human Performance

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

A Study for VM Placement Schemes in Cloud

2017 ◽  
Vol 7 (8) ◽  
pp. 208
Author(s):  
Ramandeep Kaur ◽  
Navpreet Kaur
Keyword(s):  
Cloud Computing ◽  
Reaction Time ◽  
Task Scheduling ◽  
Specific Time ◽  
Due Date ◽  
Vm Placement ◽  
Time Task ◽  
Wide Range ◽  
The Web

The cloud computing can be essentially expressed as aconveyance of computing condition where distinctive assets are conveyed as a support of the client or different occupants over the web. The task scheduling basically concentrates on improving the productive use of assets and henceforth decrease in task fruition time. Task scheduling is utilized to allot certain tasks to specific assets at a specific time occurrence. A wide range of systems has been exhibited to take care of the issues of scheduling of various tasks. Task scheduling enhances the productive use of asset and yields less reaction time with the goal that the execution of submitted tasks happens inside a conceivable least time. This paper talks about the investigation of need, length and due date based task scheduling calculations utilized as a part of cloud computing.

Sign in / Sign up

Export Citation Format

Share Document