Temporal and Spatial Locality: A Time and a Place for Everything Rick Bunt University of Saskatchewan Carey Williamson University of Calgary.

Slides:



Advertisements
Similar presentations
W3C Workshop on Web Services Mark Nottingham
Advertisements

Consistency and Replication Chapter 7 Part II Replica Management & Consistency Protocols.
October 15, 2002MASCOTS WebTraff: A GUI for Web Proxy Cache Workload Modeling and Analysis Nayden Markatchev Carey Williamson Department of Computer.
CMPE 421 Parallel Computer Architecture MEMORY SYSTEM.
Workloads Experimental environment prototype real sys exec- driven sim trace- driven sim stochastic sim Live workload Benchmark applications Micro- benchmark.
1 Network Traffic Measurement and Modeling Carey Williamson Department of Computer Science University of Calgary.
1 Improving the Performance of Distributed Applications Using Active Networks Mohamed M. Hefeeda 4/28/1999.
 Firewalls and Application Level Gateways (ALGs)  Usually configured to protect from at least two types of attack ▪ Control sites which local users.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
October 14, 2002MASCOTS Workload Characterization in Web Caching Hierarchies Guangwei Bai Carey Williamson Department of Computer Science University.
The Internet Useful Definitions and Concepts About the Internet.
Improving Proxy Cache Performance: Analysis of Three Replacement Policies Dilley, J.; Arlitt, M. A journal paper of IEEE Internet Computing, Volume: 3.
1 Internet Protocols and Network Performance Issues Carey Williamson iCORE Professor Department of Computer Science University of Calgary.
Network Traffic Measurement and Modeling CSCI 780, Fall 2005.
Internet Cache Pollution Attacks and Countermeasures Yan Gao, Leiwen Deng, Aleksandar Kuzmanovic, and Yan Chen Electrical Engineering and Computer Science.
Copyright © 2005 Department of Computer Science CPSC 641 Winter Network Traffic Measurement A focus of networking research for 20+ years Collect.
CS 524 (Wi 2003/04) - Asim LUMS 1 Cache Basics Adapted from a presentation by Beth Richardson
1 Networking A computer network is a collection of computing devices that are connected in various ways in order to communicate and share resources. The.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 34 – Media Server (Part 3) Klara Nahrstedt Spring 2012.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Web Caching and Content Delivery. Caching for a Better Web Performance is a major concern in the Web Proxy caching is the most widely used method to improve.
Systems I Locality and Caching
A Brief Taxonomy of Firewalls
Achieving Load Balance and Effective Caching in Clustered Web Servers Richard B. Bunt Derek L. Eager Gregory M. Oster Carey L. Williamson Department of.
Lecturer: Ghadah Aldehim
Design and Implement an Efficient Web Application Server Presented by Tai-Lin Han Date: 11/28/2000.
Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.
Introducing the Internet Source: Learning to Use the Internet.
1 Chapter 6: Proxy Server in Internet and Intranet Designs Designs That Include Proxy Server Essential Proxy Server Design Concepts Data Protection in.
Chapter 1: Introduction to Web Applications. This chapter gives an overview of the Internet, and where the World Wide Web fits in. It then outlines the.
Copyright © 2002 Pearson Education, Inc. Slide 3-1 CHAPTER 3 Created by, David Zolzer, Northwestern State University—Louisiana The Internet and World Wide.
Infrastructure for Better Quality Internet Access & Web Publishing without Increasing Bandwidth Prof. Chi Chi Hung School of Computing, National University.
Networks – Network Architecture Network architecture is specification of design principles (including data formats and procedures) for creating a network.
Networks QUME 185 Introduction to Computer Applications.
Protocol(TCP/IP, HTTP) 송준화 조경민 2001/03/13. Network Computing Lab.2 Layering of TCP/IP-based protocols.
Web Cache Replacement Policies: Properties, Limitations and Implications Fabrício Benevenuto, Fernando Duarte, Virgílio Almeida, Jussara Almeida Computer.
Lecture#1 on Internet. Internet Addressing IP address: pattern of 32 or 128 bits often represented in dotted decimal notation IP address: pattern of 32.
The Inter-network is a big network of networks.. The five-layer networking model for the internet.
Web Performance 성민영 SNU Computer Systems lab.. 2 차례 4 Modeling the Performance of HTTP Over Several Transport Protocols. 4 Summary Cache : A Scaleable.
Internet Real-Time Laboratory Arezu Moghadam and Suman Srinivasan Columbia University in the city of New York 7DS System Design 7DS system is an architecture.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
1 UNIT 13 The World Wide Web Lecturer: Kholood Baselm.
Introduction to Internet. Chapter 1 Objectives Origins of the Internet Packets and Routers TCP/IP DNS HTTP URL Client-Server.
Multimedia and Networks. Protocols (rules) Rules governing the exchange of data over networks Conceptually organized into stacked layers – Application-oriented.
World Wide Web “WWW”, "Web" or "W3". World Wide Web “WWW”, "Web" or "W3"
CS1001 Lecture 7. Overview Computer Networks Computer Networks The Internet The Internet Internet Services Internet Services Markup Languages Markup Languages.
Search Engine using Web Mining COMS E Web Enhanced Information Mgmt Prof. Gail Kaiser Presented By: Rupal Shah (UNI: rrs2146)
정하경 MMLAB Fundamentals of Internet Measurement: a Tutorial Nevil Brownlee, Chris Lossley, “Fundamentals of Internet Measurement: a Tutorial,” CMG journal.
Lecture 4 Mechanisms & Kernel for NOSs. Mechanisms for Network Operating Systems  Network operating systems provide three basic mechanisms that support.
Reading TCP/IP Protocol. Training target: Read the following reading materials and use the reading skills mentioned in the passages above. You may also.
MiddleMan: A Video Caching Proxy Server NOSSDAV 2000 Brian Smith Department of Computer Science Cornell University Ithaca, NY Soam Acharya Inktomi Corporation.
IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo a, Jose G. Delgado-Frias Publisher: Journal of Systems.
INTRODUCTION TO THE INTERNET Internet Protocol Cameras Training: Session 1.
#16 Application Measurement Presentation by Bobin John.
1 IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo, Jose G. Delgado-Frias Publisher: Journal of Systems.
1 Internet Traffic Measurement and Modeling Carey Williamson Department of Computer Science University of Calgary.
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
1 UNIT 13 The World Wide Web. Introduction 2 Agenda The World Wide Web Search Engines Video Streaming 3.
1 UNIT 13 The World Wide Web. Introduction 2 The World Wide Web: ▫ Commonly referred to as WWW or the Web. ▫ Is a service on the Internet. It consists.
18-1 PRENTICE HALL ©2008 Pearson Education, Inc. Upper Saddle River, NJ FORENSIC SCIENCE An Introduction By Richard Saferstein.
Ramya Kandasamy CS 147 Section 3
The Impact of Replacement Granularity on Video Caching
E-commerce | WWW World Wide Web - Concepts
E-commerce | WWW World Wide Web - Concepts
Web Development & Design Chapter 1, Sections 4, 5 & 6
Distributed Systems CS
Introduction to Computer Concept
Lecture 2: Overview of TCP/IP protocol
Lecture 3: Secure Network Architecture
Presentation transcript:

Temporal and Spatial Locality: A Time and a Place for Everything Rick Bunt University of Saskatchewan Carey Williamson University of Calgary

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 2 of 29 Roll the credits …  Roberta Bodnarchuk  Milind Deshpande  Kevin Froese  Neeraj Gulati  Sung Hung Ling  Shikharesh Majumdar  Shane McDonald  Jennifer Murphy  Adeniyi Oke  Judy Peachey

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 3 of 29 Outline 1. What is locality 2. Elements of locality 3. Types of locality 4. Applications of locality 5. Changing locality 6. Concluding remarks

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 4 of 29 What is Locality  Parachor Curve  “during any interval of execution, a program favors a subset of its pages, and this set of favored pages changes slowly” [Denning 1970] An empirically observed phenomenon that has substantial intuitive appeal and numerous practical implications

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 5 of 29 Impact of Locality  Acceptable page fault rates can be achieved even when the memory allocated to a program is much less than that required to store all of its pages  Internet routers can make high speed routing decisions with very modest forwarding caches  Mobile users can work with remotely stored files even though they are located far from the file server

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 6 of 29 Known Aliases  The law of scattering  The principle of least effort  The rule  Concentration of productivity  The law of diminishing returns

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 7 of 29 The Underlying Concept  There is a very large population of items, many more than we can manage  There is a small core of relevant items on which we can productively focus our attention  This core will continue to be relevant long enough to justify our attention

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 8 of 29 Locality Through the Ages  Bradford’s Law of Scattering [1934]  Zipf’s Principle of Least Effort [1949]  Many applications before we discovered it  population distribution, distribution of wealth, distribution of biological species, article distribution in journals, and word usage in natural language.  has been used to plan the location of libraries and other facilities, to model the popularity of television programs, and to order search keys in hashing tables

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 9 of 29 Elements of Locality  Concentration:  Persistence: [Bunt and Murphy 1984] [Arlitt and Williamson 1997]

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 10 of 29 Types of Locality  Temporal Locality:  Clustering in time: items referenced in the immediate past have a high probability of being re-referenced in the immediate future  Spatial Locality:  Clustering in space: items located physically near an item referenced in the immediate past have a high probability of being re-referenced in the immediate future

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 11 of 29 Visualizing Locality  The memory map [Hatfield and Gerald 1971]

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 12 of 29 Visualizing Locality  Locality curves: An intrinsic measure [Bunt and Murphy 1984]

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 13 of 29 Visualizing Locality  The Zipf Distribution [Oke and Bunt 2002]

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 14 of 29 Applications of Locality  Memory management  File systems  Networks  Web applications

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 15 of 29 Applications in Memory Management  Various approaches to memory management address the principles of locality in different ways:  Recency-based replacement policies such as LRU appeal to the presence of temporal locality in a memory reference pattern.  Fetch policies that bring in adjacent items along with the item requested appeal to spatial locality.  Hit ratios are high when good choices are made.

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 16 of 29 Program Behaviour  We know how our programs are structured – program behaviour tells us how they execute  Considerable interest throughout the 1960’s, 70’s and 80’s  in measuring the referencing behaviour of executing programs  in developing models of this behaviour  in informing the design of approaches to manage resources

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 17 of 29 Applications in File Systems  Some examples:  Rodriguez-Rosell [1976] – an early empirical study of locality properties in database references  Smith [1981] – characterized long-term file reference behaviour with a focus on file migration  Williamson and Bunt [1986] – characterized short-term file reference behaviour with a focus on file system management  Majumdar and Bunt [1986 ] – evidence of phase behaviour in file reference traces  Smith [1978], Kearns and DeFazio [1983, 1989] and Verkamo [1985] – locality properties in database references

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 18 of 29 Applications to File Caching  Locality properties have been exploited successfully in the development of the caching techniques that are common in today’s distributed file systems.  Applications to mobile computing  Froese and Bunt [1999] explored the application of temporal locality in the design of optimistic caching techniques to support the file system activities of mobile users  Lindsey et al. [2003] reported evidence of spatial locality in the usage patterns on a campus wireless network

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 19 of 29 Applications in Networks  Even on early networks, measurements showed that packet traffic patterns are far from random  structural properties in the network packet behaviour reflect the particular applications, protocols, and network technologies being used temporal correlations in the timing structure of the packet arrival process spatial correlations in the destinations seen in consecutive (or nearly consecutive) packets on the network  These structural characteristics arise from large application-layer messages (such as those that result from file transfers), that require multiple network-layer packets for transport on the network, and from the bidirectional exchanges of data packets and acknowledgement packets typical in reliable data transfer protocols such as TCP

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 20 of 29 Train Spotting  Jain and Routhier [1986] proposed the packet train model for network traffic characterization based on observations of correlated arrivals  provided both a descriptive mechanism for understanding network traffic patterns and a generative mechanism for network traffic modelling  A packet train is a sequence of related network packets that traverse the network like train cars behind a steaming locomotive  characterized by short (often deterministic) inter-arrival times between the consecutive packets of a train, with slightly longer (and more random) inter-arrival times between trains

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 21 of 29 Locality in Web Traffic [Arlitt and Williamson 1997]

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 22 of 29 Application to Document Caching  Effective caching of Web documents can significantly lower the number of requests processed by a Web server, reduce the packet traffic volume on the Internet backbone, and improve the user- perceived Web response time.  Locality is the key to success  Temporal locality in Web accesses implies that Web objects accessed in the recent past are likely to be accessed again (perhaps by some other client) in the near future.  Spatial locality in Web accesses reflects Web page structure (i.e., multiple related Web objects) or geographic correlations in the surfing behaviour of Web users.  Caching can be applied at the servers, at the clients, or at proxies

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 23 of 29 Exploiting Locality in Web Requests  Temporal locality  To the extent that temporal locality is present, recency-based policies such as LRU can be effective for a Web cache.  Spatial locality  Pre-fetching can be successful if spatial locality is present. The persistent connection feature of HTTP exploits the fact that multiple Web objects are often requested consecutively from the same Web server.  Spatial locality can also reflect geographic correlations in the surfing behaviours of Web users, and can make geographic caching and content distribution networks effective.

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 24 of 29 Changing Locality Characteristics  Intentionally: Program restructuring  Inadvertently: Filtering locality

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 25 of 29 Program Restructuring  The basic premise  improving the locality of a program will improve its performance  A variety of methods were proposed to do this  (Replacement) strategy-based methods  Strategy-independent methods  The basic idea  divide the program’s address space into small blocks  cluster the blocks onto pages according to the dynamic reference characteristics (via restructuring graph).

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 26 of 29 Effects of Restructuring Restructuring improves locality: Restructuring improves performance: [Bunt and Murphy 1984] [Peachey, Bunt and Colbourn 1985]

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 27 of 29 Damaging Locality  The locality characteristics of an arriving request stream can be damaged in two ways:  The interleaving of independent request streams (the aggregration effect)  The removal of “hits” by upstream caches (the filtering effect)  This presents problems for traditional approaches to cache management

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 28 of 29 The Cache Filter Effect [Froese and Bunt 1996]

December 6, 2003 Temporal and Spatial Locality: A Time and a Place for Everything Slide 29 of 29 Concluding Remarks  Locality has returned great value  helps us to understand why certain approaches to resource management are effective (or ineffective)  inspires new approaches to managing resources  Productive application across a wide range of domains reflects that locality speaks to a basic behavioural property (“concentration of productivity”)  Should be, and will continue to be, an important research topic