A New Power-Aware Scheduling Algorithm for Distributed System

2010 ◽  
Author(s):  
Xin Chen ◽  
Qiang Liu ◽  
JianBing Lai
Keyword(s):  
Distributed System ◽  
Scheduling Algorithm ◽  
Power Aware Scheduling

Design and Construction of Distributed JavaScript Parsing System

2014 ◽  
Vol 6 (4) ◽  
pp. 1-14
Author(s):  
Bo Shen ◽  
Wei Huang ◽  
Xiaodi Li
Keyword(s):  
Search Engine ◽  
Distributed System ◽  
Task Scheduling ◽  
Information Acquisition ◽  
Scheduling Algorithm ◽  
Rapid Development ◽  
Internet Technology ◽  
The Internet ◽  
Computing Technology ◽  
Task Scheduling Algorithm

With the rapid development of the Internet technology, JS (short for JavaScript), as one of the representative of script languages, which is very powerful, is becoming more and more popular to the developers and users. But JS programming is more complex than usual static technology. In the field of search engine and information acquisition, it's very difficult to get the information hidden in script code. In this paper, the authors design a distributed system for parsing the JS code embedded in HTML file and retrieving the underling information. the authors describe how to extract JS codes from HTML file and parse them. Also, they introduce a task scheduling algorithm for the JS parsing system by employing Hadoop distributed computing technology. The experimental results indicate that the proposed algorithm and system can achieve a reasonable task scheduling efficiency and parse JS codes rapidly.

scholarly journals Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Rashmi Sharma ◽  
Nitin
Keyword(s):  
Real Time ◽  
Distributed System ◽  
Scheduling Algorithm ◽  
Earliest Deadline First ◽  
Time System ◽  
Real Time System ◽  
Main Target ◽  
Migration Mechanism ◽  
Simulation Results ◽  
Earliest Deadline

In Real Time System, the achievement of deadline is the main target of every scheduling algorithm. Earliest Deadline First (EDF), Rate Monotonic (RM), and least Laxity First are some renowned algorithms that work well in their own context. As we know, there is a very common problem Domino's effect in EDF that is generated due to overloading condition (EDF is not working well in overloading situation). Similarly, performance of RM is degraded in underloading condition. We can say that both algorithms are complements of each other. Deadline missing in both events happens because of their utilization bounding strategy. Therefore, in this paper we are proposing a new scheduling algorithm that carries through the drawback of both existing algorithms. Joint EDF-RM scheduling algorithm is implemented in global scheduler that permits task migration mechanism in between processors in the system. In order to check the improved behavior of proposed algorithm we perform simulation. Results are achieved and evaluated in terms of Success Ratio (SR), Average CPU Utilization (ECU), Failure Ratio (FR), and Maximum Tardiness parameters. In the end, the results are compared with the existing (EDF, RM, and D_R_EDF) algorithms. It has been shown that the proposed algorithm performs better during overloading condition as well in underloading condition.

scholarly journals Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Ye-In Seol ◽  
Young-Kuk Kim
Keyword(s):  
Energy Consumption ◽  
Scheduling Algorithm ◽  
Priority Scheduling ◽  
Dynamic Priority ◽  
Task Model ◽  
Dynamic Voltage ◽  
Priority Method ◽  
Hard Real Time ◽  
Static Systems ◽  
Power Aware Scheduling

Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task’s priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity ofO(n) reduces the energy consumption by 10–80% over the existing algorithms.

Sign in / Sign up

Export Citation Format

Share Document