Scalability AOSA Presentation

292 views

Published on

Published in: Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
292
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
13
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide
  • If a node goes missing/down, the system will need to pull data from the datastore– data will still be there but performance will just be slighted affected
  • - Possible algorithms could be picking random nodes, round robin, or selecting nodes based on a criteria
  • Scalability AOSA Presentation

    1. 1. Scalable Web Architecture and Distributed Systems Gloria Chow, Jacqui Killow, Peter Moon, Jessica Wong
    2. 2. Introduction to Large-Scale Web Systems The design of large-scale web systems is influenced by six key principles:  Availability  Performance  Reliability  Scalability  Manageability  Cost
    3. 3. Introduction to Large-Scale Web Systems Four core factors are central to almost all large web applications:  Services  Redundancy  Partitions  Failure Handling
    4. 4. Core Factors of Large WebSystems Services  Increase scalability by separating services so that each service has its own function  Interactions outside of the service’s context are handled by an abstract interface  This is called “Service-Oriented Architecture (SOA)” Redundancy  The server needs to be able to create redundant copies of data in case of data loss
    5. 5. Core Factors of Large WebSystems Partitions  When performance degrades, more resources should be added  Systems can:  scale vertically: add more resources to the server (e.g. increasing capacity)  scale horizontally: add more servers Failure Handling  System should be able to recover from errors and faults
    6. 6. Achieving Fast and Scalable Data Access By providing fast access to data, services also become faster and more scalable. There are many options available for increasing the speed of data access:  Caches  Proxies  Indexes  Load Balancers  Queues
    7. 7. Caches Similar to short-term memory A limited amount of storage space Only contains the most recently-accessed items Faster than accessing the original data source Used in all levels of architecture  Most commonly found near the front end Two types of cache: Global vs. Distributed
    8. 8. Global Cache Involves adding a server or a file store that is faster than the original storage and accessible by all request nodes Request nodes query the cache in the same way they would query a local storage There are two ways a global cache can be set up
    9. 9. Two types of Global Cache: 1. Cache is responsible for retrieval of data.Request For ea ch I f t he da t a wa s Node r equest , t he not in t he ca che, r equest node t he ca che wil l wil l check t he pul l t he da t a ca che f ir st . f r om t he or iginRequest a nd t hen keep it Node f or f ut ur e r equest s. Gl oba l Cache Dat aRequest NodeRequest Node
    10. 10. Two types of Global Cache: 2. Nodes are responsible for retrieval of data. 1. For ea ch r equest , t he r equest node wil l 3. When da t a is check t he gl oba l r et r ieved f r om ca che f ir st . Gl oba l Ca che t he or igin, it ca nRequest be a dded t o t he Node ca che.Request Node Da t aRequest Node 2. I f t he da t a wa s not in t he ca che, t hen t he Request Node wil lRequest r et r ieve it f r om t he or igin. Node
    11. 11. Distributed Cache Each node owns Request Node The node checks t he part of the cached Cache A cache based on an it em key obt ained by data using a hash al gor it hm and t hen Request Node t he dat a or igin. Uses a hashing function so nodes Cache B can quickly find Dat a Request Node the data they need Cache C Storage space Request Node can easily be increased just by Cache D adding more nodes
    12. 12. Proxies Coordinates requests from Request A Request multiple clients and Node relays them to the backend Request A Request A Request Data Can speed up data Node access by grouping similar requests and Request A Request Proxy treating it as one Node Server (“collapsed- forwarding”)
    13. 13. Indexes A table that stores Index Memor y the location of data Locat ion 0 Dat a Locat ion A Stored in memory or somewhere local A 0 Locat ion 1 B- par t 1 to incoming B- par t 2 B 1 B- par t 3 requests Locat ion 2 Increases speed of C 2 C data reads Locat ion 3 D 3 Data writes are D slower because the index must be updated for each read
    14. 14. Load Balancers Distributes Request Node load across a Request A Request B set of nodes responsible for handling Request B Load Bal ancer (LB) Request C Request requests Node Algorithms Request C determine Request A how to to distribute Request Node requests
    15. 15. Queues Queue Incoming requests are Task 1 added to a Running Task queue and are Task 2 Task 1 taken off when Task 3 the server has Task 2 processed it Task 4 Allows clients to work Task 5 asynchronousl y
    16. 16. Summary The six principles that govern the design of large web systems are: availability, performance, reliability, scalability, manageability, and cost. Services, redundancy, partitions, and failure handling are core factors common in almost all large web systems. Caches, Proxies, Indexes, Load Balancers and Queues are all used to increase the speed of data access. Multiple methods can be used together in one web system.
    17. 17. Questions?

    ×