The virtuous circle of data

... significantly in gathering vast amounts of data, yet they still struggle to extract insights, put them to work for the business and create truly data- driven organisations The virtuous circle of data explores ... empowering employees to create a data- centric culture Looking forward 11 Appendix: Survey results 12 © The Economist Intelligence Unit Limited 2 014 The virt...

Ngày tải lên: 04/12/2015, 00:25

Ngày tải lên: 04/12/2015, 00:25

... of your data center The Three Principles of Data Center Infrastructure Design The Three Principles of Data Center Design When you understand the three principles of data center design, you are ... The Three Principles of Data Center Infrastructure Design Choosing the Right Mix of Equipment Since the total spend for network...

Ngày tải lên: 24/01/2014, 11:20

... 0-7923-997 1-4 DATABASE ISSUES IN GEOGRAPHIC INFORMATION SYSTEMS, Nabil R Adam, Aryya Gangopadhyay ISBN: 0-7923-9924-2 THE FRACTAL STRUCTURE OF DATA REFERENCE Applications to the Memory Hierarchy ... ADVANCED DATABASE SYSTEMS, Elisa Bertino, Beng Chin Ooi, Ron Sacks-Davis, Kim-Lee Tan, Justin Zobel, Boris Shidlovsky, Barbara Catania ISBN: 0-7923-9985-4 INDEX DATA STRUCTURES IN O...

Ngày tải lên: 03/07/2014, 08:20

... THE FRACTAL STRUCTURE OF DATA REFERENCE viii First-Cut Performance Estimate Impact of Transient Data Access History Dependent Collection TRANSIENT AND PERSISTENT DATA ACCESS Transient ... x THE FRACTAL STRUCTURE OF DATA REFERENCE 1.16 1.17 1.18 1.19 1.20 2.1 2.2 2.3 4.1 6.1 6.2 7.1 7.2 7.3 7.4 7.5 7.6 7.7 7.8 7.9 7.10 7.11 7.12 7.13 7.14 7.15 IMS storage pools: distr...

Ngày tải lên: 03/07/2014, 08:20

... the average time until the next reference becomes unbounded There is no steady-state arrival rate This xvi THE FRACTAL STRUCTURE OF DATA REFERENCE modeling approach reflects the opposite of the ... to exploit them to best advantage The emphasis of the book will be on the practical applications of such results The focus of the applications examined in this b...

Ngày tải lên: 03/07/2014, 08:20

... the arrival rate of requests THE FRACTAL STRUCTURE OF DATA REFERENCE to a given track equals its probability of being referenced times the overall rate of requests) Given these assumptions, there ... percent of the total requests are to data contained in the busiest ten percent of the tracks Since the beginning of the sorted list represents the best pos...

Ngày tải lên: 03/07/2014, 08:20

... exact rather than approximate, then this presentation of the data should result in a variety of straight lines; the slope 10 THE FRACTAL STRUCTURE OF DATA REFERENCE of each line (in the chart’s ... complete the journey between towns, it must take tracks containing all types of data about the same amount of time to get from the top to the bottom ofthe LRU...

Ngày tải lên: 03/07/2014, 08:20

... 12 THE FRACTAL STRUCTURE OF DATA REFERENCE cache visits, we then calculate the resulting memory requirements Finally, we illustrate these results by assessing the effectiveness of typical ... share a common drawback: their scope of application excludes a substantial period of time at the beginning of the trace For the former, the time excluded is equal to τ; for...

Ngày tải lên: 03/07/2014, 08:20

... planning Let us, therefore, consider the impact of the average residency time on the performance experienced by a wide range of cached data Figures 1.4 through 1.10 present the performance of a “plain ... substitutions to express the miss ratio as a function of cache size Just as the miss ratio, as a function of the single-reference residency time, takes the form...

Ngày tải lên: 03/07/2014, 08:20

... demotion of sequential data residing in the cache; the memory for such data is typically freed long before the data would have progressed from the top to the bottom of the LRU list Storage controls ... stage the contents of a standard track image, from the requested record to the end of the track) Then using the typical configuration just suggested, (1.20)...

Ngày tải lên: 03/07/2014, 08:20

... with the same value of τp across the entire storage pool, we should expect to see a sharp transition at the point where the single-reference residency time of the cache assumes this value The ... Nevertheless, the mathematical model (1.4), with suitable calibration of θ and a, can still be used to produce a serviceable approximation of the miss ratios in the lower me...

Ngày tải lên: 03/07/2014, 08:20

... distinct workloads 34 THE FRACTAL STRUCTURE OF DATA REFERENCE Notes Assumes a track belonging to the 3380 family of storage devices Assumes a track belonging to the 3390 family of storage devices ... 32 THE FRACTAL STRUCTURE OF DATA REFERENCE Figure 1.19 Figure 1.20 OS/390 system storage pools: distribution of track interarrival times OS/390 system storage pools...

Ngày tải lên: 03/07/2014, 08:20

... identical to the probability of requesting any other leaf of the same subtree, namely 2-Hhi Putting the same fact in a different way, it is the lowest value of 2-H achieved in n trials of the random ... selected at step i + n, and 38 THE FRACTAL STRUCTURE OF DATA REFERENCE these are the only leaves that can be selected By symmetry, it follows that the probabili...

Ngày tải lên: 03/07/2014, 08:20

... 42 THE FRACTAL STRUCTURE OF DATA REFERENCE A general-purpose technique exists for generating synthetic patterns of reference, which is also capable of producing references that conform to the ... projected independently of any other pools served by the cache In the first subsection of the chapter, we examine this hypothesis more closely It leads directly to the nee...

Ngày tải lên: 03/07/2014, 08:20