Imagine a CDN configured as a caching hierarchy, with end users accessing content from edge caches, which fetch the content for a parent cache upon a cache miss, and so on up to a root cache, which ultimately fetches content from an origin server. What metrics would guide provisioning decisions to (a) add more storage capacity to a given cache versus (b) adding an additional level to the caching hierarchy.

Imagine a CDN configured as a caching hierarchy, with end users accessing content from edge caches, which fetch the content for a parent cache upon a cache miss, and so on up to a root cache, which ultimately fetches content from an origin server. What metrics would guide provisioning decisions to (a) add more storage capacity to a given cache versus (b) adding an additional level to the caching hierarchy.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

For the questions 12 thru 27, consider two relations called R1 and R2. The number of tuples in R1 and R2 are tị and t2 respectively. The number of attributes of R1 and R2, on the other hand, are a, and a2. (t1, t2, a1, az >= 1). Answer the following questions. >3D | 12. what would be the minumum number of tuples the result will contain If we apply SELECT * FROM R, WHERE ..... a) 0 b) 1 c) t1 d) t2 e) t1 + t2 f) t1 * t2 | 13. what would be the maximum number of tuples the result will contain If we apply SELECT FROM R, WHERE .. .... a) 0 b) 1 c) t1 d) t2 e) t1 + t2 f) t1 * t2 | 14. what would be the minumum number of attributes the result will contain If we apply SELECT * FROM R, WHERE .. а) 0 b) 1 c) a1 d)az e) a1 + a2 f) a1 * a2 15. what would be the maximum number of attributes the result will contain If we apply SELECT * FROM R, WHERE .. a) 0 b) 1 c) a1 d)az e) а1 + az f) a1 * a2 16. Assuming that R1 and R2 are union-compatible, If we UNION R1 and R2 relations, what would be the…
help
Define Direct cache mapping, Associative mapping, Set associative mapping. Compare their advantages and disadvantages.
Separate a direct mapped cache from a completely associative cache.
It would be of great assistance if you could describe how one of the cache protocols is utilized in the way in which it was designed to be used.
Compare directly mapped and completely associative caches.
Discuss the challenges of creating an optimal cache replacement approach for all addresses.
Give two reasons why caches are useful. What problems do they solve? What problems do they cause? If a cache can be made as large as the device for which it is caching (for instance, a cache as large as a disk), why not make it that large and eliminate the device?
I would appreciate it if you could describe how one of the cache protocols works within.
In a log entry, which fields are available to the log processing function? Assuming 64-byte cache blocks and no prefetching, how many cache misses does the following code cause on average for each entry?
Give two reasons why caches are useful. What problems do they solve? What problems do they cause? If a cache can be made as large as the device for which it is caching (for instance, a cache as large as a disk), why not make it that large and eliminate the device?
What are the miss rates for 64 KiB data caches with varied set associativity, broken down by miss type (cold, capacity, and conflict misses) for each benchmark?