Task Scheduling in Multiprocessor to Reduce Peak Temperature

2011 ◽  
pp. 125-142
2015 ◽  
Vol 25 (01) ◽  
pp. 1640003 ◽  
Author(s):  
Yingnan Cui ◽  
Wei Zhang ◽  
Vivek Chaturvedi ◽  
Weichen Liu ◽  
Bingsheng He

Three-dimensional network-on-chip (3D-NoC) emerges as a potential multi-core architecture delivering high performance, high energy efficiency and great scalability. However, 3D-NoC suffers from severe thermal problems due to its high power density. To solve this problem, thermal-aware scheduling is an effective solution. However, the high complexity of the thermal model of 3D-NoC becomes a major hurdle for developing efficient thermal-aware scheduling algorithms for 3D-NoC. In this paper, we propose a novel thermal-aware task scheduling scheme named as the Bottom-to-Top (B2T) approach to address this challenge. This heuristic-based method performs task allocation on processing units to efficiently minimize the peak temperature and improve the execution time of the tasks with low complexity. The algorithm is first designed for two-layer 3D-NoC and then extended to 3D-NoC with an arbitrary number of layers. When compared to traditional thermal-aware scheduling algorithms designed for 2D-NoC, our B2T algorithm can achieve significant peak temperature reduction (up to 11.9[Formula: see text]C) and performance improvement (up to 4%) on two-layer 3D-NoC. The improvement becomes more significant as the number of layers in 3D-NoC increases. For four-layer 3D-NoC, the improvement is up to [Formula: see text]C peak temperature reduction.


2006 ◽  
Author(s):  
Patrice D. Tremoulet ◽  
Kathleen M. Stibler ◽  
Patrick Craven ◽  
Joyce Barton ◽  
Adam Gifford ◽  
...  

Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey

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.


Author(s):  
Ramandeep Kaur ◽  
Navpreet Kaur

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