Energy Conscious Scheduling for Distributed Computing Systems under Different Operating Conditions
Energy
Conscious Scheduling for Distributed
Computing
Systems under Different
Operating
Conditions
Abstract:
Traditionally,
the primary performance goal of computer systems has focused on reducing the
execution time of applications while increasing throughput. This performance
goal has been mostly achieved by the development of high-density Computer
systems. As witnessed recently, these systems provide very powerful processing
capability and capacity. They often consist of tens or hundreds of thousands of
processors and other resource-hungry devices. The energy consumption of these
systems has become a major concern. In this paper, we address the problem of
scheduling precedence-constrained parallel applications on
Multiprocessor
computer systems and present two energy-conscious scheduling algorithms using
dynamic voltage scaling (DVS). A number of recent commodity processors are
capable of DVS, which enables processors to operate at different voltage supply
levels at the expense of sacrificing clock frequencies. In the context of
scheduling, this multiple voltage facility implies that there is a trade-off between
the quality of schedules and energy consumption. To effectively balance these
two performance goals, we have devised a novel objective function and a variant
from that. The main difference between the two algorithms is in their
measurement of energy consumption. The extensive comparative evaluations
conducted as part of this work show that the performance of our algorithms is very
compelling in terms of both application completion time and energy consumption.
Existing
System:
Ø In
the existing system Most MCSs operate with some form of resource management
facility (such as PBS, LSF, etc.) for achieving performance goals like high
performance, high throughput and/or high availability.
Ø However,
most existing resource management facilities generally lack energy saving
capability.
Ø The
size of adverse environmental footprint that MCSs leave.
Proposed
System:
Ø In
this paper, we address the problem of scheduling precedence-constrained
parallel applications on multiprocessor computer systems and present two
energy-conscious scheduling algorithms.
Ø Presents
two energy-conscious scheduling heuristics that take into account not only make
span, but also energy consumption.
Ø The
extensive comparative evaluations conducted as part of this work show that the
performance of our algorithms is very compelling in terms of both application
completion time and energy consumption.
Ø We
address the energy-aware scheduling of precedence-constrained parallel
applications for MCSs consisting of heterogeneous resources.
Ø However,
most efforts in task scheduling have focused on two issues, the minimization of
application completion time (make span/schedule length) and time complexity; in
other words, the main objective of a task scheduling algorithm is the
generation of the optimal schedule for a given application with the minimal
amount of scheduling time.
KEYWORDS:
Generic Technology Keywords: Database,
User Interface, Programming
Specific Technology Keywords: C#.Net,
Windows Forms
Project Keywords: Presentation, Business Object, Data Access Layer
SDLC Keywords: Analysis, Design, Code, Testing, Implementation, Maintenance
SYSTEM
CONFIGURATION
HARDWARE
CONFIGURATION
|
S.NO
|
HARDWARE
|
CONFIGURATIONS
|
|
1
|
Operating System
|
Windows 2000 & XP
|
|
2
|
RAM
|
1GB
|
|
3
|
Processor (with Speed)
|
Intel
Pentium IV (3.0 GHz) and Upwards
|
|
4
|
Hard Disk Size
|
40 GB and above
|
|
5
|
Monitor
|
15’ CRT
|
SOFTWARE
CONFIGURATION
|
S.NO
|
SOFTWARE
|
CONFIGURATIONS
|
|
1
|
Platform
|
Microsoft Visual Studio
|
|
2
|
Framework
|
.Net Framework 4.0
|
|
3
|
Language
|
C#.Net
|
|
4
|
Front End
|
Windows Forms
|
Categories:
0 comments:
Post a Comment