Assume a computer has on-chip and off-chip caches, main memory and virtual memory. Assume the following hit rates and access times: on-chip cache 95%, 1 ns, off-chip cache 99%, 10 ns, main memory: X%, 50 ns, virtual memory: 100%, 2.5 ms. Assume that an acceptance effective access time is 1.6 ns. What should X be (the percentage of page faults) to ensure that EAT is no worse than 1.6 ns?
The Graphs subject was introduced in Discrete Mathematics, It has nodes and
edges, both edges and nodes can have names, and you can give weight for the
edge. Instead of drawing the graph we need you to give description of the graph by words “Graph language” . such as
Draw a node named XXXX at position YYYY
Link between XXXX and ZZZZ named LLLLL
The weight of LLLLL is 4
Find the degree of XXXX
Find the incident of LLLLL
Find possible paths between XXXX and YYYY
This might be a program for a computer based language for drawing and dealing
with graphs . now
Write the BNF and attribute grammar for such proposed language