<< PROJECT TITLE >>

Submitted by

<< NAME >> <<REG NO>>

<< NAME >> <<REG NO>>

<< NAME >> <<REG NO>>

<< NAME >> <<REG NO>>

<< NAME >> <<REG NO>>

SoC <Section >>

MINI PROJECT SUBMITTED UNDER

1150CS201 - PROBLEM SOLVING USING C

<<Month>> <<year>>

1
 BONAFIDE CERTIFICATE

This is to certify that the project entitled “<< PROJECT TITLE>>” submitted by << Name – Reg
No>> for the course 1150CS201 – Problem Solving Using C

Signature of Supervisor
Dr.A.SRINIVASAN
Associate Professor
Department of CSE,
Vel Tech Rangarajan Dr. Sagunthala
Institute of Science and Technology
vadi, Chennai-600062.

2
 ABSTRACT

Resource allocation and scheduling on clouds are required to harness the power of the

underlying resource pool such that the service provider can meet the quality of service requirements

of users, which are often captured in service level agreements (SLAs). This paper focuses on resource

allocation and scheduling on clouds and clusters that process Map Reduce jobs with SLAs. The

resource allocation and scheduling problem is modelled as an optimization problem using constraint

programming, and a novel Map Reduce Constraint Programming based Resource Management

algorithm (MRCP-RM) is devised that can effectively process an open stream of Map Reduce jobs

where each job is characterized by an SLA comprising an earliest start time, a required execution

time, and an end-to-end deadline. A detailed performance evaluation of MRCP-RM is conducted for

an open system subjected to a stream of job arrivals using both simulation and experimentation on a

real system. The experiments on a real system are performed on a Hadoop cluster (deployed on

Amazon EC2) that runs our new Hadoop Constraint Programming based Resource Management

algorithm (HCP-RM) that incorporates a technique for handling data locality. The results of the

performance evaluation demonstrate the effectiveness of MRCP RM/HCP-RM in generating a

schedule that leads to a low proportion of jobs missing their deadlines (P) and also provide insights

into system behaviour and performance. In the simulation experiments, it is observed that MRCP-

RM achieves on average an 82 percent lower P compared to a technique from the existing literature

when processing a synthetic workload from Facebook. Furthermore, in the experiments performed

on a Hadoop cluster deployed on Amazon EC2, it is observed that HCP-RM achieved on average a

63 percent lower P compared to an EDF-Scheduler for a wide variety of workload.

3
 TABLE OF CONTENTS
SL.NO TITLE PAGE NO
ABSTRACT 1

1 INTRODUCTION
1.1 Background of the project
1.2 Overview of the project
2 SYSTEM ANALYSIS
2.1 Development environment
2.1.1 Hardware
requirements
2.1.2 Software requirements
3 SYSTEM DESIGN
3.1 Working Diagram and Module
Description
4 IMPLEMENTATION

4.1 Source Code and Explanation

4.2 Results
5 CONCLUSION AND FUTURE
ENHANCEMENT
REFERENCES