Beruflich Dokumente
Kultur Dokumente
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Outline
1
Introduction
Multicore Architecture
The idea
Proposed approach
Literature review
Related Work
Methodology
ENCAP
ENCAP Heuristics
Assumptions
Evaluation
SESC
CACTI
LITMUS(RT)
6
7
Result Analysis
8
9
Future Work
Case Study
Multi-core Distributed Cluster
Experimental Evaluation
References
P.Pavan Kumar (12ph0515)
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Multicore Architecture
Multicore Architecture
Contain two or more processors on a single integrated circuit (IC)
Adopted by most chip manufacturers
Such chips contains On-Chip Caches
Shared by some (or) all of the cores on the chip
Scheduling methods should aware of these caches
In Multicore architecture all cores are
X Symmetric
X Single threaded
X Shared an L2 cache
This paper abode the issue of enhancing the shared cache memory
in the context of soft real-time system
P.Pavan Kumar (12ph0515)
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Multicore Architecture
Contd.
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Multicore Architecture
Contd.
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Multicore Architecture
Applications
Database servers
Web servers (Web commerce)
Compilers
Multimedia applications
Scientific applications(CAD/CAM)
MPEG-2
High performance computing(GPU)
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Proposed approach
The idea
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Proposed approach
Proposed approach
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Related Work
Literature review
Resources
Int. Journals(IEEE, Elsevier, ..)
Int. Conferences
Int. Symposium
Nat. Journals (CSI, ..)
Nat.Conferences
Tech. Reports(M.Tech, MS, ..)
Magazines(IEEE,IBM,..)
2004
3
0
0
0
0
0
0
2005
0
1
1
0
0
0
1
2006
3
2
1
0
0
1
0
2007
1
5
2
0
0
0
0
2008
1
2
3
0
0
0
0
2009
3
2
0
0
0
0
0
2010
2
1
1
0
0
0
0
2011
1
3
1
0
0
0
0
2012
2
1
2
0
0
0
0
2013
0
2
2
0
0
0
0
2014
0
1(S)
1
0
0
1
0
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Related Work
Related Work
Sr.No. Year
1
2000
Author(s)
J. Anderson et al.
Methodology
p-fair Scheduling
2
3
2002
2004
2006
A.Fedorova et al.
2006
John M. Calandrino
et al.
Co.Scheduling
Fair grained multi
threadeing
Cache -fair algorithms
Mega Tasks
2006
A Srinivasan et al.
2007
John M. Calandrino
et al.
Optimal-Rate
based Scheduling
Periodic Real-time
task Scheduling
Objective
Effective utilization of
resources
Performance
Performance Enhancement
Unique cache allocation
Effective utilization of
resources
Effective utilization of
resources
Provide good performance for non-realtime
tasks
Limitations
Not for multicore
Non-multicore
Not for large scale
systems
Specific to some
Architectures
Need better methods for grouping of
tasks
not for cache improving
For periodic tasks
only
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Related Work
Contd.
Sr.No. Year
8
2007
Author(s)
John M. Calandrino
et al.
Methodology
Global Schedulong
2008
Heuristics
10
2009
11
2010
John M. Calandrino
et al.
John M. Calandrino
et al.
Sergey Zhuravlev et
al.
12
2012
ESHMP Scheduling
Objective
Achiving better performance for large scale
systems
To improve Cache performance
To Enhance the L2Cache Performance
Contention for shared
resources on multicore
processors
To achive accuracy and
scalability
Limitations
restricted to one
type of problems
Oveheads should
be minimized
Cache reuse can be
better estimated
Affect
performance
degradation positively(or)
negatively
For Heterogeneous
multicore Systems
only
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Related Work
Contd.
Sr.No. Year
13
2013
Author(s)
Bryan C. Ward et al.
14
2013
Jeremy P. Erickson et
al.
15
2013
Methodology
Cache locking and
Cache scheduling
Global Schedulong
by spliting jobs
Objective
Making shared cache
more predictable
Reducing tardy ness
Global
-EDFLike(GEL)
Scheduling
Limitations
Theoretical
scheduling
Examin how to account for suspention based locking
protocol
survey paper
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
ENCAP
ENCAP Heuristics
Assumptions
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
ENCAP
ENCAP Heuristics
Assumptions
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
ENCAP
ENCAP Heuristics
Assumptions
Assumptions
we presume that load set is a set of many threaded tasks Ti ,
Where i=1,2,...n.
We assume that tasks are Organized Parallel Threaded
Tasks(PTTs).
Each PTT has a Stable Storage Region Set (SRS) that is shared by
all tasks within it.
The SRS is the region of memory referenced by tasks within a PTT the
size of this portion is called as the task size (TS) of the PTT.
PTTs are useful for specifying groups of mutual tasks.
P.Pavan Kumar (12ph0515)
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
ENCAP
ENCAP Heuristics
Assumptions
Re Co-Scheduling
(a)
(b)
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Re Co-Scheduling ...
(a)
ENCAP
ENCAP Heuristics
Assumptions
Contd.
(b)
Re Co-scheduling
Figure: Re Co-Scheduling
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
SESC
CACTI
LITMUS(RT)
Implementation IN SESC
Figure:
Implementation in SESC
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Figure:
SESC
CACTI
LITMUS(RT)
Contd.
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
SESC
CACTI
LITMUS(RT)
Implementation in CACTI
Figure:
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Figure:
SESC
CACTI
LITMUS(RT)
Contd.
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
SESC
CACTI
LITMUS(RT)
Implementation in LITMUSRT
Figure:
Performance Enhancements (Access Time and Cycle time estimation) of ENCAP on LITMUSRT on
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
SESC
CACTI
LITMUS(RT)
Figure:
Contd.
File selection Performance Enhancements (Access Time and Cycle time estimation) of ENCAP on
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Result Analysis
Table:
L2 cache miss ratio per load set(Max., Min., Avg.) and cache size of 14680064 bytes in ns
Sr.No.
1
Name Of Load
Set
NORMAL
TINY NORMAL
ONE COMBO
Pfair
89.35%
(1.65,1.65,1.65)
59.35%
(2.65,1.65,1.35)
11.06%
(7.55,4.65,3.29)
Megatask
2.18%
(10.78,10.74,10.25)
2.88%
(11.68,11.64,11.66)
0.88%
(6.8,5.9,5.9)
ENCAP
15.36%
(3.85,3.79,3.53)
17.63%
(1.85,1.81,1.82)
14.333%
(2.45,2.41,2.43)
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Result Analysis...
Contd.
Figure: Access time for shared cache memory size of 14680064 bytes in ns
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Result Analysis...
Contd.
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Result Analysis...
Contd.
Figure: Access time and Cycle time of shared cache memory size of
14680064 bytes in ns
P.Pavan Kumar (12ph0515)
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Figure:
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Figure:
Performance Enhancements (Access Time and Cycle time estimation) of Multi-core Distributed
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Figure:
Performance Enhancements (Access Time and Cycle time estimation) of Multi-core Distributed
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
35
30
2Core
4Core
8Core
16Core
32Core
30
2Core
4Core
8Core
16Core
32Core
25
25
Access Time
Cycle Time
20
20
15
15
10
10
5
0
10
80
60
(a)
40
20
0
10
80
60
40
20
No. of Tasks
No. of Tasks
(b)
Figure: Cycle time and Access time plot for 300 KB Storage Region Set
(SRS)
P.Pavan Kumar (12ph0515)
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
35
30
2Core
4Core
8Core
16Core
32Core
30
2Core
4Core
8Core
16Core
32Core
25
25
Access Time
Cycle Time
20
20
15
15
10
10
5
0
10
80
60
(a)
40
20
0
10
80
60
40
20
No. of Tasks
No. of Tasks
(b)
Figure: Cycle time and Access time plot for 600 KB Storage Region Set
(SRS)
P.Pavan Kumar (12ph0515)
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
35
30
2Core
4Core
8Core
16Core
32Core
30
2Core
4Core
8Core
16Core
32Core
25
25
Access Time
Cycle Time
20
20
15
15
10
10
5
0
10
80
60
(a)
40
20
0
10
80
60
40
20
No. of Tasks
No. of Tasks
(b)
Figure: Cycle time and Access time plot for 900 KB Storage Region Set
(SRS)
P.Pavan Kumar (12ph0515)
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
Future Work
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
References
+ X. Xiang, Bin Bao, Chen Ding and Kai Shen. Cache Conscious Task Regrouping on Multicore Processors.
Proc. of the 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing,
pp.603-611, IEEE/ACM, 2012.
+ J.Calandrino and J. Anderson. Cache-Aware Real-Time Scheduling on Multicore Platforms: Heuristics and
a Case Study. Proc. of the 20 th Euromicro Conference on Real-Time Systems, pp.299-308, IEEE, 2008.
+ J.Calandrino and J. Anderson. On the Design and Implementation of a Cache-Aware Multicore Real-Time
Schedule Proc. of the 21 st Euromicro Conference on Real-Time Systems, pp.194-204, IEEE, 2009.
+ N. Ramasubramaniam, V.V. Srinivas, and P. Pavan Kumar. Understanding the Impact of Cache
Performance on multicore Architectures. Proc. of International conference on Advances in Information
Technology and Mobile Communication(AIM-2011), pp.403-406, Springer-LNCS, 2011.
+ A. Bastoni, B.Brandenburg, and J.Anderson. An Empirical Comparison of Global, Partitioned, and
Clustered Multiprocessor EDF Schedulers. Proc. of 31st Real-Time Systems Symposium (RTSS),
pp.14-24, IEEE, 2010.
+ John M. Calandrino,Dan P. Baumberger, Tong Li, and James H. Anderson. Soft Real-Time Scheduling
on Performance Asymmeric multocore Platforms. In Proc. of the the 20th IEEE Real-Time and
Embeeded Technologyand Applications Symposium(RTAS07), 2007.
+ U. Devi and J. Anderson. Tardiness Bounds under Global EDF Scheduling on a Multiprocessor.
Real-Time Systems , Volume 38, Issue 2, pp. 133-189, February 2008.
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References
References ...
Contd.
Introduction
The idea
Literature review
Methodology
Evaluation
Result Analysis
Case Study
Future Work
References