Vous êtes sur la page 1sur 6

ABSTRACT

The Cloud is emerging for scalable and efficient cloud services. To meet the
needs of handling massive data and decreasing data migration, the computation
infrastructure requires efficient data placement and proper management for cached data.
In this paper, we propose an efficient and cost-effective multilevel caching scheme,
called MERCURY, as computation infrastructure of the cloud. The idea behind
MERCURY is to explore and exploit data similarity and support efficient data placement.
To accurately and efficiently capture the data similarity, we leverage a low-complexity
locality-sensitive hashing (LSH). In our design, in addition to the problem of space
inefficiency, we identify that a conventional LSH scheme also suffers from the problem
of homogeneous data placement.

To address these two problems, we design a novel multi core-enabled locality-


sensitive hashing (MC-LSH) that accurately captures the differentiated similarity across
data. The similarity-aware MERCURY, hence, partitions data into the L1 cache, L2
cache, and main memory based on their distinct localities, which help optimize cache
utilization and minimize the pollution in the last-level cache. Besides extensive
evaluation through simulations, we also implemented MERCURY in a system.
Experimental results based on real-world applications and data sets demonstrate the
efficiency and efficacy of our proposed schemes.

i
CONTENTS

Abstract i
List of Figures iv
List of Tables v
List of Screen Shots vi
1. Introduction 1
1.1 Overview of the Project 1
1.2 Objective of Project 3
1.3 Scope of the Project 4
1.4 Organization of Document 4
2. LITERATURE SURVEY 4
2.1 A View on Cloud Computing 5
2.2 Orleans: Cloud Computing for Everyone 6
2.3 Query Optimization for Massively Parallel Data Processing 8
2.4 Multi-Execution: Multicore Caching for Data-Similar Executions 10
2.5 PageNUCA: Policies for Page-grain Locality Management 11
2.6 Data Pre-fetch Mechanisms 15
3. ANALYSIS 13
3.1 Introduction 18
3.2 Existing System 18
3.3 Proposed System 18
3.4 Process Model Used With Justification 19
3.5 Software Requirement Specification  28
 3.5.1. Overall Description 28
3.5.2. External Interface Requirements 30
4. DESIGN 31
4.1 UML diagrams 31
4.2 Data Flow Diagram
39
5. IMPLEMENTATION 41

ii
5.1 Modules 41
5.2 Modules Description 41
5.2.1 Multi-core Processor 41
5.2.2. Cache Memory & Cache Storage 41
5.2.3 Computational Infrastructure 42
5.2.4. Data Migration 42
5.3. Introduction of technologies used 42
6. TESTING 62
6.1 Implementation & Testing 62
6.1.1 Implementation 62
6.1.2 Testing 62
6.1.2.1 System Testing 63
6.1.2.2. Module Testing 63
6.1.2.3. Integration Testing 63
6.1.2.4 Acceptance Testing 63
7. SCREEN SHOTS 64
8. CONCLUSION & FUTURE SCOPE 74
8.1 Conclusion 74
8.2 Future Scope 74
9. BIBLIOGRAPHY 75

iii
LIST OF FIGURES

S No Figure No Description Page No


1. Fig: 3.1 SDLC Phases 20
2. Fig: 3.2 Requirement Analysis 21
3. Fig: 3.3 Analysis Phase 22
4. Fig: 3.4 Design Phase 23
5. Fig: 3.5 Development Phase 24
6. Fig: 3.6 Integration & Testing Phase 26
7 Fig: 3.7 Installation Phase 27
8 Fig: 4.1 Class Diagram 33
9. Fig: 4.2 Use Case Diagram 34
10. Fig: 4.3 Sequence Diagram 35
11. Fig: 4.4 Collaborative Diagram 36
12. Fig: 4.5 Component Diagram 37
13. Fig: 4.6 Deployment Diagram 38
14. Fig: 4.7 Activity Diagram 39
15. Fig: 5.1 Java Virtual Machine 44
16. Fig: 5.2 Types of Components 46
17. Fig: 5.3 Types of Containers 47
18. Fig: 5.4 Hierarchy of Components 59

iv
List of Tables

S No Table No Description Page No


1. 5.1. Differences between Swings and AWT 59
2. 5.2. AWT and Swings Components 60

v
List of Screen Shots

S No Screen Shot No Description Page No


1. 7.1. Starting the Application 64
2. 7.2. File Explorer option to locate the file 65
3. 7.3. File upload successful confirmation 66
4. 7.4. Build Vector 67
5. 7.5. Updating the cache with similarity threshold 68
6. 7.6. Updating the cache with access threshold 69
7. 7.7. Viewing the L1 Cache 70
8. 7.8. Viewing the L2 Cache 71
9. 7.9. Viewing the main memory 72
10. 7.10. Viewing the L1 & L2 Cache Size Chart 73

vi

Vous aimerez peut-être aussi