previous year qp
TRANSCRIPT
-
8/12/2019 Previous Year QP
1/7
J-e
b#
v'DAai'
\^- t *"t'
(a)
A static
allocation
scheme
means
"no
swapping
to disk".
However,
discuss
one
disadvantage
with this
scheme
I
t?l
(b)
A sophisticated
method
would be
known
as
'bdoe,n*ryftwutbE
the
apprddffi:.t4l='=
:
The MMU consists
of
a hardware
page
table:walkerwhich
is responsible
for fllling
the
(generally,
multi-level)
page
table
in
physical;memory.
Also
in
virtualized
environments,
address
space
switches
should
not lead
to
rdbuilding
of the
shadow
page
table,
every
time.
This means
that
MMU,
irf,control
of
the
VMM,
should
detect
whenever
the
guest
modifies
a
page
table
entry
which
is currently
mapped
to
a shadow
page
table
entry'
Describe the
tracing
technique
adopted
by
VMMs' t3l
i
A system having virtual
memory
with paging,offers
a
memory access time 350
ns and
a
hit
ratio of 80o/o.
Let the
TLB
access
time
is 50
ns and
swap-in
and
swap-out
cost
are
1
s
(a)
Calcutate
the
effective
memory
access
time
if
no
page
fault
occurs.
t1l
(b)
Calculate
the
effective
memory
access
time
if
page
fault
occurs
at a
rate
1/1OOO'
t4l
],-
k
)'
L*
w
n
"'x"'ff*{l\*
w*+39*tn/t'./Ylte43s)
\
roL
09
\- ,*
-
8/12/2019 Previous Year QP
2/7
Department
of
Computer Science,
Cochin University of Science
and
M.Tech. Firstsemesfer
Examination, December
2012
PARTJ
Answer
allquestions.
cSC3106:
VIRTUALIZED
SYSTEMS
Iechnology
jiMax
marks:40
Mdk
time: 3
hours
i
i'
i'
i
:l
1. A host machine
having
four
six-cor.e
processors,
192 GB
memery and 800
GB disk is
pirovided
to
run
sor,
4
GB memory
and
any
virtual instances with
each instance having
a
configuration
of one
procesl
50
GB disk storage.
How
many
minimum instances
are
possible?
t5l
The server
administrator, after
analysing
the system
usage scenarios;
decides
to 600/o bver-commit
the
disk
storage. How
many instances
can be
provisioned
after
the reconfiguration?
l.
[3]
2. A key benefit of
virtualization
is
the
ability
to
run multiple'OSs on
a
single
physical
system
and
share
the underlying
hardware
resources.
There are
different approaches
used
in virtualizatiOln
in order to
meet this benefit.
(a)
Name
the approaches.
(b)
Briefly outline the
approaches.
(c)
Compare
between the
approaches.
PART]I
Answer
any 5
quesfions.
Each
one
canies
5
marks.
3.
To
virtualize CPU,
the
hypervisors often
do
not attempt
a complete emulation
of
the CPU
itself but
rather
would create
the so-called
virtual CPUs
to
execute
the instructions
sent by the
virtual machines.
lllustrate the
role
played
by the hypervisor
assuming
that the
physical
CPU
consists of
many multicore
processors
4.
(a)
Give
a
method to test
whether the
host
CPU architecture
is
readily virtualizable.
121
[2.5]
[2.5]
Page 1 of
2
-
8/12/2019 Previous Year QP
3/7
/
(b)
Explain the binary
tran5lation approaches
for virtualizable
lntel x86 architecture:
5.
"VMMs
may ernploy
different
strategies
for
memory allocation
across
the
VMs while
they
are
(a)
A static allocation
scheme
means
"no
swapping
to
disk".
However,
discuss one
disadvantage
with
this scheme.
d method
would be
[
1".
Describe
the
approach.
b)
A sophisticated
method
would be known
as
"ballooning
6.
(a)
Explain the
use of
shadow
page
tables
as employed
in
virtualized
systems.
(b)
Mrtual machine monitor should
be able
to detectrwhenever
the
guest
modifies a
page
table
entry
mapped to a
shadow
page
table.
Describe
one
technique used
for:
implementing this
control.
7.
(a)
Write a short
note on
the
importance
of
virtualization.
(b)
The
forbes.com offers
online
real-time
stock market
data.
They host the
servers
atAmazon
elastic
cornpute cloud, and
provision
the
servers
every
day
and de-provision
them every
night
and
let
Amazon
worry
abouttlre
hanlwae,
WH,ge
tte.$pi@l
benefits that
would
have driven
forbes.com to
the business
model?
8.
Write short
notes on:
:
(a)
Desktop virtualization
(aka
Client
virtualization)
(b)
Application
virtualization
9.
Describe the
basic scheme
for
memory
virtualizatio:n.
How
is
the
TLB
vitualization
accomplished?
,/
/
10.
Pari3y
provides
the
protection
similar to
that
provided
by
mirroring,
but
with less overhead.
Explain
the
parity
calculation
technique
as
implemented
in RAID-5.
----\r----
---,r\--r-
-
8/12/2019 Previous Year QP
4/7
-
8/12/2019 Previous Year QP
5/7
M.Tech Degree
I Semester examination
Dec 2012
Computer
& Information
Science / Software Engineering
CSC
3102
PARALLEL
COMPUTER ARCHITECTURE
Time
:
3
hours
Maximum 40
marks
Answer
all
questions;
all
questions
carry equal
marla
I
a)
Explain
the concept of Pipelining
with
a
comparison
of
throughput
with
respect
to
pipelined
and non-pipelined
system.
b) What is
a
multifunction
pipeline?
How
do
you
speciff
typical
functions
in such a
system?
toRt
z
c) Explain
the role
of Reservation Table in Pipelined
systems.
-
d) For
a
Pipelined
System,
get
the
expressions for Speed-up
and
effrciency.
II
a)
Explain
the concept of
multilevel
cache. What is cache
coherence?
b)
Bring
out the
advantages
you
derive in
having
cache and virtual
memory.
'oR,
_
c) What is the
need
of Memory
management
in
a
processing
system?
(
d)
Explain
any one
page
replacement
algorithm.
III
a)
/b)
'oR'
c)
d)
IV
a)
b)
toRt
c)
/d)
V
a)
Mention
the
basic classification of Computer Architecturtes
Compare and contrast Contol Flow and Data
Flow
Explain
the terms Multithreading
and
Multiprocessing.
What is
a
Multi-core
Processor?
Mention how
it
improves performance.
Mention the
characteristic
features
of
GPU in comparison
with
CPU
What is
GPGPU?
List four
applications
where
GPGPU is appropriate
Bring
out the concept of
Virtual
Machine.
List the resources
that
have
to be emulated
in
a
Virtual
Machine.
Write
a brief note on any two:
Open CL b)
CUDA
Architecture
c)
lnstruction Level Parallelism.
-:0:-
-
8/12/2019 Previous Year QP
6/7
-RSITY
OF
SCIENCE
AND
TECHNOLOGY
COCHIN
UNIVE
DEPT.
OF COMPUTER
SCIENCE
MTech
I't-
Semester
Examination
(Answer
all
questions)
Time:03:00
hrs
Max.Marks:40
1.
(A) Given
that
v1
=(2,-1,0)
v2=(1
'O'-1)
vl=(3'7'-1)
is
a
basis
for
R3
'Construct
an
orthogonar
u"ri,
,iing'Gram-schmidt
process'
(8)
OR
(B)
Define
basis.
Determine
the
following
sets
of
vectors
will
be
a
basis
tor
IRr
(8)
2.
(AXa)
Check
whether
the
foltowing
statehients
are
true
or
false'
Justify
your
answer-
i)
Let
Q(x)
:
x+1