An Enterprise System should be Highly Scalable,Always Available, Easily Manageable, FastPerformer, Auto-Healer and Capable...
If the data are hierarchical in nature - we can leverage a Graph Database (MonogoDB) which is asopposed to conventional sq...
period. This saves lot of time spent in Index Arrangement and Sequential Updation.Say you want to search – Blue Sony mp3 p...
Here come the ultimate offering from Spring - has a solution for combining l...
-- The thread should perform the operation in background (it may communicate to LRU cacheoptimized for concurrent access /...
Normally automation is driven though Centrallized Logging System and Self-organization ArtificialIntelligence. BI tools ar...
Upcoming SlideShare
Loading in …5

Best Practices For Enterprise System Architecture Part 1


Published on

1 Like
  • Be the first to comment

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

Best Practices For Enterprise System Architecture Part 1

  1. 1. An Enterprise System should be Highly Scalable,Always Available, Easily Manageable, FastPerformer, Auto-Healer and Capable of SuperFast Searching and Intelligent Analysis throughMachine Learning.Scalability means the system does not downgrade even when load increases multiple times.For example, when number of users of an ecommerce system increases heavily further leading tosudden increase in transactions per user, the system should still keep performing with same SLAand handle the traffic smoothly ensuring that business is not down.One of the design choice for large-scale system is to scale out horizontally. Create one DB perEntity (User/ Item/ Product) and store only Key-Value in that table. Replicate the DB in variousmachines and implement a scheme for data-sharding.For example, in the Modulo(Entity_Pky, 100) approch, User Bob with id 1000 will be located inmachine #10 . So if number of users increases suddenly, new User DB will be created in newmachine and the new user info will be inserted automatically.There are other data-sharding policies like Range-based partitions, Lookup based approach,Read-Most-Write-Least Model.SimpleDB can be effectively used to manage lookup-orieneted entity info.This is an out-of-the-box offering from Amazon AWS as a hosted and managed solutionadministered by Amazon itself. SimpleDB does the heavy-lifting of multi-value data fetching for akey, batch operations, consistent reads.Its better to delegate the tradional data management operations like Relations, Transactions,Locks, Sequences, Constraints to Application Layer as SimpleDB is meant for handling simplethings !! Such a typical example is eBay DAL layer.Actually the System Architect should choose the Entities which are meant for mere lookup (likeUser, Item, Manufacturer, Order) and mark them as best candidates for SimpleDB items. Thoseentities will be then guarnteed to be highly available. Off course this pattern is not suitable forfinancial transactions in banking domain and rule-based complex events where every fetch querytriggers sub-query-based rules or procedures.Discussing further details on implementing SimpleDB is out-of-scope here.If we want to handle complex business transactions while updating Entity Info and manage intricaterelatiuonships then we should take resort to Cassandra or mongoDB.But we should remember that one needs to take care of Scalability in Application layer whileadopting NoSQL Dbs.
  2. 2. If the data are hierarchical in nature - we can leverage a Graph Database (MonogoDB) which is asopposed to conventional sql-db is a de-normalized graph processor.Availability : Load-balancing and Clustering are standard practices for making applicationsavailable. Normally DNS Resolver routes to a pool of servers for a requested application and Load-balancer picks up one server.Machines should be load-balanced in such a way the moving the user from one machine to anothermachine can be achieved easily without shutting down the system.Fast Searching :NoSql is a must for fast lookup of trillions of Business Entity data and persisting time-criticalentities by locking data storage row for a negligible amount of time (contrary to traditionalRDBMS), yet be able to write-through / broadcast write events to sub0system grids (Search Grid /Analytics Machine / Events Collector etc.)Cassandra does a very neat job for that matter."The sparse two-dimensional “super-column family” architecture allows for rich data modelrepresentations (and better performance) beyond just a simple key-value look up.....Some of the most attractive features of Cassandra are its uniquely flexible consistency andreplication models. Applications can determine at call level what consistency level to use for readsand writes (single, quorum or all replicas). This, combined with customizable replication factor, andspecial support to determine which cluster nodes to designate as replicas, makes it particularly wellsuited for cross-datacenter and cross-regional deployments. In effect, a single global Cassandracluster can simultaneously service applications and asynchronously replicate data across multiplegeographic locations...."Its worth paying for the learning curve and operational compexities in exchange of the scalability,availability and performance advantages of the NoSQL persistence model....In traditional DB, what happens if one of the node containing one of the table in a join condition isdown !Simple - now the whole application that depends on that join condition is unavailable !Well there is no join condition in NoSql !! Cassandra is best for cross-regional deployments andscaling with no single points of failure.Next question – does the NoSql gurantees data-consistency the same way Relational DB vouchesfor read-after-write consistency at the cost of Blocking the read untill Transaction is finished !Well NoSql follows CAP theorem not ACID principle !So if you think immediate consistency need to be ensured for super-critical tasks like Bidding /Buying, better await till data committed before reading the latest data ! In certain cases of EventualConsistency like searching data where we expect fast response we may not await for latest data toavailble but rather instantly display the pre-computed search result !!Also there is no concurrency bottlenecks ! Replicas are mostly Multi-master Highly Available !NoSql ensures Asynchronous Lock-based Reconciliation as opposed to Synchronous Lock-basedReconciliation bby SQL.This means more work but saving time !! Using Message -Multicast do write-behind to replicateddatabase / grid without taouching master db. Then synchronize with master DB after a specific time
  3. 3. period. This saves lot of time spent in Index Arrangement and Sequential Updation.Say you want to search – Blue Sony mp3 player ! NoSql will hold the lock for a row only forcouple of milliseconds as opposed to locking the entire table by RDBMS ! NoSql will just lookupthe id of next entity (manufatures) against the id of the main entity (product) and move the mesageto the next table !! At the same time, it looks up the product requested by the next user !! No Joins ,Just Intelligent Routing !! Handling millions of requests concurrently has never looked so esybefore !!!Which is for What ?Memcahed : Static Key-Value PairNeo4j : Network Graph StoreHbase : Row-Orieneted Sparse Column StoreMongoDB : (Key, Document) Storage.Great Document : Data AnalysisApache Hbase – best suited for Data Analytics, Data Mining, Enterprise Search and other DataQuery Services.If the main business is to mine PeraBytes of data and perform parallel range-queries and thencombine the results through batch Map-Reduce (say Enterprise Search for Video Content), then oneof the defacto choice is Apache Hbase configured with haddop Jobs, using HDFS as a sharedstorage platform. Hbase comes with availability trade-off i.e. the persistent domain entities may notimmediately available in the Search Result. The reason for this is huge Hadoop Map-Reduce jobsare performed parallely in offline mode so that main source of data is not hogged by Hadoop Jobsand is highly Scalable.It should be noted that Hadoop is not meant for searching in real-time. Its actually an offline batch-processing system well-suited for BI analytics, data aggregation, normalization in parallel.Hadoop provides a framework which will automatically take care of interProcess co-ordination,distributed counters, failure detection, automatic restart of failed process, co-ordinated, sorting andmuch more.There is different stages like mapper, combiner, partitions, reducer etc, instead of we writing fromthe scratch, the framework takes care of it.Erlang / Scala also provide out-of-the box parallel processing.Its important to know that there are different tools based on hadoop that serve different purposes :Hive : SQL query for MRPig : Scripting for MRHBase : Low-latency, Big Table like database on hadoopOozie : Workflo Mgmt on HadoopSqoop - RDBMS import / exportZookeeper : Fast, distributed, coordination systemHue : advanced web env. for Hadoop and custom applications
  4. 4. Here come the ultimate offering from Spring - has a solution for combining lucene with hadoop for blazing-fast document search.Fast Cache :Implementing a cold cache with minimum memory footprint (MySQL native memory, Memcached,Terracota Ehcahce) is absolutely important.Application Server should not remeber the state of the Entity rather should just persist in DB. Themetadata should be stored in Cold Cache. The persistent pojo objects should never be cached inmemory.If queries are mostly read-only, very less updates - the mySQL native memory scores high !MySQL InnoDB storage engine’s dictionary cache provides blazing fast data acceess. On demand,data blocks are read from disk and stored in memory using LRU chains or other advancedmechanisms(like MySQL’s Midpoint Insertion Strategy) .In order to lookup the value for a key, Memcached clients issue multiple parallel requests tomemcached servers where keys are sharded across those servers.For a frequently changing data set , Memcahed is surely better than DB CacheProbably the fastes cache on planet is - is Ehcache using Terracotta BigMemory directly the native byte-buffer of the OS is used bypassing main-memory.A write-optimized data store. Something that aggregates the writes in RAM, and writes outgenerational updates. Take a look at Googles BigTable paper for a good description of this strategy.A very good reference : AsynchronousAll communications in every layer should be asynchronous to reduce the latency.There are 2 types of latency.1. user latency - how fast user gets back the control on web site2. execution latency - how fast the execution takes place in backendUI behavior should be completely Ajax and send the main events to queue and schedule for batchupdates in offline mode. There is absoulutely no room for a wait_state i.e. all response should beimmediate and non-blocking.Common Flow :-- Submit a job/task to a thread and return to the user immediately.
  5. 5. -- The thread should perform the operation in background (it may communicate to LRU cacheoptimized for concurrent access / Graph Structure / Iry-IIry master-slave replicatioed env / Map-Reduce based sturctures)-- Once done with the opertaion it should return the result thru a CallbackHandler and client will getnotification.There are multiple patterns for Asynchronous Communications.(1) Store all jobs in Event Queue. Select a queue based on a contract/ algo depending on type oftask. Then use multiple event brokers/ listeners to handle the jobs from queue (thrid party ESB likeTibco / apache fuse/ apache camel / ...) can be used.(2) Message Multicast - say user enters a new item in system. do not update the iry db immediately.rather send messages to pollers / searchers - that there is a New event. Return to user immedialtely.Now the updater thread will update Iry db. Then searcher will behind the scene query Iry db / datasource to find what has been just added and it will add it to its search grid !(3) Batch Processing (schedule offline procesing). Identify which type of job requests can bescheduled for offline processing and do not need immediate attention !Prallel ThreadingUse Executor Service to effectively manage pool of threads - Remember a simple set of worker threads without the manager - can simply lead to (i) Resource Thrashing (each thread is expensive - execution call stack / context switching) (ii) Request Overload .. if all requests are provided threads for execution (iii) Thread Leakage : sive of threadpool diminishes due to uncaught errors but requests are notserved !So there should be a proper manager to allocate threads either FixedThreadPool /ScheduledThreadPool / SingleThreadPool / QueuedThreadPool with proper RejectionPolicy.This manager should also place the completed result in a non-blocking queue from where result canbe taken off asynchrounously.Thread should not wait to acquire locks - leverage advanced processor optimizations to use LATCHconcept to lock/unlock threads at the same time. Locks should be acquired / released in any order.Fork/Join and CountDownLatch are powerful concepts for running threads parallely.You can download and try out the open-source Thrift which is a C++ Fwk for multi-threading andasynchronous processing of jobAuto-Healing and Self-Recovery :Systems should be falut-tolernt and should know how to degrade gracefully in the scenario ofunprecented load.The JMX agents and other Robot Apps should continously monitor the system and gatherintelligence to take the best desicion.A high-degree of automation is requireed for easily recovering from failures and managing thesystem smoothly.
  6. 6. Normally automation is driven though Centrallized Logging System and Self-organization ArtificialIntelligence. BI tools are used to analyze user experience and provide Best Match through continousinhouse experimentations.Scalable systems are mangeable if new partitions can be added, DB instance can be horizantallyscaled out and new application servers turned on without affecting users of the system.Case Study :Twitter :1. Twitter Example : user SAM tweets - > store tweet > iterate social graph > split chunks into parallel jobs > prepend packet into its memcahced blob / (some other cache) - if not present in cache - talk to db / hadoop user RAM who follows SAM - sees sams tweet - > read mysql blob from memcache (or other cache) > deserialze integers > sort > slice > probablistic truncation (fast but may not be all consistent).3. SalesForce : Facebook : . Facebook Example : Alex friend of bob - logs in > Web-tier Calls a C++ based Service (thrift) > Thrift has the user-id of Bob and calls Aggregator to find all friends ids of Alex > Aggregator in parallel calls the multi-feed leaves.... (each leaf node is one user for which their is one DB .. one DB .. has a key-value pair (uid, user-data) ... no traditional sql (this is like noSql graph db) > feed result says [Bob, Sam, Paul] - these are all alexes friends .... returns those ids (multi-feed) - by calling all DB servers in parallel .. finds the Indexes .. > Aggregator says got ids of 40 most interesting stories .... It .. ranks them ... based on certain criteria ..... > For each Id, .. get the metadata (timestamp, user name, comment..) from memcached (in ur cache it could be any other cache) - parallel query on multi-core Fedorra > Now web tier renders the data.5. Google : :