1838 lines
117 KiB
Markdown
1838 lines
117 KiB
Markdown
*[English](README.md) ∙ [日本語](README-ja.md) ∙ [简体中文](README-zh-Hans.md) ∙ [繁體中文](README-zh-TW.md) | [العَرَبِيَّة](README-ar.md) ∙ [বাংলা](https://github.com/donnemartin/system-design-primer/issues/220) ∙ [Português do Brasil](https://github.com/donnemartin/system-design-primer/issues/40) ∙ [Deutsch](https://github.com/donnemartin/system-design-primer/issues/186) ∙ [ελληνικά](https://github.com/donnemartin/system-design-primer/issues/130) ∙ [עברית](https://github.com/donnemartin/system-design-primer/issues/272) ∙ [Italiano](https://github.com/donnemartin/system-design-primer/issues/104) ∙ [한국어](https://github.com/donnemartin/system-design-primer/issues/102) ∙ [فارسی](https://github.com/donnemartin/system-design-primer/issues/110) ∙ [Polski](https://github.com/donnemartin/system-design-primer/issues/68) ∙ [русский язык](https://github.com/donnemartin/system-design-primer/issues/87) ∙ [Español](https://github.com/donnemartin/system-design-primer/issues/136) ∙ [ภาษาไทย](https://github.com/donnemartin/system-design-primer/issues/187) ∙ [Türkçe](https://github.com/donnemartin/system-design-primer/issues/39) ∙ [tiếng Việt](https://github.com/donnemartin/system-design-primer/issues/127) ∙ [Français](https://github.com/donnemartin/system-design-primer/issues/250) | [Add Translation](https://github.com/donnemartin/system-design-primer/issues/28)*
|
||
|
||
**ساعد [بترجمة](TRANSLATIONS.md) هذه الإرشادة!**
|
||
|
||
# تمهيد لتصميم النظام
|
||
|
||
<p align="center">
|
||
<img src="images/jj3A5N8.png">
|
||
<br/>
|
||
</p>
|
||
|
||
## الدافع
|
||
|
||
> التعرف على كيفية تصميم أنظمة واسعة النطاق.
|
||
>
|
||
> التحضير لمقابلة تصميم النظام.
|
||
|
||
### التعرف على كيفية تصميم أنظمة واسعة النطاق
|
||
|
||
سيساعدك تعلم كيفية تصميم أنظمة قابلة للتطوير على أن تصبح مهندسًا أفضل.
|
||
|
||
تصميم النظام هو موضوع واسع. هناك ** قدر هائل من الموارد المنتشرة في جميع أنحاء الويب ** حول مبادئ تصميم النظام.
|
||
|
||
هذا المستودع عبارة عن ** مجموعة منظمة ** من الموارد لمساعدتك على تعلم كيفية إنشاء أنظمة على نطاق واسع.
|
||
|
||
### تعلم من مجتمع المصادر المفتوحة
|
||
|
||
هذا مشروع مفتوح المصدر يتم تحديثه باستمرار.
|
||
|
||
[المساهمات](#contributing) مُرحب بها!
|
||
|
||
### التحضير لمقابلة تصميم النظام
|
||
|
||
بالإضافة إلى مقابلات البرمجة ، يعد تصميم النظام ** عنصرًا مطلوبًا ** من ** عملية المقابلة الفنية ** في العديد من شركات التكنولوجيا.
|
||
|
||
** تدرب على أسئلة المقابلة العامة لتصميم النظام ** و ** قارن ** نتائجك مع ** نماذج الحلول **: المناقشات ، والتعليمات البرمجية ، والرسوم التخطيطية.
|
||
|
||
مواضيع إضافية للتحضير للمقابلة:
|
||
|
||
* [دليل الدراسة](#study-guide)
|
||
* [كيفية التعامل مع سؤال مقابلة تصميم النظام](#how-to-approach-a-system-design-interview-question)
|
||
* [أسئلة مقابلة تصميم النظام ** مع حلول **](#system-design-interview-questions-with-solutions)
|
||
* [أسئلة مقابلة التصميم الموجه للكائنات ، ** مع حلول **](#object-oriented-design-interview-questions-with-solutions)
|
||
* [أسئلة مقابلة تصميم النظام الإضافية](#additional-system-design-interview-questions)
|
||
|
||
## بطاقات أنكي التعليمية
|
||
|
||
<p align="center">
|
||
<img src="images/zdCAkB3.png">
|
||
<br/>
|
||
</p>
|
||
|
||
[بطاقات أنكي التعليمية](https://apps.ankiweb.net/) المقدمة تستخدم التكرار المتباعد لمساعدتك في الاحتفاظ بمفاهيم تصميم النظام الرئيسية.
|
||
|
||
* [سطح تصميم النظام](https://github.com/donnemartin/system-design-primer/tree/master/resources/flash_cards/System%20Design.apkg)
|
||
* [سطح تمارين تصميم النظام](https://github.com/donnemartin/system-design-primer/tree/master/resources/flash_cards/System%20Design%20Exercises.apkg)
|
||
* [تمارين التصميم الكينوني على سطح السفينة](https://github.com/donnemartin/system-design-primer/tree/master/resources/flash_cards/OO%20Design.apkg)
|
||
|
||
عظيم للاستخدام أثناء التنقل.
|
||
|
||
### مصادر البرمجة : تحديات البرمجة التفاعلية
|
||
تلبحث عن موارد لمساعدتك على التحضير لـ [** مقابلة البرمجة **](https://github.com/donnemartin/interactive-coding-challenges)?
|
||
|
||
<p align="center">
|
||
<img src="images/b4YtAEN.png">
|
||
<br/>
|
||
</p>
|
||
|
||
تحقق من المستودع المناظر [** تحديات البرمجة التفاعلية **](https://github.com/donnemartin/interactive-coding-challenges), which contains an additional Anki deck:
|
||
|
||
* [سطح البرمجة](https://github.com/donnemartin/interactive-coding-challenges/tree/master/anki_cards/Coding.apkg)
|
||
|
||
## المساهمة
|
||
|
||
> تعلم من المجتمع.
|
||
|
||
لا تتردد في إرسال طلبات السحب للمساعدة:
|
||
|
||
* إصلاح الأخطاء
|
||
* تحسين الأجزاء
|
||
* إضافة أجزاء جديدة
|
||
* [الترجمة](https://github.com/donnemartin/system-design-primer/issues/28)
|
||
|
||
يتم وضع المحتوى الذي يحتاج إلى بعض التلميع [تحت التطوير](#under-development).
|
||
|
||
راجع ال [المبادئ التوجيهية للمساهمة](CONTRIBUTING.md).
|
||
|
||
## فهرس موضوعات تصميم النظام
|
||
|
||
> ملخصات لموضوعات تصميم النظام المختلفة ، بما في ذلك الإيجابيات والسلبيات. ** كل شيء هو مقايضة **.
|
||
>
|
||
> يحتوي كل قسم على روابط لمزيد من الموارد المتعمقة.
|
||
|
||
<p align="center">
|
||
<img src="images/jrUBAF7.png">
|
||
<br/>
|
||
</p>
|
||
|
||
* [مواضيع تصميم النظام: ابدأ من هنا](#system-design-topics-start-here)
|
||
* [الخطوة 1: راجع محاضرة فيديو قابلية التوسع](#step-1-review-the-scalability-video-lecture)
|
||
* [الخطوة 2: راجع مقالة قابلية التوسع](#step-2-review-the-scalability-article)
|
||
* [الخطوات التالية](#next-steps)
|
||
* [الأداء مقابل قابلية التوسع](#performance-vs-scalability)
|
||
* [الكمون مقابل الإنتاجية](#latency-vs-throughput)
|
||
* [التوافر مقابل الاتساق](#availability-vs-consistency)
|
||
* [نظرية CAP](#cap-theorem)
|
||
* [CP - الاتساق والتسامح في التقسيم](#cp---consistency-and-partition-tolerance)
|
||
* [AP - التوافر والتسامح في التقسيم](#ap---availability-and-partition-tolerance)
|
||
* [أنماط الاتساق](#consistency-patterns)
|
||
* [تناسق ضعيف](#weak-consistency)
|
||
* [الاتساق في نهاية المطاف](#eventual-consistency)
|
||
* [اتساق قوي](#strong-consistency)
|
||
* [أنماط التوفر](#availability-patterns)
|
||
* [تجاوز الفشل](#fail-over)
|
||
* [تكرار](#replication)
|
||
* [التوافر بالأرقام](#availability-in-numbers)
|
||
* [نظام اسم المجال](#domain-name-system)
|
||
* [شبكة توصيل المحتوى](#content-delivery-network)
|
||
* [دفع CDNs](#push-cdns)
|
||
* [سحب شبكات CDN](#pull-cdns)
|
||
* [موازن الحمل](#load-balancer)
|
||
* [نشط سلبي](#active-passive)
|
||
* [نشط نشط](#active-active)
|
||
* [موازنة حمل الطبقة الرابعة](#layer-4-load-balancing)
|
||
* [موازنة تحميل الطبقة السابعة](#layer-7-load-balancing)
|
||
* [التحجيم الأفقي](#horizontal-scaling)
|
||
* [وكيل عكسي (خادم الويب)](#reverse-proxy-web-server)
|
||
* [موازن التحميل مقابل الوكيل العكسي](#load-balancer-vs-reverse-proxy)
|
||
* [طبقة التطبيقات](#application-layer)
|
||
* [الخدمات المصغرة](#microservices)
|
||
* [اكتشاف الخدمة](#service-discovery)
|
||
* [قاعدة البيانات](#database)
|
||
* [نظام إدارة قواعد البيانات الارتباطية (RDBMS)](#relational-database-management-system-rdbms)
|
||
* [تكرار السيد والخادم](#master-slave-replication)
|
||
* [تكرار السيد السيد](#master-master-replication)
|
||
* [الاتحاد](#federation)
|
||
* [التشرذم](#sharding)
|
||
* [عدم التطابق](#denormalization)
|
||
* [ضبط SQL](#sql-tuning)
|
||
* [لا SQL](#nosql)
|
||
* [مخزن مفتاح-قيمة](#key-value-store)
|
||
* [مخزن المستندات](#document-store)
|
||
* [مخزن العمود الواسع](#wide-column-store)
|
||
* [قاعدة بيانات الرسم البياني](#graph-database)
|
||
* [SQL أو لا SQL](#sql-or-nosql)
|
||
* [مخزن مؤقت](#cache)
|
||
* [التخزين المؤقت للعميل](#client-caching)
|
||
* [تخزين CDN المؤقت](#cdn-caching)
|
||
* [التخزين المؤقت لخادم الويب](#web-server-caching)
|
||
* [التخزين المؤقت لقاعدة البيانات](#database-caching)
|
||
* [التخزين المؤقت للتطبيق](#application-caching)
|
||
* [التخزين المؤقت على مستوى استعلام قاعدة البيانات](#caching-at-the-database-query-level)
|
||
* [التخزين المؤقت على مستوى الكائن](#caching-at-the-object-level)
|
||
* [متى يتم تحديث ذاكرة التخزين المؤقت](#when-to-update-the-cache)
|
||
* [تخزين مؤقت جانبي](#cache-aside)
|
||
* [الكتابة من خلال](#write-through)
|
||
* [الكتابة الخلفية (إعادة الكتابة)](#write-behind-write-back)
|
||
* [تحديث للأمام](#refresh-ahead)
|
||
* [عدم التزامن](#asynchronism)
|
||
* [قوائم انتظار الرسائل](#message-queues)
|
||
* [قوائم انتظار المهام](#task-queues)
|
||
* [الضغط الخلفي](#back-pressure)
|
||
* [تواصل](#communication)
|
||
* [بروتوكول التحكم في الإرسال (TCP)](#transmission-control-protocol-tcp)
|
||
* [بروتوكول مخطط بيانات المستخدم (UDP)](#user-datagram-protocol-udp)
|
||
* [استدعاء الإجراء البعيد (RPC)](#remote-procedure-call-rpc)
|
||
* [نقل الحالة التمثيلية (REST)](#representational-state-transfer-rest)
|
||
* [حماية](#security)
|
||
* [زائدة](#appendix)
|
||
* [صلاحيات اثنين من الجدول](#powers-of-two-table)
|
||
* [أرقام التأخير يجب أن يعرفها كل مبرمج](#latency-numbers-every-programmer-should-know)
|
||
* [أسئلة مقابلة تصميم النظام الإضافية](#additional-system-design-interview-questions)
|
||
* [أبنية العالم الحقيقي](#real-world-architectures)
|
||
* [معماريات الشركة](#company-architectures)
|
||
* [مدونات هندسة الشركة](#company-engineering-blogs)
|
||
* [تحت التطوير](#under-development)
|
||
* [الاعتمادات](#credits)
|
||
* [معلومات الاتصال](#contact-info)
|
||
* [ترخيص](#license)
|
||
|
||
## دليل الدراسة
|
||
|
||
> الموضوعات المقترحة للمراجعة بناءً على الجدول الزمني للمقابلة (قصير ، متوسط ، طويل).
|
||
|
||
|
||
|
||
**س: لإجراء المقابلات ، هل أحتاج إلى معرفة كل شيء هنا؟ **
|
||
|
||
**ج: لا ، لست بحاجة إلى معرفة كل شيء هنا للاستعداد للمقابلة **.
|
||
|
||
يعتمد ما يُطلب منك في المقابلة على متغيرات مثل:
|
||
|
||
* ما مدى خبرتك
|
||
* ما هي خلفيتك التقنية
|
||
* ما هي المواقف التي تجري مقابلات معها
|
||
* ما هي الشركات التي تجري مقابلات معها
|
||
* حظ
|
||
|
||
من المتوقع عمومًا أن يعرف المرشحون الأكثر خبرة المزيد عن تصميم النظام. من المتوقع أن يعرف المهندسون المعماريون أو قادة الفريق أكثر من المساهمين الفرديين. من المرجح أن تجري شركات التكنولوجيا الكبرى جولة أو أكثر من مقابلات التصميم.
|
||
|
||
ابدأ على نطاق واسع وتعمق في مناطق قليلة. من المفيد معرفة القليل عن مواضيع تصميم النظام الرئيسية المختلفة. اضبط الدليل التالي بناءً على جدولك الزمني وخبرتك والوظائف التي تجري مقابلة معها والشركات التي تجري مقابلات معها.
|
||
|
||
* ** جدول زمني قصير ** - استهدف ** اتساع نطاق ** بمواضيع تصميم النظام. تدرب على حل ** بعض ** أسئلة المقابلة.
|
||
* ** مخطط زمني متوسط ** - استهدف ** اتساع نطاق ** و ** بعض العمق ** مع مواضيع تصميم النظام. الممارسة عن طريق حل ** العديد ** أسئلة المقابلة.
|
||
* ** جدول زمني طويل ** - استهدف ** اتساع نطاق ** و ** مزيد من العمق ** مع مواضيع تصميم النظام. تدرب على حل ** معظم ** أسئلة المقابلة.
|
||
|
||
| | قصيرة | وسط | طويلة |
|
||
|---|---|---|---|
|
||
| اقرأ من خلال [موضوعات تصميم النظام](#index-of-system-design-topics) للحصول على فهم واسع لكيفية عمل الأنظمة | :+1: | :+1: | :+1: |
|
||
| اقرأ بعض المقالات في [مدونات الشركة الهندسية](#company-engineering-blogs) للشركات التي تجري مقابلات معها | :+1: | :+1: | :+1: |
|
||
| اقرأ بعضًا من [أبنية العالم الحقيقي](#real-world-architectures) | :+1: | :+1: | :+1: |
|
||
| مراجعة [كيفية التعامل مع سؤال مقابلة تصميم النظام](#how-to-approach-a-system-design-interview-question) | :+1: | :+1: | :+1: |
|
||
| العمل من خلال [أسئلة مقابلة تصميم النظام مع الحلول](#system-design-interview-questions-with-solutions) | بعض | كثير | أغلب |
|
||
| العمل من خلال [أسئلة مقابلة التصميم الموجه للكائنات مع الحلول](#object-oriented-design-interview-questions-with-solutions) | بعض | كثير | أغلب |
|
||
| مراجعة [أسئلة مقابلة تصميم النظام الإضافية](#additional-system-design-interview-questions) | بعض | كثير | أغلب |
|
||
|
||
## كيفية التعامل مع سؤال مقابلة تصميم النظام
|
||
|
||
> كيفية معالجة سؤال مقابلة تصميم النظام.
|
||
|
||
مقابلة تصميم النظام هي ** محادثة مفتوحة **. من المتوقع أن تقودها.
|
||
|
||
يمكنك استخدام الخطوات التالية لتوجيه المناقشة. للمساعدة في ترسيخ هذه العملية ، اعمل من خلال [أسئلة مقابلة تصميم النظام مع حلول](#system-design-interview-questions-with-solutions) باستخدام الخطوات التالية.
|
||
|
||
### الخطوة الأولى: حدد حالات الاستخدام والقيود والافتراضات
|
||
|
||
اجمع المتطلبات وحدد نطاق المشكلة. اطرح أسئلة لتوضيح حالات الاستخدام والقيود. ناقش الافتراضات.
|
||
|
||
* من سيستخدمها؟
|
||
* كيف سيستخدمونها؟
|
||
* كم عدد المستخدمين هناك؟
|
||
* ماذا يفعل النظام؟
|
||
* ما هي مداخل ومخرجات النظام؟
|
||
* ما مقدار البيانات التي نتوقع معالجتها؟
|
||
* كم عدد الطلبات التي نتوقعها في الثانية؟
|
||
* ما هي نسبة القراءة إلى الكتابة المتوقعة؟
|
||
|
||
### الخطوة الثانية: إنشاء تصميم عالي المستوى
|
||
|
||
حدد تصميمًا عالي المستوى مع جميع المكونات المهمة.
|
||
|
||
* رسم المكونات والتوصيلات الرئيسية
|
||
* برر أفكارك
|
||
|
||
### الخطوة الثالثة: تصميم المكونات الأساسية
|
||
|
||
الغوص في التفاصيل لكل مكون أساسي. على سبيل المثال ، إذا طُلب منك [تصميم خدمة تقصير عناوين url](solutions/system_design/pastebin/README.md), ناقش:
|
||
|
||
* إنشاء وتخزين تجزئة عنوان url الكامل
|
||
* [MD5](Solutions/system_design/pastebin/README.md) و [Base62](Solutions/system_design/pastebin/README.md)
|
||
* تجزئة الاصطدامات
|
||
* SQL أو NoSQL
|
||
* مخطط قاعدة البيانات
|
||
* ترجمة عنوان url مجزأ إلى عنوان url الكامل
|
||
* البحث في قاعدة البيانات
|
||
* API والتصميم الشيئي
|
||
|
||
### الخطوة 4: قياس التصميم
|
||
|
||
تحديد ومعالجة الاختناقات ، في ضوء القيود. على سبيل المثال ، هل تحتاج إلى ما يلي لمعالجة مشكلات قابلية التوسع؟
|
||
|
||
* موازن التحميل
|
||
* التحجيم الأفقي
|
||
* التخزين المؤقت
|
||
* تقسيم قاعدة البيانات
|
||
|
||
ناقش الحلول والمفاضلات المحتملة. كل شيء هو مقايضة. قم بمعالجة الاختناقات باستخدام [مبادئ تصميم النظام القابل للتطوير](#index-of-system-design-topics).
|
||
|
||
### حسابات ظهر المغلف
|
||
|
||
قد يُطلب منك القيام ببعض التقديرات يدويًا. راجع [الملحق] (# الملحق) للحصول على الموارد التالية:
|
||
|
||
* [استخدم الجزء الخلفي من حسابات المغلف] (http://highscalability.com/blog/2011/1/26/google-pro-tip-use-back-of-the-envelope-calculations-to-choo.html)
|
||
* [صلاحيات جدولين](#powers-of-two-table)
|
||
* [أرقام زمن الانتقال التي يجب على كل مبرمج معرفتها](# latency-number-every-programmer-should-know)
|
||
|
||
### المصدر (المصادر) وقراءات أخرى
|
||
|
||
تحقق من الروابط التالية للحصول على فكرة أفضل عما يمكن توقعه:
|
||
|
||
* [كيفية الحصول على مقابلة تصميم الأنظمة](https://www.palantir.com/2011/10/how-to-rock-a-systems-design-interview/)
|
||
* [مقابلة تصميم النظام](http://www.hiredintech.com/system-design)
|
||
* [مقدمة لمقابلات تصميم النظم والنظم المعمارية](https://www.youtube.com/watch?v=ZgdS0EUmn70)
|
||
* [نموذج تصميم النظام](https://leetcode.com/discuss/career/229177/My-System-Design-Template)
|
||
|
||
## أسئلة مقابلة تصميم النظام مع الحلول
|
||
|
||
> أسئلة مقابلة تصميم النظام الشائعة مع نماذج المناقشات ، والتعليمات البرمجية ، والرسوم التخطيطية.
|
||
>
|
||
> حلول مرتبطة بالمحتوى في مجلد `` Solutions / `.
|
||
|
||
| سؤال | |
|
||
|---|---|
|
||
| صمم Pastebin.com (or Bit.ly) | [الحل](solutions/system_design/pastebin/README.md) |
|
||
| صمم الجدول الزمني والبحث في Twitter (أو موجز Facebook والبحث) | [الحل](solutions/system_design/twitter/README.md) |
|
||
| صمم web crawler | [الحل](solutions/system_design/web_crawler/README.md) |
|
||
| صمم Mint.com | [الحل](solutions/system_design/mint/README.md) |
|
||
| صمم هياكل البيانات لشبكة اجتماعية | [الحل](solutions/system_design/social_graph/README.md) |
|
||
| صمم مخزن مفتاح-قيمة لمحرك بحث | [الحل](solutions/system_design/query_cache/README.md) |
|
||
| صمم ترتيب مبيعات أمازون حسب ميزة الفئة | [الحل](solutions/system_design/sales_rank/README.md) |
|
||
| صمم نظام يتسع لملايين المستخدمين على AWS | [الحل](solutions/system_design/scaling_aws/README.md) |
|
||
| أضف سؤال تصميم النظام | [المساهمة](#contributing) |
|
||
|
||
### تصميم Pastebin.com (أو Bit.ly)
|
||
|
||
[عرض التمرين والحل](solutions/system_design/pastebin/README.md)
|
||
|
||
|
||
|
||
### تصميم الجدول الزمني على Twitter والبحث (أو موجز Facebook والبحث)
|
||
|
||
[عرض التمرين والحل](solutions/system_design/twitter/README.md)
|
||
|
||
|
||
|
||
### تصميم زاحف الويب
|
||
|
||
[عرض التمرين والحل](solutions/system_design/web_crawler/README.md)
|
||
|
||
|
||
|
||
### صمم Mint.com
|
||
|
||
[عرض التمرين والحل](solutions/system_design/mint/README.md)
|
||
|
||
|
||
|
||
### تصميم هياكل البيانات لشبكة اجتماعية
|
||
|
||
[عرض التمرين والحل](solutions/system_design/social_graph/README.md)
|
||
|
||
|
||
|
||
### تصميم متجر ذي قيمة رئيسية لمحرك بحث
|
||
|
||
[عرض التمرين والحل](solutions/system_design/query_cache/README.md)
|
||
|
||
|
||
|
||
### تصميم ترتيب مبيعات أمازون حسب ميزة الفئة
|
||
|
||
[عرض التمرين والحل](solutions/system_design/sales_rank/README.md)
|
||
|
||
|
||
|
||
### تصميم نظام يتسع لملايين المستخدمين على AWS
|
||
|
||
[عرض التمرين والحل](solutions/system_design/scaling_aws/README.md)
|
||
|
||
|
||
|
||
## أسئلة مقابلة التصميم الموجه مع الحلول
|
||
|
||
> أسئلة مقابلة التصميم الموجه للكائنات الشائعة مع نماذج المناقشات ، والتعليمات البرمجية ، والرسوم التخطيطية.
|
||
>
|
||
> حلول مرتبطة بالمحتوى في مجلد `` Solutions / `.
|
||
|
||
> ** ملاحظة: هذا القسم قيد التطوير **
|
||
|
||
| Question | |
|
||
|---|---|
|
||
| تصميم خريطة التجزئة | [الحل](solutions/object_oriented_design/hash_table/hash_map.ipynb) |
|
||
| تصميم ذاكرة التخزين المؤقت الأقل استخدامًا مؤخرًا | [الحل](solutions/object_oriented_design/lru_cache/lru_cache.ipynb) |
|
||
| تصميم مركز اتصال | [الحل](solutions/object_oriented_design/call_center/call_center.ipynb) |
|
||
| صمم مجموعة من البطاقات | [الحل](solutions/object_oriented_design/deck_of_cards/deck_of_cards.ipynb) |
|
||
| تصميم موقف للسيارات | [الحل](solutions/object_oriented_design/parking_lot/parking_lot.ipynb) |
|
||
| صمم خادم دردشة | [الحل](solutions/object_oriented_design/online_chat/online_chat.ipynb) |
|
||
| تصميم مصفوفة دائرية | [المساهمة](#contributing) |
|
||
| أضف سؤال تصميم موجه للكائنات | [المساهمة](#contributing) |
|
||
|
||
## مواضيع تصميم النظام: ابدأ من هنا
|
||
|
||
جديد في تصميم النظام؟
|
||
|
||
أولاً ، ستحتاج إلى فهم أساسي للمبادئ المشتركة ، والتعرف على ماهيتها وكيفية استخدامها ومزاياها وعيوبها.
|
||
|
||
### الخطوة الأولى: مراجعة محاضرة الفيديو حول قابلية التوسع
|
||
|
||
[محاضرة حول قابلية التوسع في جامعة هارفارد](https://www.youtube.com/watch?v=-W9F__D3oY4)
|
||
|
||
* المواضيع التي تمت تغطيتها:
|
||
* التحجيم العمودي
|
||
* التحجيم الأفقي
|
||
* التخزين المؤقت
|
||
* توزيع الحمل
|
||
* تكرار قاعدة البيانات
|
||
* تقسيم قاعدة البيانات
|
||
|
||
### الخطوة الثانية: مراجعة مقالة قابلية التوسع
|
||
|
||
[قابلية التوسع](http://www.lecloud.net/tagged/scalability/chrono)
|
||
|
||
* Topics covered:
|
||
* [النُسَخ](http://www.lecloud.net/post/7295452622/scalability-for-dummies-part-1-clones)
|
||
* [قواعد البيانات](http://www.lecloud.net/post/7994751381/scalability-for-dummies-part-2-database)
|
||
* [تخزينات مؤقتة](http://www.lecloud.net/post/9246290032/scalability-for-dummies-part-3-cache)
|
||
* [عدم التزامن](http://www.lecloud.net/post/9699762917/scalability-for-dummies-part-4-asynchronism)
|
||
|
||
### الخطوات التالية
|
||
|
||
بعد ذلك ، سنلقي نظرة على المقايضات عالية المستوى:
|
||
|
||
* ** الأداء ** مقابل ** قابلية التوسع **
|
||
* ** الكمون ** مقابل ** الإنتاجية **
|
||
* ** التوفر ** مقابل ** الاتساق **
|
||
|
||
ضع في اعتبارك أن ** كل شيء هو مقايضة **.
|
||
|
||
ثم سنغوص في مواضيع أكثر تحديدًا مثل DNS و CDNs وموازنات التحميل.
|
||
|
||
## الأداء مقابل قابلية التوسع
|
||
|
||
تكون الخدمة ** قابلة للتطوير ** إذا أدت إلى زيادة ** الأداء ** بطريقة تتناسب مع الموارد المضافة. بشكل عام ، تعني زيادة الأداء خدمة المزيد من وحدات العمل ، ولكن يمكن أيضًا التعامل مع وحدات عمل أكبر ، مثل عندما تنمو مجموعات البيانات. <sup><a href=http://www.allthingsdistributed.com/2006/03/a_word_on_scalability.html>1</a></sup>
|
||
|
||
طريقة أخرى للنظر إلى الأداء مقابل قابلية التوسع:
|
||
|
||
* إذا كانت لديك مشكلة ** في الأداء ** ، فهذا يعني أن نظامك بطيء لمستخدم واحد.
|
||
* إذا كانت لديك مشكلة ** قابلية التوسع ** ، فإن نظامك سريع لمستخدم واحد ولكنه بطيء في ظل الحمل الثقيل.
|
||
|
||
### المصدر (المصادر) وقراءات أخرى
|
||
|
||
* [كلمة عن قابلية التوسع](http://www.allthingsdistributed.com/2006/03/a_word_on_scalability.html)
|
||
* [قابلية التوسع ، التوافر ، الاستقرار ، الأنماط](http://www.slideshare.net/jboner/scalability-availability-stability-patterns/)
|
||
|
||
## الكمون مقابل الإنتاجية
|
||
|
||
** الكمون ** هو الوقت المناسب للقيام ببعض الإجراءات أو لإنتاج بعض النتائج.
|
||
|
||
** الإنتاجية ** هي عدد هذه الإجراءات أو النتائج لكل وحدة زمنية.
|
||
|
||
بشكل عام ، يجب أن تهدف إلى تحقيق ** أقصى قدر من الإنتاجية ** مع ** زمن انتقال مقبول **.
|
||
|
||
### المصدر (المصادر) وقراءات أخرى
|
||
|
||
* [فهم وقت الاستجابة مقابل الإنتاجية](https://community.cadence.com/cadence_blogs_8/b/sd/archive/2010/09/13/understanding-latency-vs-throughput)
|
||
|
||
## التوافر مقابل الاتساق
|
||
|
||
### نظرية CAP
|
||
|
||
<p align="center">
|
||
<img src="images/bgLMI2u.png">
|
||
<br/>
|
||
<i><a href=http://robertgreiner.com/2014/08/cap-theorem-revisited>Source: CAP theorem revisited</a></i>
|
||
</p>
|
||
|
||
في نظام الكمبيوتر الموزع ، يمكنك فقط دعم اثنين من الضمانات التالية:
|
||
|
||
* ** الاتساق ** - تتلقى كل قراءة أحدث كتابة أو خطأ
|
||
* ** التوفر ** - يتلقى كل طلب استجابة ، دون ضمان احتوائه على أحدث نسخة من المعلومات
|
||
* ** التسامح التقسيم ** - يستمر النظام في العمل على الرغم من التقسيم التعسفي بسبب أعطال الشبكة
|
||
|
||
* الشبكات ليست موثوقة ، لذا ستحتاج إلى دعم تسامح التقسيم. ستحتاج إلى مقايضة البرامج بين الاتساق والتوافر. *
|
||
|
||
#### CP - الاتساق والتسامح في التقسيم
|
||
|
||
قد يؤدي انتظار استجابة من العقدة المقسمة إلى حدوث خطأ انتهاء المهلة. يعد CP خيارًا جيدًا إذا كانت احتياجات عملك تتطلب قراءة وكتابة ذرية.
|
||
|
||
#### AP - التوافر والتسامح في القسم
|
||
|
||
تُرجع الردود النسخة الأكثر توفرًا من البيانات المتاحة على أي عقدة ، والتي قد لا تكون الأحدث. قد يستغرق نشر عمليات الكتابة عند حل القسم بعض الوقت.
|
||
|
||
AP هو اختيار جيد إذا سمحت احتياجات العمل بذلك [الاتساق في نهاية المطاف](#eventual-consistency) أو عندما يحتاج النظام إلى مواصلة العمل بالرغم من الأخطاء الخارجية.
|
||
|
||
### المصدر (المصادر) وقراءات أخرى
|
||
|
||
* [إعادة النظر في نظرية CAP](http://robertgreiner.com/2014/08/cap-theorem-revisited/)
|
||
* [مقدمة إنجليزية بسيطة لنظرية CAP](http://ksat.me/a-plain-english-introduction-to-cap-theorem)
|
||
* [الأسئلة الشائعة حول CAP](https://github.com/henryr/cap-faq)
|
||
* [نظرية CAP](https://www.youtube.com/watch?v=k-Yaq8AHlFA)
|
||
|
||
## أنماط الاتساق
|
||
|
||
من خلال نسخ متعددة من نفس البيانات ، نواجه خيارات حول كيفية مزامنتها بحيث يكون لدى العملاء عرض متسق للبيانات. تذكر تعريف التناسق من [نظرية CAP](#cap-theorem) - كل قراءة تتلقى أحدث كتابة أو خطأ.
|
||
|
||
### تناسق ضعيف
|
||
|
||
بعد الكتابة ، قد تراه أو لا تراه. يتم اتباع نهج أفضل جهد.
|
||
|
||
يظهر هذا النهج في أنظمة مثل memcached. يعمل التناسق الضعيف بشكل جيد في حالات الاستخدام في الوقت الفعلي مثل VoIP ودردشة الفيديو والألعاب متعددة اللاعبين في الوقت الفعلي. على سبيل المثال ، إذا كنت تجري مكالمة هاتفية وفقدت الاستقبال لبضع ثوان ، فعند استعادة الاتصال ، لا تسمع ما تم التحدث به أثناء فقدان الاتصال.
|
||
|
||
### الاتساق في نهاية المطاف
|
||
|
||
بعد الكتابة ، ستراها القراءات في النهاية (عادةً في غضون مللي ثانية). يتم نسخ البيانات بشكل غير متزامن.
|
||
|
||
يظهر هذا النهج في أنظمة مثل DNS والبريد الإلكتروني. يعمل الاتساق النهائي بشكل جيد في الأنظمة المتاحة للغاية.
|
||
|
||
### الاتساق القوي
|
||
|
||
بعد الكتابة ، ستراها القراءات. يتم نسخ البيانات بشكل متزامن.
|
||
|
||
يظهر هذا النهج في أنظمة الملفات و RDBMSes. يعمل الاتساق القوي بشكل جيد في الأنظمة التي تحتاج إلى معاملات.
|
||
|
||
### المصدر (المصادر) وقراءات أخرى
|
||
|
||
* [المعاملات عبر مراكز البيانات](http://snarfed.org/transactions_across_datacenters_io.html)
|
||
|
||
## أنماط التوفر
|
||
|
||
هناك نوعان من الأنماط التكميلية لدعم الإتاحة العالية: ** تجاوز الفشل ** و ** النسخ المتماثل **.
|
||
|
||
### الفشل
|
||
|
||
#### المبني للمجهول
|
||
|
||
مع تجاوز الفشل السلبي النشط ، يتم إرسال دقات القلب بين الخادم النشط والخادم الخامل في وضع الاستعداد. في حالة مقاطعة نبضات القلب ، يتولى الخادم الخامل عنوان IP الخاص بالنشط ويستأنف الخدمة.
|
||
|
||
يتم تحديد مدة التعطل من خلال ما إذا كان الخادم الخامل يعمل بالفعل في وضع الاستعداد "الساخن" أو ما إذا كان يحتاج إلى بدء التشغيل من وضع الاستعداد "البارد". فقط الخادم النشط يتعامل مع حركة المرور.
|
||
|
||
يمكن أيضًا الإشارة إلى تجاوز الفشل النشط والسلبي باسم تجاوز الفشل الرئيسي والعبد.
|
||
|
||
#### النشط النشط
|
||
|
||
في حالة النشاط النشط ، يقوم كلا الخادمين بإدارة حركة المرور ، وتوزيع الحمل بينهما.
|
||
|
||
إذا كانت الخوادم تواجه الجمهور ، فسيحتاج DNS إلى معرفة عناوين IP العامة لكلا الخادمين. إذا كانت الخوادم مواجهة داخلية ، فسيحتاج منطق التطبيق إلى معرفة كلا الخادمين.
|
||
|
||
يمكن أيضًا الإشارة إلى تجاوز الفشل النشط النشط باسم تجاوز الفشل الرئيسي / الرئيسي.
|
||
|
||
### العيوب: تجاوز الفشل
|
||
|
||
* يضيف تجاوز الفشل مزيدًا من الأجهزة وتعقيدًا إضافيًا.
|
||
* هناك احتمال لفقدان البيانات في حالة فشل النظام النشط قبل نسخ أي بيانات مكتوبة حديثًا إلى الخامل.
|
||
|
||
### تكرار
|
||
|
||
#### السيد والخادم والسيد السيد
|
||
|
||
تمت مناقشة هذا الموضوع بمزيد من التفصيل في فصل [قاعدة البيانات](#database):
|
||
|
||
* [إستنساخ السيد والخادم](#master-slave-replication)
|
||
* [إستنساخ السيد السيد](#master-master-replication)
|
||
|
||
### التوافرية بالأعداد
|
||
|
||
غالبًا ما يتم تحديد مدى التوفر حسب وقت التشغيل (أو وقت التوقف عن العمل) كنسبة مئوية من الوقت الذي تتوفر فيه الخدمة. يُقاس التوافر عمومًا بعدد 9 ثوانٍ - توصف خدمة توفر بنسبة 99.99٪ بأنها تحتوي على أربع 9 ثوانٍ.
|
||
|
||
#### توفر بنسبة 99.9٪ - ثلاث 9 ثوانٍ
|
||
|
||
| المدة | وقت التوقف المقبول|
|
||
|---------------------|--------------------|
|
||
| التوقف عن العمل في السنة | 8 س 45 د 57 ث |
|
||
| تعطل في الشهر | 43 م 49.7 ث |
|
||
| التوقف في الأسبوع | 10 م 4.8 ث |
|
||
| التوقف عن العمل في اليوم | 1 م و 26.4 ث |
|
||
|
||
#### التوفر بنسبة 99.99٪ - أربع 9 ثوانٍ
|
||
|
||
| المدة | وقت التوقف المقبول |
|
||
| --------------------- | -------------------- |
|
||
| التوقف عن العمل في السنة | 52 دقيقة و 35.7 ثانية |
|
||
| تعطل في الشهر | 4 م 23 ث |
|
||
| التوقف في الأسبوع | 1 م 5 ث |
|
||
| التوقف عن العمل في اليوم | 8.6 ثانية |
|
||
|
||
#### التوفر بالتوازي مقابل التسلسل
|
||
|
||
إذا كانت الخدمة تتكون من مكونات متعددة معرضة للفشل ، فإن التوافر الكلي للخدمة يعتمد على ما إذا كانت المكونات متسلسلة أو متوازية.
|
||
|
||
###### في تسلسل
|
||
|
||
يتناقص التوافر الإجمالي عندما يكون هناك مكونان بتوفر <100٪ في تسلسل:
|
||
|
||
""
|
||
التوفر (الإجمالي) = التوفر (Foo) * التوفر (Bar)
|
||
""
|
||
|
||
إذا كان لكل من "Foo" و "Bar" توفرًا بنسبة 99.9٪ ، فسيكون إجمالي الإتاحة في التسلسل 99.8٪.
|
||
|
||
###### بالتوازي
|
||
|
||
يزداد التوافر الإجمالي عندما يتوازى مكونان مع توفر <100٪:
|
||
|
||
""
|
||
التوفر (الإجمالي) = 1 - (1 - التوفر (Foo)) * (1 - التوفر (Bar))
|
||
""
|
||
|
||
إذا كان لكل من "Foo" و "Bar" توفرًا بنسبة 99.9٪ ، فإن الإتاحة الإجمالية على التوازي ستكون 99.9999٪.
|
||
|
||
## نظام اسم المجال
|
||
|
||
<p align="center">
|
||
<img src="images/IOyLj4i.jpg">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/srikrupa5/dns-security-presentation-issa>Source: DNS security presentation</a></i>
|
||
</p>
|
||
|
||
يترجم نظام اسم المجال (DNS) اسم مجال مثل www.example.com إلى عنوان IP.
|
||
|
||
DNS هرمي ، مع وجود عدد قليل من الخوادم الموثوقة في المستوى الأعلى. يوفر جهاز التوجيه أو موفر خدمة الإنترنت معلومات حول خادم (خوادم) DNS الذي يجب الاتصال به عند إجراء بحث. تعيينات ذاكرة التخزين المؤقت لخوادم DNS ذات المستوى الأدنى ، والتي قد تصبح قديمة بسبب تأخيرات انتشار DNS. يمكن أيضًا تخزين نتائج نظام أسماء النطاقات مؤقتًا بواسطة المتصفح أو نظام التشغيل لفترة زمنية معينة ، يتم تحديدها بواسطة [وقت البقاء (TTL)](https://en.wikipedia.org/wiki/Time_to_live).
|
||
|
||
* ** سجل NS (خادم الاسم) ** - يحدد خوادم DNS للمجال / المجال الفرعي الخاص بك.
|
||
* ** سجل MX (تبادل البريد) ** - يحدد خوادم البريد لقبول الرسائل.
|
||
* ** سجل (العنوان) ** - يشير اسمًا إلى عنوان IP.
|
||
* ** CNAME (أساسي) ** - يشير اسمًا إلى اسم آخر أو "CNAME" (example.com إلى www.example.com) أو إلى سجل "A".
|
||
|
||
خدمات مثل[CloudFlare](https://www.cloudflare.com/dns/) و [Route 53](https://aws.amazon.com/route53/) تقدم خدمات DNS المُدارة. يمكن لبعض خدمات DNS توجيه حركة المرور من خلال طرق مختلفة:
|
||
|
||
* [بمعيار round robin](https://www.g33kinfo.com/info/round-robin-vs-weighted-round-robin-lb)
|
||
* منع حركة المرور من الذهاب إلى الخوادم تحت الصيانة
|
||
* التوازن بين أحجام الكتلة المختلفة
|
||
* اختبار أ / ب
|
||
* [معتمدة على التأخير](https://docs.aws.amazon.com/Route53/latest/DeveloperGuide/routing-policy.html#routing-policy-latency)
|
||
* [معتمدة عالموقع الجغرافي](https://docs.aws.amazon.com/Route53/latest/DeveloperGuide/routing-policy.html#routing-policy-geo)
|
||
|
||
### العيوب: DNS
|
||
|
||
* يؤدي الوصول إلى خادم DNS إلى تأخير طفيف ، على الرغم من التخفيف من حدته عن طريق التخزين المؤقت الموضح أعلاه.
|
||
* قد تكون إدارة خادم DNS معقدة وتتم إدارتها بشكل عام بواسطة [الحكومات ومزودي خدمة الإنترنت والشركات الكبيرة](http://superuser.com/questions/472695/who-controls-the-dns-servers/472729).
|
||
* تعرضت خدمات DNS مؤخرًا إلى [هجوم DDoS](http://dyn.com/blog/dyn-analysis-summary-of-friday-october-21-attack/) ، مما يمنع المستخدمين من الوصول إلى مواقع الويب مثل Twitter دون معرفة عنوان (عناوين) IP الخاص بتويتر.
|
||
|
||
### المصدر (المصادر) وقراءات أخرى
|
||
|
||
* [هندسة DNS](https://technet.microsoft.com/en-us/library/dd197427 (v = ws.10) .aspx)
|
||
* [ويكيبيديا](https://en.wikipedia.org/wiki/Domain_Name_System)
|
||
* [مقالات DNS](https://support.dnsimple.com/categories/dns/)
|
||
|
||
## Content delivery network
|
||
|
||
<p align="center">
|
||
<img src="images/h9TAuGI.jpg">
|
||
<br/>
|
||
<i><a href=https://www.creative-artworks.eu/why-use-a-content-delivery-network-cdn/>Source: Why use a CDN</a></i>
|
||
</p>
|
||
|
||
A content delivery network (CDN) is a globally distributed network of proxy servers, serving content from locations closer to the user. Generally, static files such as HTML/CSS/JS, photos, and videos are served from CDN, although some CDNs such as Amazon's CloudFront support dynamic content. The site's DNS resolution will tell clients which server to contact.
|
||
|
||
Serving content from CDNs can significantly improve performance in two ways:
|
||
|
||
* Users receive content from data centers close to them
|
||
* Your servers do not have to serve requests that the CDN fulfills
|
||
|
||
### Push CDNs
|
||
|
||
Push CDNs receive new content whenever changes occur on your server. You take full responsibility for providing content, uploading directly to the CDN and rewriting URLs to point to the CDN. You can configure when content expires and when it is updated. Content is uploaded only when it is new or changed, minimizing traffic, but maximizing storage.
|
||
|
||
Sites with a small amount of traffic or sites with content that isn't often updated work well with push CDNs. Content is placed on the CDNs once, instead of being re-pulled at regular intervals.
|
||
|
||
### Pull CDNs
|
||
|
||
Pull CDNs grab new content from your server when the first user requests the content. You leave the content on your server and rewrite URLs to point to the CDN. This results in a slower request until the content is cached on the CDN.
|
||
|
||
A [time-to-live (TTL)](https://en.wikipedia.org/wiki/Time_to_live) determines how long content is cached. Pull CDNs minimize storage space on the CDN, but can create redundant traffic if files expire and are pulled before they have actually changed.
|
||
|
||
Sites with heavy traffic work well with pull CDNs, as traffic is spread out more evenly with only recently-requested content remaining on the CDN.
|
||
|
||
### Disadvantage(s): CDN
|
||
|
||
* CDN costs could be significant depending on traffic, although this should be weighed with additional costs you would incur not using a CDN.
|
||
* Content might be stale if it is updated before the TTL expires it.
|
||
* CDNs require changing URLs for static content to point to the CDN.
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [Globally distributed content delivery](https://figshare.com/articles/Globally_distributed_content_delivery/6605972)
|
||
* [The differences between push and pull CDNs](http://www.travelblogadvice.com/technical/the-differences-between-push-and-pull-cdns/)
|
||
* [Wikipedia](https://en.wikipedia.org/wiki/Content_delivery_network)
|
||
|
||
## Load balancer
|
||
|
||
<p align="center">
|
||
<img src="images/h81n9iK.png">
|
||
<br/>
|
||
<i><a href=http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html>Source: Scalable system design patterns</a></i>
|
||
</p>
|
||
|
||
Load balancers distribute incoming client requests to computing resources such as application servers and databases. In each case, the load balancer returns the response from the computing resource to the appropriate client. Load balancers are effective at:
|
||
|
||
* Preventing requests from going to unhealthy servers
|
||
* Preventing overloading resources
|
||
* Helping to eliminate a single point of failure
|
||
|
||
Load balancers can be implemented with hardware (expensive) or with software such as HAProxy.
|
||
|
||
Additional benefits include:
|
||
|
||
* **SSL termination** - Decrypt incoming requests and encrypt server responses so backend servers do not have to perform these potentially expensive operations
|
||
* Removes the need to install [X.509 certificates](https://en.wikipedia.org/wiki/X.509) on each server
|
||
* **Session persistence** - Issue cookies and route a specific client's requests to same instance if the web apps do not keep track of sessions
|
||
|
||
To protect against failures, it's common to set up multiple load balancers, either in [active-passive](#active-passive) or [active-active](#active-active) mode.
|
||
|
||
Load balancers can route traffic based on various metrics, including:
|
||
|
||
* Random
|
||
* Least loaded
|
||
* Session/cookies
|
||
* [Round robin or weighted round robin](https://www.g33kinfo.com/info/round-robin-vs-weighted-round-robin-lb)
|
||
* [Layer 4](#layer-4-load-balancing)
|
||
* [Layer 7](#layer-7-load-balancing)
|
||
|
||
### Layer 4 load balancing
|
||
|
||
Layer 4 load balancers look at info at the [transport layer](#communication) to decide how to distribute requests. Generally, this involves the source, destination IP addresses, and ports in the header, but not the contents of the packet. Layer 4 load balancers forward network packets to and from the upstream server, performing [Network Address Translation (NAT)](https://www.nginx.com/resources/glossary/layer-4-load-balancing/).
|
||
|
||
### Layer 7 load balancing
|
||
|
||
Layer 7 load balancers look at the [application layer](#communication) to decide how to distribute requests. This can involve contents of the header, message, and cookies. Layer 7 load balancers terminate network traffic, reads the message, makes a load-balancing decision, then opens a connection to the selected server. For example, a layer 7 load balancer can direct video traffic to servers that host videos while directing more sensitive user billing traffic to security-hardened servers.
|
||
|
||
At the cost of flexibility, layer 4 load balancing requires less time and computing resources than Layer 7, although the performance impact can be minimal on modern commodity hardware.
|
||
|
||
### Horizontal scaling
|
||
|
||
Load balancers can also help with horizontal scaling, improving performance and availability. Scaling out using commodity machines is more cost efficient and results in higher availability than scaling up a single server on more expensive hardware, called **Vertical Scaling**. It is also easier to hire for talent working on commodity hardware than it is for specialized enterprise systems.
|
||
|
||
#### Disadvantage(s): horizontal scaling
|
||
|
||
* Scaling horizontally introduces complexity and involves cloning servers
|
||
* Servers should be stateless: they should not contain any user-related data like sessions or profile pictures
|
||
* Sessions can be stored in a centralized data store such as a [database](#database) (SQL, NoSQL) or a persistent [cache](#cache) (Redis, Memcached)
|
||
* Downstream servers such as caches and databases need to handle more simultaneous connections as upstream servers scale out
|
||
|
||
### Disadvantage(s): load balancer
|
||
|
||
* The load balancer can become a performance bottleneck if it does not have enough resources or if it is not configured properly.
|
||
* Introducing a load balancer to help eliminate a single point of failure results in increased complexity.
|
||
* A single load balancer is a single point of failure, configuring multiple load balancers further increases complexity.
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [NGINX architecture](https://www.nginx.com/blog/inside-nginx-how-we-designed-for-performance-scale/)
|
||
* [HAProxy architecture guide](http://www.haproxy.org/download/1.2/doc/architecture.txt)
|
||
* [Scalability](http://www.lecloud.net/post/7295452622/scalability-for-dummies-part-1-clones)
|
||
* [Wikipedia](https://en.wikipedia.org/wiki/Load_balancing_(computing))
|
||
* [Layer 4 load balancing](https://www.nginx.com/resources/glossary/layer-4-load-balancing/)
|
||
* [Layer 7 load balancing](https://www.nginx.com/resources/glossary/layer-7-load-balancing/)
|
||
* [ELB listener config](http://docs.aws.amazon.com/elasticloadbalancing/latest/classic/elb-listener-config.html)
|
||
|
||
## Reverse proxy (web server)
|
||
|
||
<p align="center">
|
||
<img src="images/n41Azff.png">
|
||
<br/>
|
||
<i><a href=https://upload.wikimedia.org/wikipedia/commons/6/67/Reverse_proxy_h2g2bob.svg>Source: Wikipedia</a></i>
|
||
<br/>
|
||
</p>
|
||
|
||
A reverse proxy is a web server that centralizes internal services and provides unified interfaces to the public. Requests from clients are forwarded to a server that can fulfill it before the reverse proxy returns the server's response to the client.
|
||
|
||
Additional benefits include:
|
||
|
||
* **Increased security** - Hide information about backend servers, blacklist IPs, limit number of connections per client
|
||
* **Increased scalability and flexibility** - Clients only see the reverse proxy's IP, allowing you to scale servers or change their configuration
|
||
* **SSL termination** - Decrypt incoming requests and encrypt server responses so backend servers do not have to perform these potentially expensive operations
|
||
* Removes the need to install [X.509 certificates](https://en.wikipedia.org/wiki/X.509) on each server
|
||
* **Compression** - Compress server responses
|
||
* **Caching** - Return the response for cached requests
|
||
* **Static content** - Serve static content directly
|
||
* HTML/CSS/JS
|
||
* Photos
|
||
* Videos
|
||
* Etc
|
||
|
||
### Load balancer vs reverse proxy
|
||
|
||
* Deploying a load balancer is useful when you have multiple servers. Often, load balancers route traffic to a set of servers serving the same function.
|
||
* Reverse proxies can be useful even with just one web server or application server, opening up the benefits described in the previous section.
|
||
* Solutions such as NGINX and HAProxy can support both layer 7 reverse proxying and load balancing.
|
||
|
||
### Disadvantage(s): reverse proxy
|
||
|
||
* Introducing a reverse proxy results in increased complexity.
|
||
* A single reverse proxy is a single point of failure, configuring multiple reverse proxies (ie a [failover](https://en.wikipedia.org/wiki/Failover)) further increases complexity.
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [Reverse proxy vs load balancer](https://www.nginx.com/resources/glossary/reverse-proxy-vs-load-balancer/)
|
||
* [NGINX architecture](https://www.nginx.com/blog/inside-nginx-how-we-designed-for-performance-scale/)
|
||
* [HAProxy architecture guide](http://www.haproxy.org/download/1.2/doc/architecture.txt)
|
||
* [Wikipedia](https://en.wikipedia.org/wiki/Reverse_proxy)
|
||
|
||
## Application layer
|
||
|
||
<p align="center">
|
||
<img src="images/yB5SYwm.png">
|
||
<br/>
|
||
<i><a href=http://lethain.com/introduction-to-architecting-systems-for-scale/#platform_layer>Source: Intro to architecting systems for scale</a></i>
|
||
</p>
|
||
|
||
Separating out the web layer from the application layer (also known as platform layer) allows you to scale and configure both layers independently. Adding a new API results in adding application servers without necessarily adding additional web servers. The **single responsibility principle** advocates for small and autonomous services that work together. Small teams with small services can plan more aggressively for rapid growth.
|
||
|
||
Workers in the application layer also help enable [asynchronism](#asynchronism).
|
||
|
||
### Microservices
|
||
|
||
Related to this discussion are [microservices](https://en.wikipedia.org/wiki/Microservices), which can be described as a suite of independently deployable, small, modular services. Each service runs a unique process and communicates through a well-defined, lightweight mechanism to serve a business goal. <sup><a href=https://smartbear.com/learn/api-design/what-are-microservices>1</a></sup>
|
||
|
||
Pinterest, for example, could have the following microservices: user profile, follower, feed, search, photo upload, etc.
|
||
|
||
### Service Discovery
|
||
|
||
Systems such as [Consul](https://www.consul.io/docs/index.html), [Etcd](https://coreos.com/etcd/docs/latest), and [Zookeeper](http://www.slideshare.net/sauravhaloi/introduction-to-apache-zookeeper) can help services find each other by keeping track of registered names, addresses, and ports. [Health checks](https://www.consul.io/intro/getting-started/checks.html) help verify service integrity and are often done using an [HTTP](#hypertext-transfer-protocol-http) endpoint. Both Consul and Etcd have a built in [key-value store](#key-value-store) that can be useful for storing config values and other shared data.
|
||
|
||
### Disadvantage(s): application layer
|
||
|
||
* Adding an application layer with loosely coupled services requires a different approach from an architectural, operations, and process viewpoint (vs a monolithic system).
|
||
* Microservices can add complexity in terms of deployments and operations.
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [Intro to architecting systems for scale](http://lethain.com/introduction-to-architecting-systems-for-scale)
|
||
* [Crack the system design interview](http://www.puncsky.com/blog/2016-02-13-crack-the-system-design-interview)
|
||
* [Service oriented architecture](https://en.wikipedia.org/wiki/Service-oriented_architecture)
|
||
* [Introduction to Zookeeper](http://www.slideshare.net/sauravhaloi/introduction-to-apache-zookeeper)
|
||
* [Here's what you need to know about building microservices](https://cloudncode.wordpress.com/2016/07/22/msa-getting-started/)
|
||
|
||
## Database
|
||
|
||
<p align="center">
|
||
<img src="images/Xkm5CXz.png">
|
||
<br/>
|
||
<i><a href=https://www.youtube.com/watch?v=kKjm4ehYiMs>Source: Scaling up to your first 10 million users</a></i>
|
||
</p>
|
||
|
||
### Relational database management system (RDBMS)
|
||
|
||
A relational database like SQL is a collection of data items organized in tables.
|
||
|
||
**ACID** is a set of properties of relational database [transactions](https://en.wikipedia.org/wiki/Database_transaction).
|
||
|
||
* **Atomicity** - Each transaction is all or nothing
|
||
* **Consistency** - Any transaction will bring the database from one valid state to another
|
||
* **Isolation** - Executing transactions concurrently has the same results as if the transactions were executed serially
|
||
* **Durability** - Once a transaction has been committed, it will remain so
|
||
|
||
There are many techniques to scale a relational database: **master-slave replication**, **master-master replication**, **federation**, **sharding**, **denormalization**, and **SQL tuning**.
|
||
|
||
#### Master-slave replication
|
||
|
||
The master serves reads and writes, replicating writes to one or more slaves, which serve only reads. Slaves can also replicate to additional slaves in a tree-like fashion. If the master goes offline, the system can continue to operate in read-only mode until a slave is promoted to a master or a new master is provisioned.
|
||
|
||
<p align="center">
|
||
<img src="images/C9ioGtn.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/jboner/scalability-availability-stability-patterns/>Source: Scalability, availability, stability, patterns</a></i>
|
||
</p>
|
||
|
||
##### Disadvantage(s): master-slave replication
|
||
|
||
* Additional logic is needed to promote a slave to a master.
|
||
* See [Disadvantage(s): replication](#disadvantages-replication) for points related to **both** master-slave and master-master.
|
||
|
||
#### Master-master replication
|
||
|
||
Both masters serve reads and writes and coordinate with each other on writes. If either master goes down, the system can continue to operate with both reads and writes.
|
||
|
||
<p align="center">
|
||
<img src="images/krAHLGg.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/jboner/scalability-availability-stability-patterns/>Source: Scalability, availability, stability, patterns</a></i>
|
||
</p>
|
||
|
||
##### Disadvantage(s): master-master replication
|
||
|
||
* You'll need a load balancer or you'll need to make changes to your application logic to determine where to write.
|
||
* Most master-master systems are either loosely consistent (violating ACID) or have increased write latency due to synchronization.
|
||
* Conflict resolution comes more into play as more write nodes are added and as latency increases.
|
||
* See [Disadvantage(s): replication](#disadvantages-replication) for points related to **both** master-slave and master-master.
|
||
|
||
##### Disadvantage(s): replication
|
||
|
||
* There is a potential for loss of data if the master fails before any newly written data can be replicated to other nodes.
|
||
* Writes are replayed to the read replicas. If there are a lot of writes, the read replicas can get bogged down with replaying writes and can't do as many reads.
|
||
* The more read slaves, the more you have to replicate, which leads to greater replication lag.
|
||
* On some systems, writing to the master can spawn multiple threads to write in parallel, whereas read replicas only support writing sequentially with a single thread.
|
||
* Replication adds more hardware and additional complexity.
|
||
|
||
##### Source(s) and further reading: replication
|
||
|
||
* [Scalability, availability, stability, patterns](http://www.slideshare.net/jboner/scalability-availability-stability-patterns/)
|
||
* [Multi-master replication](https://en.wikipedia.org/wiki/Multi-master_replication)
|
||
|
||
#### Federation
|
||
|
||
<p align="center">
|
||
<img src="images/U3qV33e.png">
|
||
<br/>
|
||
<i><a href=https://www.youtube.com/watch?v=kKjm4ehYiMs>Source: Scaling up to your first 10 million users</a></i>
|
||
</p>
|
||
|
||
Federation (or functional partitioning) splits up databases by function. For example, instead of a single, monolithic database, you could have three databases: **forums**, **users**, and **products**, resulting in less read and write traffic to each database and therefore less replication lag. Smaller databases result in more data that can fit in memory, which in turn results in more cache hits due to improved cache locality. With no single central master serializing writes you can write in parallel, increasing throughput.
|
||
|
||
##### Disadvantage(s): federation
|
||
|
||
* Federation is not effective if your schema requires huge functions or tables.
|
||
* You'll need to update your application logic to determine which database to read and write.
|
||
* Joining data from two databases is more complex with a [server link](http://stackoverflow.com/questions/5145637/querying-data-by-joining-two-tables-in-two-database-on-different-servers).
|
||
* Federation adds more hardware and additional complexity.
|
||
|
||
##### Source(s) and further reading: federation
|
||
|
||
* [Scaling up to your first 10 million users](https://www.youtube.com/watch?v=kKjm4ehYiMs)
|
||
|
||
#### Sharding
|
||
|
||
<p align="center">
|
||
<img src="images/wU8x5Id.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/jboner/scalability-availability-stability-patterns/>Source: Scalability, availability, stability, patterns</a></i>
|
||
</p>
|
||
|
||
Sharding distributes data across different databases such that each database can only manage a subset of the data. Taking a users database as an example, as the number of users increases, more shards are added to the cluster.
|
||
|
||
Similar to the advantages of [federation](#federation), sharding results in less read and write traffic, less replication, and more cache hits. Index size is also reduced, which generally improves performance with faster queries. If one shard goes down, the other shards are still operational, although you'll want to add some form of replication to avoid data loss. Like federation, there is no single central master serializing writes, allowing you to write in parallel with increased throughput.
|
||
|
||
Common ways to shard a table of users is either through the user's last name initial or the user's geographic location.
|
||
|
||
##### Disadvantage(s): sharding
|
||
|
||
* You'll need to update your application logic to work with shards, which could result in complex SQL queries.
|
||
* Data distribution can become lopsided in a shard. For example, a set of power users on a shard could result in increased load to that shard compared to others.
|
||
* Rebalancing adds additional complexity. A sharding function based on [consistent hashing](http://www.paperplanes.de/2011/12/9/the-magic-of-consistent-hashing.html) can reduce the amount of transferred data.
|
||
* Joining data from multiple shards is more complex.
|
||
* Sharding adds more hardware and additional complexity.
|
||
|
||
##### Source(s) and further reading: sharding
|
||
|
||
* [The coming of the shard](http://highscalability.com/blog/2009/8/6/an-unorthodox-approach-to-database-design-the-coming-of-the.html)
|
||
* [Shard database architecture](https://en.wikipedia.org/wiki/Shard_(database_architecture))
|
||
* [Consistent hashing](http://www.paperplanes.de/2011/12/9/the-magic-of-consistent-hashing.html)
|
||
|
||
#### Denormalization
|
||
|
||
Denormalization attempts to improve read performance at the expense of some write performance. Redundant copies of the data are written in multiple tables to avoid expensive joins. Some RDBMS such as [PostgreSQL](https://en.wikipedia.org/wiki/PostgreSQL) and Oracle support [materialized views](https://en.wikipedia.org/wiki/Materialized_view) which handle the work of storing redundant information and keeping redundant copies consistent.
|
||
|
||
Once data becomes distributed with techniques such as [federation](#federation) and [sharding](#sharding), managing joins across data centers further increases complexity. Denormalization might circumvent the need for such complex joins.
|
||
|
||
In most systems, reads can heavily outnumber writes 100:1 or even 1000:1. A read resulting in a complex database join can be very expensive, spending a significant amount of time on disk operations.
|
||
|
||
##### Disadvantage(s): denormalization
|
||
|
||
* Data is duplicated.
|
||
* Constraints can help redundant copies of information stay in sync, which increases complexity of the database design.
|
||
* A denormalized database under heavy write load might perform worse than its normalized counterpart.
|
||
|
||
###### Source(s) and further reading: denormalization
|
||
|
||
* [Denormalization](https://en.wikipedia.org/wiki/Denormalization)
|
||
|
||
#### SQL tuning
|
||
|
||
SQL tuning is a broad topic and many [books](https://www.amazon.com/s/ref=nb_sb_noss_2?url=search-alias%3Daps&field-keywords=sql+tuning) have been written as reference.
|
||
|
||
It's important to **benchmark** and **profile** to simulate and uncover bottlenecks.
|
||
|
||
* **Benchmark** - Simulate high-load situations with tools such as [ab](http://httpd.apache.org/docs/2.2/programs/ab.html).
|
||
* **Profile** - Enable tools such as the [slow query log](http://dev.mysql.com/doc/refman/5.7/en/slow-query-log.html) to help track performance issues.
|
||
|
||
Benchmarking and profiling might point you to the following optimizations.
|
||
|
||
##### Tighten up the schema
|
||
|
||
* MySQL dumps to disk in contiguous blocks for fast access.
|
||
* Use `CHAR` instead of `VARCHAR` for fixed-length fields.
|
||
* `CHAR` effectively allows for fast, random access, whereas with `VARCHAR`, you must find the end of a string before moving onto the next one.
|
||
* Use `TEXT` for large blocks of text such as blog posts. `TEXT` also allows for boolean searches. Using a `TEXT` field results in storing a pointer on disk that is used to locate the text block.
|
||
* Use `INT` for larger numbers up to 2^32 or 4 billion.
|
||
* Use `DECIMAL` for currency to avoid floating point representation errors.
|
||
* Avoid storing large `BLOBS`, store the location of where to get the object instead.
|
||
* `VARCHAR(255)` is the largest number of characters that can be counted in an 8 bit number, often maximizing the use of a byte in some RDBMS.
|
||
* Set the `NOT NULL` constraint where applicable to [improve search performance](http://stackoverflow.com/questions/1017239/how-do-null-values-affect-performance-in-a-database-search).
|
||
|
||
##### Use good indices
|
||
|
||
* Columns that you are querying (`SELECT`, `GROUP BY`, `ORDER BY`, `JOIN`) could be faster with indices.
|
||
* Indices are usually represented as self-balancing [B-tree](https://en.wikipedia.org/wiki/B-tree) that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time.
|
||
* Placing an index can keep the data in memory, requiring more space.
|
||
* Writes could also be slower since the index also needs to be updated.
|
||
* When loading large amounts of data, it might be faster to disable indices, load the data, then rebuild the indices.
|
||
|
||
##### Avoid expensive joins
|
||
|
||
* [Denormalize](#denormalization) where performance demands it.
|
||
|
||
##### Partition tables
|
||
|
||
* Break up a table by putting hot spots in a separate table to help keep it in memory.
|
||
|
||
##### Tune the query cache
|
||
|
||
* In some cases, the [query cache](https://dev.mysql.com/doc/refman/5.7/en/query-cache.html) could lead to [performance issues](https://www.percona.com/blog/2016/10/12/mysql-5-7-performance-tuning-immediately-after-installation/).
|
||
|
||
##### Source(s) and further reading: SQL tuning
|
||
|
||
* [Tips for optimizing MySQL queries](http://aiddroid.com/10-tips-optimizing-mysql-queries-dont-suck/)
|
||
* [Is there a good reason i see VARCHAR(255) used so often?](http://stackoverflow.com/questions/1217466/is-there-a-good-reason-i-see-varchar255-used-so-often-as-opposed-to-another-l)
|
||
* [How do null values affect performance?](http://stackoverflow.com/questions/1017239/how-do-null-values-affect-performance-in-a-database-search)
|
||
* [Slow query log](http://dev.mysql.com/doc/refman/5.7/en/slow-query-log.html)
|
||
|
||
### NoSQL
|
||
|
||
NoSQL is a collection of data items represented in a **key-value store**, **document store**, **wide column store**, or a **graph database**. Data is denormalized, and joins are generally done in the application code. Most NoSQL stores lack true ACID transactions and favor [eventual consistency](#eventual-consistency).
|
||
|
||
**BASE** is often used to describe the properties of NoSQL databases. In comparison with the [CAP Theorem](#cap-theorem), BASE chooses availability over consistency.
|
||
|
||
* **Basically available** - the system guarantees availability.
|
||
* **Soft state** - the state of the system may change over time, even without input.
|
||
* **Eventual consistency** - the system will become consistent over a period of time, given that the system doesn't receive input during that period.
|
||
|
||
In addition to choosing between [SQL or NoSQL](#sql-or-nosql), it is helpful to understand which type of NoSQL database best fits your use case(s). We'll review **key-value stores**, **document stores**, **wide column stores**, and **graph databases** in the next section.
|
||
|
||
#### Key-value store
|
||
|
||
> Abstraction: hash table
|
||
|
||
A key-value store generally allows for O(1) reads and writes and is often backed by memory or SSD. Data stores can maintain keys in [lexicographic order](https://en.wikipedia.org/wiki/Lexicographical_order), allowing efficient retrieval of key ranges. Key-value stores can allow for storing of metadata with a value.
|
||
|
||
Key-value stores provide high performance and are often used for simple data models or for rapidly-changing data, such as an in-memory cache layer. Since they offer only a limited set of operations, complexity is shifted to the application layer if additional operations are needed.
|
||
|
||
A key-value store is the basis for more complex systems such as a document store, and in some cases, a graph database.
|
||
|
||
##### Source(s) and further reading: key-value store
|
||
|
||
* [Key-value database](https://en.wikipedia.org/wiki/Key-value_database)
|
||
* [Disadvantages of key-value stores](http://stackoverflow.com/questions/4056093/what-are-the-disadvantages-of-using-a-key-value-table-over-nullable-columns-or)
|
||
* [Redis architecture](http://qnimate.com/overview-of-redis-architecture/)
|
||
* [Memcached architecture](https://www.adayinthelifeof.nl/2011/02/06/memcache-internals/)
|
||
|
||
#### Document store
|
||
|
||
> Abstraction: key-value store with documents stored as values
|
||
|
||
A document store is centered around documents (XML, JSON, binary, etc), where a document stores all information for a given object. Document stores provide APIs or a query language to query based on the internal structure of the document itself. *Note, many key-value stores include features for working with a value's metadata, blurring the lines between these two storage types.*
|
||
|
||
Based on the underlying implementation, documents are organized by collections, tags, metadata, or directories. Although documents can be organized or grouped together, documents may have fields that are completely different from each other.
|
||
|
||
Some document stores like [MongoDB](https://www.mongodb.com/mongodb-architecture) and [CouchDB](https://blog.couchdb.org/2016/08/01/couchdb-2-0-architecture/) also provide a SQL-like language to perform complex queries. [DynamoDB](http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/decandia07dynamo.pdf) supports both key-values and documents.
|
||
|
||
Document stores provide high flexibility and are often used for working with occasionally changing data.
|
||
|
||
##### Source(s) and further reading: document store
|
||
|
||
* [Document-oriented database](https://en.wikipedia.org/wiki/Document-oriented_database)
|
||
* [MongoDB architecture](https://www.mongodb.com/mongodb-architecture)
|
||
* [CouchDB architecture](https://blog.couchdb.org/2016/08/01/couchdb-2-0-architecture/)
|
||
* [Elasticsearch architecture](https://www.elastic.co/blog/found-elasticsearch-from-the-bottom-up)
|
||
|
||
#### Wide column store
|
||
|
||
<p align="center">
|
||
<img src="images/n16iOGk.png">
|
||
<br/>
|
||
<i><a href=http://blog.grio.com/2015/11/sql-nosql-a-brief-history.html>Source: SQL & NoSQL, a brief history</a></i>
|
||
</p>
|
||
|
||
> Abstraction: nested map `ColumnFamily<RowKey, Columns<ColKey, Value, Timestamp>>`
|
||
|
||
A wide column store's basic unit of data is a column (name/value pair). A column can be grouped in column families (analogous to a SQL table). Super column families further group column families. You can access each column independently with a row key, and columns with the same row key form a row. Each value contains a timestamp for versioning and for conflict resolution.
|
||
|
||
Google introduced [Bigtable](http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/chang06bigtable.pdf) as the first wide column store, which influenced the open-source [HBase](https://www.edureka.co/blog/hbase-architecture/) often-used in the Hadoop ecosystem, and [Cassandra](http://docs.datastax.com/en/cassandra/3.0/cassandra/architecture/archIntro.html) from Facebook. Stores such as BigTable, HBase, and Cassandra maintain keys in lexicographic order, allowing efficient retrieval of selective key ranges.
|
||
|
||
Wide column stores offer high availability and high scalability. They are often used for very large data sets.
|
||
|
||
##### Source(s) and further reading: wide column store
|
||
|
||
* [SQL & NoSQL, a brief history](http://blog.grio.com/2015/11/sql-nosql-a-brief-history.html)
|
||
* [Bigtable architecture](http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/chang06bigtable.pdf)
|
||
* [HBase architecture](https://www.edureka.co/blog/hbase-architecture/)
|
||
* [Cassandra architecture](http://docs.datastax.com/en/cassandra/3.0/cassandra/architecture/archIntro.html)
|
||
|
||
#### Graph database
|
||
|
||
<p align="center">
|
||
<img src="images/fNcl65g.png">
|
||
<br/>
|
||
<i><a href=https://en.wikipedia.org/wiki/File:GraphDatabase_PropertyGraph.png>Source: Graph database</a></i>
|
||
</p>
|
||
|
||
> Abstraction: graph
|
||
|
||
In a graph database, each node is a record and each arc is a relationship between two nodes. Graph databases are optimized to represent complex relationships with many foreign keys or many-to-many relationships.
|
||
|
||
Graphs databases offer high performance for data models with complex relationships, such as a social network. They are relatively new and are not yet widely-used; it might be more difficult to find development tools and resources. Many graphs can only be accessed with [REST APIs](#representational-state-transfer-rest).
|
||
|
||
##### Source(s) and further reading: graph
|
||
|
||
* [Graph database](https://en.wikipedia.org/wiki/Graph_database)
|
||
* [Neo4j](https://neo4j.com/)
|
||
* [FlockDB](https://blog.twitter.com/2010/introducing-flockdb)
|
||
|
||
#### Source(s) and further reading: NoSQL
|
||
|
||
* [Explanation of base terminology](http://stackoverflow.com/questions/3342497/explanation-of-base-terminology)
|
||
* [NoSQL databases a survey and decision guidance](https://medium.com/baqend-blog/nosql-databases-a-survey-and-decision-guidance-ea7823a822d#.wskogqenq)
|
||
* [Scalability](http://www.lecloud.net/post/7994751381/scalability-for-dummies-part-2-database)
|
||
* [Introduction to NoSQL](https://www.youtube.com/watch?v=qI_g07C_Q5I)
|
||
* [NoSQL patterns](http://horicky.blogspot.com/2009/11/nosql-patterns.html)
|
||
|
||
### SQL or NoSQL
|
||
|
||
<p align="center">
|
||
<img src="images/wXGqG5f.png">
|
||
<br/>
|
||
<i><a href=https://www.infoq.com/articles/Transition-RDBMS-NoSQL/>Source: Transitioning from RDBMS to NoSQL</a></i>
|
||
</p>
|
||
|
||
Reasons for **SQL**:
|
||
|
||
* Structured data
|
||
* Strict schema
|
||
* Relational data
|
||
* Need for complex joins
|
||
* Transactions
|
||
* Clear patterns for scaling
|
||
* More established: developers, community, code, tools, etc
|
||
* Lookups by index are very fast
|
||
|
||
Reasons for **NoSQL**:
|
||
|
||
* Semi-structured data
|
||
* Dynamic or flexible schema
|
||
* Non-relational data
|
||
* No need for complex joins
|
||
* Store many TB (or PB) of data
|
||
* Very data intensive workload
|
||
* Very high throughput for IOPS
|
||
|
||
Sample data well-suited for NoSQL:
|
||
|
||
* Rapid ingest of clickstream and log data
|
||
* Leaderboard or scoring data
|
||
* Temporary data, such as a shopping cart
|
||
* Frequently accessed ('hot') tables
|
||
* Metadata/lookup tables
|
||
|
||
##### Source(s) and further reading: SQL or NoSQL
|
||
|
||
* [Scaling up to your first 10 million users](https://www.youtube.com/watch?v=kKjm4ehYiMs)
|
||
* [SQL vs NoSQL differences](https://www.sitepoint.com/sql-vs-nosql-differences/)
|
||
|
||
## Cache
|
||
|
||
<p align="center">
|
||
<img src="images/Q6z24La.png">
|
||
<br/>
|
||
<i><a href=http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html>Source: Scalable system design patterns</a></i>
|
||
</p>
|
||
|
||
Caching improves page load times and can reduce the load on your servers and databases. In this model, the dispatcher will first lookup if the request has been made before and try to find the previous result to return, in order to save the actual execution.
|
||
|
||
Databases often benefit from a uniform distribution of reads and writes across its partitions. Popular items can skew the distribution, causing bottlenecks. Putting a cache in front of a database can help absorb uneven loads and spikes in traffic.
|
||
|
||
### Client caching
|
||
|
||
Caches can be located on the client side (OS or browser), [server side](#reverse-proxy-web-server), or in a distinct cache layer.
|
||
|
||
### CDN caching
|
||
|
||
[CDNs](#content-delivery-network) are considered a type of cache.
|
||
|
||
### Web server caching
|
||
|
||
[Reverse proxies](#reverse-proxy-web-server) and caches such as [Varnish](https://www.varnish-cache.org/) can serve static and dynamic content directly. Web servers can also cache requests, returning responses without having to contact application servers.
|
||
|
||
### Database caching
|
||
|
||
Your database usually includes some level of caching in a default configuration, optimized for a generic use case. Tweaking these settings for specific usage patterns can further boost performance.
|
||
|
||
### Application caching
|
||
|
||
In-memory caches such as Memcached and Redis are key-value stores between your application and your data storage. Since the data is held in RAM, it is much faster than typical databases where data is stored on disk. RAM is more limited than disk, so [cache invalidation](https://en.wikipedia.org/wiki/Cache_algorithms) algorithms such as [least recently used (LRU)](https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)) can help invalidate 'cold' entries and keep 'hot' data in RAM.
|
||
|
||
Redis has the following additional features:
|
||
|
||
* Persistence option
|
||
* Built-in data structures such as sorted sets and lists
|
||
|
||
There are multiple levels you can cache that fall into two general categories: **database queries** and **objects**:
|
||
|
||
* Row level
|
||
* Query-level
|
||
* Fully-formed serializable objects
|
||
* Fully-rendered HTML
|
||
|
||
Generally, you should try to avoid file-based caching, as it makes cloning and auto-scaling more difficult.
|
||
|
||
### Caching at the database query level
|
||
|
||
Whenever you query the database, hash the query as a key and store the result to the cache. This approach suffers from expiration issues:
|
||
|
||
* Hard to delete a cached result with complex queries
|
||
* If one piece of data changes such as a table cell, you need to delete all cached queries that might include the changed cell
|
||
|
||
### Caching at the object level
|
||
|
||
See your data as an object, similar to what you do with your application code. Have your application assemble the dataset from the database into a class instance or a data structure(s):
|
||
|
||
* Remove the object from cache if its underlying data has changed
|
||
* Allows for asynchronous processing: workers assemble objects by consuming the latest cached object
|
||
|
||
Suggestions of what to cache:
|
||
|
||
* User sessions
|
||
* Fully rendered web pages
|
||
* Activity streams
|
||
* User graph data
|
||
|
||
### When to update the cache
|
||
|
||
Since you can only store a limited amount of data in cache, you'll need to determine which cache update strategy works best for your use case.
|
||
|
||
#### Cache-aside
|
||
|
||
<p align="center">
|
||
<img src="images/ONjORqk.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/tmatyashovsky/from-cache-to-in-memory-data-grid-introduction-to-hazelcast>Source: From cache to in-memory data grid</a></i>
|
||
</p>
|
||
|
||
The application is responsible for reading and writing from storage. The cache does not interact with storage directly. The application does the following:
|
||
|
||
* Look for entry in cache, resulting in a cache miss
|
||
* Load entry from the database
|
||
* Add entry to cache
|
||
* Return entry
|
||
|
||
```python
|
||
def get_user(self, user_id):
|
||
user = cache.get("user.{0}", user_id)
|
||
if user is None:
|
||
user = db.query("SELECT * FROM users WHERE user_id = {0}", user_id)
|
||
if user is not None:
|
||
key = "user.{0}".format(user_id)
|
||
cache.set(key, json.dumps(user))
|
||
return user
|
||
```
|
||
|
||
[Memcached](https://memcached.org/) is generally used in this manner.
|
||
|
||
Subsequent reads of data added to cache are fast. Cache-aside is also referred to as lazy loading. Only requested data is cached, which avoids filling up the cache with data that isn't requested.
|
||
|
||
##### Disadvantage(s): cache-aside
|
||
|
||
* Each cache miss results in three trips, which can cause a noticeable delay.
|
||
* Data can become stale if it is updated in the database. This issue is mitigated by setting a time-to-live (TTL) which forces an update of the cache entry, or by using write-through.
|
||
* When a node fails, it is replaced by a new, empty node, increasing latency.
|
||
|
||
#### Write-through
|
||
|
||
<p align="center">
|
||
<img src="images/0vBc0hN.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/jboner/scalability-availability-stability-patterns/>Source: Scalability, availability, stability, patterns</a></i>
|
||
</p>
|
||
|
||
The application uses the cache as the main data store, reading and writing data to it, while the cache is responsible for reading and writing to the database:
|
||
|
||
* Application adds/updates entry in cache
|
||
* Cache synchronously writes entry to data store
|
||
* Return
|
||
|
||
Application code:
|
||
|
||
```python
|
||
set_user(12345, {"foo":"bar"})
|
||
```
|
||
|
||
Cache code:
|
||
|
||
```python
|
||
def set_user(user_id, values):
|
||
user = db.query("UPDATE Users WHERE id = {0}", user_id, values)
|
||
cache.set(user_id, user)
|
||
```
|
||
|
||
Write-through is a slow overall operation due to the write operation, but subsequent reads of just written data are fast. Users are generally more tolerant of latency when updating data than reading data. Data in the cache is not stale.
|
||
|
||
##### Disadvantage(s): write through
|
||
|
||
* When a new node is created due to failure or scaling, the new node will not cache entries until the entry is updated in the database. Cache-aside in conjunction with write through can mitigate this issue.
|
||
* Most data written might never be read, which can be minimized with a TTL.
|
||
|
||
#### Write-behind (write-back)
|
||
|
||
<p align="center">
|
||
<img src="images/rgSrvjG.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/jboner/scalability-availability-stability-patterns/>Source: Scalability, availability, stability, patterns</a></i>
|
||
</p>
|
||
|
||
In write-behind, the application does the following:
|
||
|
||
* Add/update entry in cache
|
||
* Asynchronously write entry to the data store, improving write performance
|
||
|
||
##### Disadvantage(s): write-behind
|
||
|
||
* There could be data loss if the cache goes down prior to its contents hitting the data store.
|
||
* It is more complex to implement write-behind than it is to implement cache-aside or write-through.
|
||
|
||
#### Refresh-ahead
|
||
|
||
<p align="center">
|
||
<img src="images/kxtjqgE.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/tmatyashovsky/from-cache-to-in-memory-data-grid-introduction-to-hazelcast>Source: From cache to in-memory data grid</a></i>
|
||
</p>
|
||
|
||
You can configure the cache to automatically refresh any recently accessed cache entry prior to its expiration.
|
||
|
||
Refresh-ahead can result in reduced latency vs read-through if the cache can accurately predict which items are likely to be needed in the future.
|
||
|
||
##### Disadvantage(s): refresh-ahead
|
||
|
||
* Not accurately predicting which items are likely to be needed in the future can result in reduced performance than without refresh-ahead.
|
||
|
||
### Disadvantage(s): cache
|
||
|
||
* Need to maintain consistency between caches and the source of truth such as the database through [cache invalidation](https://en.wikipedia.org/wiki/Cache_algorithms).
|
||
* Cache invalidation is a difficult problem, there is additional complexity associated with when to update the cache.
|
||
* Need to make application changes such as adding Redis or memcached.
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [From cache to in-memory data grid](http://www.slideshare.net/tmatyashovsky/from-cache-to-in-memory-data-grid-introduction-to-hazelcast)
|
||
* [Scalable system design patterns](http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html)
|
||
* [Introduction to architecting systems for scale](http://lethain.com/introduction-to-architecting-systems-for-scale/)
|
||
* [Scalability, availability, stability, patterns](http://www.slideshare.net/jboner/scalability-availability-stability-patterns/)
|
||
* [Scalability](http://www.lecloud.net/post/9246290032/scalability-for-dummies-part-3-cache)
|
||
* [AWS ElastiCache strategies](http://docs.aws.amazon.com/AmazonElastiCache/latest/UserGuide/Strategies.html)
|
||
* [Wikipedia](https://en.wikipedia.org/wiki/Cache_(computing))
|
||
|
||
## Asynchronism
|
||
|
||
<p align="center">
|
||
<img src="images/54GYsSx.png">
|
||
<br/>
|
||
<i><a href=http://lethain.com/introduction-to-architecting-systems-for-scale/#platform_layer>Source: Intro to architecting systems for scale</a></i>
|
||
</p>
|
||
|
||
Asynchronous workflows help reduce request times for expensive operations that would otherwise be performed in-line. They can also help by doing time-consuming work in advance, such as periodic aggregation of data.
|
||
|
||
### Message queues
|
||
|
||
Message queues receive, hold, and deliver messages. If an operation is too slow to perform inline, you can use a message queue with the following workflow:
|
||
|
||
* An application publishes a job to the queue, then notifies the user of job status
|
||
* A worker picks up the job from the queue, processes it, then signals the job is complete
|
||
|
||
The user is not blocked and the job is processed in the background. During this time, the client might optionally do a small amount of processing to make it seem like the task has completed. For example, if posting a tweet, the tweet could be instantly posted to your timeline, but it could take some time before your tweet is actually delivered to all of your followers.
|
||
|
||
**[Redis](https://redis.io/)** is useful as a simple message broker but messages can be lost.
|
||
|
||
**[RabbitMQ](https://www.rabbitmq.com/)** is popular but requires you to adapt to the 'AMQP' protocol and manage your own nodes.
|
||
|
||
**[Amazon SQS](https://aws.amazon.com/sqs/)** is hosted but can have high latency and has the possibility of messages being delivered twice.
|
||
|
||
### Task queues
|
||
|
||
Tasks queues receive tasks and their related data, runs them, then delivers their results. They can support scheduling and can be used to run computationally-intensive jobs in the background.
|
||
|
||
**[Celery](https://docs.celeryproject.org/en/stable/)** has support for scheduling and primarily has python support.
|
||
|
||
### Back pressure
|
||
|
||
If queues start to grow significantly, the queue size can become larger than memory, resulting in cache misses, disk reads, and even slower performance. [Back pressure](http://mechanical-sympathy.blogspot.com/2012/05/apply-back-pressure-when-overloaded.html) can help by limiting the queue size, thereby maintaining a high throughput rate and good response times for jobs already in the queue. Once the queue fills up, clients get a server busy or HTTP 503 status code to try again later. Clients can retry the request at a later time, perhaps with [exponential backoff](https://en.wikipedia.org/wiki/Exponential_backoff).
|
||
|
||
### Disadvantage(s): asynchronism
|
||
|
||
* Use cases such as inexpensive calculations and realtime workflows might be better suited for synchronous operations, as introducing queues can add delays and complexity.
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [It's all a numbers game](https://www.youtube.com/watch?v=1KRYH75wgy4)
|
||
* [Applying back pressure when overloaded](http://mechanical-sympathy.blogspot.com/2012/05/apply-back-pressure-when-overloaded.html)
|
||
* [Little's law](https://en.wikipedia.org/wiki/Little%27s_law)
|
||
* [What is the difference between a message queue and a task queue?](https://www.quora.com/What-is-the-difference-between-a-message-queue-and-a-task-queue-Why-would-a-task-queue-require-a-message-broker-like-RabbitMQ-Redis-Celery-or-IronMQ-to-function)
|
||
|
||
## Communication
|
||
|
||
<p align="center">
|
||
<img src="images/5KeocQs.jpg">
|
||
<br/>
|
||
<i><a href=http://www.escotal.com/osilayer.html>Source: OSI 7 layer model</a></i>
|
||
</p>
|
||
|
||
### Hypertext transfer protocol (HTTP)
|
||
|
||
HTTP is a method for encoding and transporting data between a client and a server. It is a request/response protocol: clients issue requests and servers issue responses with relevant content and completion status info about the request. HTTP is self-contained, allowing requests and responses to flow through many intermediate routers and servers that perform load balancing, caching, encryption, and compression.
|
||
|
||
A basic HTTP request consists of a verb (method) and a resource (endpoint). Below are common HTTP verbs:
|
||
|
||
| Verb | Description | Idempotent* | Safe | Cacheable |
|
||
|---|---|---|---|---|
|
||
| GET | Reads a resource | Yes | Yes | Yes |
|
||
| POST | Creates a resource or trigger a process that handles data | No | No | Yes if response contains freshness info |
|
||
| PUT | Creates or replace a resource | Yes | No | No |
|
||
| PATCH | Partially updates a resource | No | No | Yes if response contains freshness info |
|
||
| DELETE | Deletes a resource | Yes | No | No |
|
||
|
||
*Can be called many times without different outcomes.
|
||
|
||
HTTP is an application layer protocol relying on lower-level protocols such as **TCP** and **UDP**.
|
||
|
||
#### Source(s) and further reading: HTTP
|
||
|
||
* [What is HTTP?](https://www.nginx.com/resources/glossary/http/)
|
||
* [Difference between HTTP and TCP](https://www.quora.com/What-is-the-difference-between-HTTP-protocol-and-TCP-protocol)
|
||
* [Difference between PUT and PATCH](https://laracasts.com/discuss/channels/general-discussion/whats-the-differences-between-put-and-patch?page=1)
|
||
|
||
### Transmission control protocol (TCP)
|
||
|
||
<p align="center">
|
||
<img src="images/JdAsdvG.jpg">
|
||
<br/>
|
||
<i><a href=http://www.wildbunny.co.uk/blog/2012/10/09/how-to-make-a-multi-player-game-part-1/>Source: How to make a multiplayer game</a></i>
|
||
</p>
|
||
|
||
TCP is a connection-oriented protocol over an [IP network](https://en.wikipedia.org/wiki/Internet_Protocol). Connection is established and terminated using a [handshake](https://en.wikipedia.org/wiki/Handshaking). All packets sent are guaranteed to reach the destination in the original order and without corruption through:
|
||
|
||
* Sequence numbers and [checksum fields](https://en.wikipedia.org/wiki/Transmission_Control_Protocol#Checksum_computation) for each packet
|
||
* [Acknowledgement](https://en.wikipedia.org/wiki/Acknowledgement_(data_networks)) packets and automatic retransmission
|
||
|
||
If the sender does not receive a correct response, it will resend the packets. If there are multiple timeouts, the connection is dropped. TCP also implements [flow control](https://en.wikipedia.org/wiki/Flow_control_(data)) and [congestion control](https://en.wikipedia.org/wiki/Network_congestion#Congestion_control). These guarantees cause delays and generally result in less efficient transmission than UDP.
|
||
|
||
To ensure high throughput, web servers can keep a large number of TCP connections open, resulting in high memory usage. It can be expensive to have a large number of open connections between web server threads and say, a [memcached](https://memcached.org/) server. [Connection pooling](https://en.wikipedia.org/wiki/Connection_pool) can help in addition to switching to UDP where applicable.
|
||
|
||
TCP is useful for applications that require high reliability but are less time critical. Some examples include web servers, database info, SMTP, FTP, and SSH.
|
||
|
||
Use TCP over UDP when:
|
||
|
||
* You need all of the data to arrive intact
|
||
* You want to automatically make a best estimate use of the network throughput
|
||
|
||
### User datagram protocol (UDP)
|
||
|
||
<p align="center">
|
||
<img src="images/yzDrJtA.jpg">
|
||
<br/>
|
||
<i><a href=http://www.wildbunny.co.uk/blog/2012/10/09/how-to-make-a-multi-player-game-part-1/>Source: How to make a multiplayer game</a></i>
|
||
</p>
|
||
|
||
UDP is connectionless. Datagrams (analogous to packets) are guaranteed only at the datagram level. Datagrams might reach their destination out of order or not at all. UDP does not support congestion control. Without the guarantees that TCP support, UDP is generally more efficient.
|
||
|
||
UDP can broadcast, sending datagrams to all devices on the subnet. This is useful with [DHCP](https://en.wikipedia.org/wiki/Dynamic_Host_Configuration_Protocol) because the client has not yet received an IP address, thus preventing a way for TCP to stream without the IP address.
|
||
|
||
UDP is less reliable but works well in real time use cases such as VoIP, video chat, streaming, and realtime multiplayer games.
|
||
|
||
Use UDP over TCP when:
|
||
|
||
* You need the lowest latency
|
||
* Late data is worse than loss of data
|
||
* You want to implement your own error correction
|
||
|
||
#### Source(s) and further reading: TCP and UDP
|
||
|
||
* [Networking for game programming](http://gafferongames.com/networking-for-game-programmers/udp-vs-tcp/)
|
||
* [Key differences between TCP and UDP protocols](http://www.cyberciti.biz/faq/key-differences-between-tcp-and-udp-protocols/)
|
||
* [Difference between TCP and UDP](http://stackoverflow.com/questions/5970383/difference-between-tcp-and-udp)
|
||
* [Transmission control protocol](https://en.wikipedia.org/wiki/Transmission_Control_Protocol)
|
||
* [User datagram protocol](https://en.wikipedia.org/wiki/User_Datagram_Protocol)
|
||
* [Scaling memcache at Facebook](http://www.cs.bu.edu/~jappavoo/jappavoo.github.com/451/papers/memcache-fb.pdf)
|
||
|
||
### Remote procedure call (RPC)
|
||
|
||
<p align="center">
|
||
<img src="images/iF4Mkb5.png">
|
||
<br/>
|
||
<i><a href=http://www.puncsky.com/blog/2016-02-13-crack-the-system-design-interview>Source: Crack the system design interview</a></i>
|
||
</p>
|
||
|
||
In an RPC, a client causes a procedure to execute on a different address space, usually a remote server. The procedure is coded as if it were a local procedure call, abstracting away the details of how to communicate with the server from the client program. Remote calls are usually slower and less reliable than local calls so it is helpful to distinguish RPC calls from local calls. Popular RPC frameworks include [Protobuf](https://developers.google.com/protocol-buffers/), [Thrift](https://thrift.apache.org/), and [Avro](https://avro.apache.org/docs/current/).
|
||
|
||
RPC is a request-response protocol:
|
||
|
||
* **Client program** - Calls the client stub procedure. The parameters are pushed onto the stack like a local procedure call.
|
||
* **Client stub procedure** - Marshals (packs) procedure id and arguments into a request message.
|
||
* **Client communication module** - OS sends the message from the client to the server.
|
||
* **Server communication module** - OS passes the incoming packets to the server stub procedure.
|
||
* **Server stub procedure** - Unmarshalls the results, calls the server procedure matching the procedure id and passes the given arguments.
|
||
* The server response repeats the steps above in reverse order.
|
||
|
||
Sample RPC calls:
|
||
|
||
```
|
||
GET /someoperation?data=anId
|
||
|
||
POST /anotheroperation
|
||
{
|
||
"data":"anId";
|
||
"anotherdata": "another value"
|
||
}
|
||
```
|
||
|
||
RPC is focused on exposing behaviors. RPCs are often used for performance reasons with internal communications, as you can hand-craft native calls to better fit your use cases.
|
||
|
||
Choose a native library (aka SDK) when:
|
||
|
||
* You know your target platform.
|
||
* You want to control how your "logic" is accessed.
|
||
* You want to control how error control happens off your library.
|
||
* Performance and end user experience is your primary concern.
|
||
|
||
HTTP APIs following **REST** tend to be used more often for public APIs.
|
||
|
||
#### Disadvantage(s): RPC
|
||
|
||
* RPC clients become tightly coupled to the service implementation.
|
||
* A new API must be defined for every new operation or use case.
|
||
* It can be difficult to debug RPC.
|
||
* You might not be able to leverage existing technologies out of the box. For example, it might require additional effort to ensure [RPC calls are properly cached](http://etherealbits.com/2012/12/debunking-the-myths-of-rpc-rest/) on caching servers such as [Squid](http://www.squid-cache.org/).
|
||
|
||
### Representational state transfer (REST)
|
||
|
||
REST is an architectural style enforcing a client/server model where the client acts on a set of resources managed by the server. The server provides a representation of resources and actions that can either manipulate or get a new representation of resources. All communication must be stateless and cacheable.
|
||
|
||
There are four qualities of a RESTful interface:
|
||
|
||
* **Identify resources (URI in HTTP)** - use the same URI regardless of any operation.
|
||
* **Change with representations (Verbs in HTTP)** - use verbs, headers, and body.
|
||
* **Self-descriptive error message (status response in HTTP)** - Use status codes, don't reinvent the wheel.
|
||
* **[HATEOAS](http://restcookbook.com/Basics/hateoas/) (HTML interface for HTTP)** - your web service should be fully accessible in a browser.
|
||
|
||
Sample REST calls:
|
||
|
||
```
|
||
GET /someresources/anId
|
||
|
||
PUT /someresources/anId
|
||
{"anotherdata": "another value"}
|
||
```
|
||
|
||
REST is focused on exposing data. It minimizes the coupling between client/server and is often used for public HTTP APIs. REST uses a more generic and uniform method of exposing resources through URIs, [representation through headers](https://github.com/for-GET/know-your-http-well/blob/master/headers.md), and actions through verbs such as GET, POST, PUT, DELETE, and PATCH. Being stateless, REST is great for horizontal scaling and partitioning.
|
||
|
||
#### Disadvantage(s): REST
|
||
|
||
* With REST being focused on exposing data, it might not be a good fit if resources are not naturally organized or accessed in a simple hierarchy. For example, returning all updated records from the past hour matching a particular set of events is not easily expressed as a path. With REST, it is likely to be implemented with a combination of URI path, query parameters, and possibly the request body.
|
||
* REST typically relies on a few verbs (GET, POST, PUT, DELETE, and PATCH) which sometimes doesn't fit your use case. For example, moving expired documents to the archive folder might not cleanly fit within these verbs.
|
||
* Fetching complicated resources with nested hierarchies requires multiple round trips between the client and server to render single views, e.g. fetching content of a blog entry and the comments on that entry. For mobile applications operating in variable network conditions, these multiple roundtrips are highly undesirable.
|
||
* Over time, more fields might be added to an API response and older clients will receive all new data fields, even those that they do not need, as a result, it bloats the payload size and leads to larger latencies.
|
||
|
||
### RPC and REST calls comparison
|
||
|
||
| Operation | RPC | REST |
|
||
|---|---|---|
|
||
| Signup | **POST** /signup | **POST** /persons |
|
||
| Resign | **POST** /resign<br/>{<br/>"personid": "1234"<br/>} | **DELETE** /persons/1234 |
|
||
| Read a person | **GET** /readPerson?personid=1234 | **GET** /persons/1234 |
|
||
| Read a person’s items list | **GET** /readUsersItemsList?personid=1234 | **GET** /persons/1234/items |
|
||
| Add an item to a person’s items | **POST** /addItemToUsersItemsList<br/>{<br/>"personid": "1234";<br/>"itemid": "456"<br/>} | **POST** /persons/1234/items<br/>{<br/>"itemid": "456"<br/>} |
|
||
| Update an item | **POST** /modifyItem<br/>{<br/>"itemid": "456";<br/>"key": "value"<br/>} | **PUT** /items/456<br/>{<br/>"key": "value"<br/>} |
|
||
| Delete an item | **POST** /removeItem<br/>{<br/>"itemid": "456"<br/>} | **DELETE** /items/456 |
|
||
|
||
<p align="center">
|
||
<i><a href=https://apihandyman.io/do-you-really-know-why-you-prefer-rest-over-rpc/>Source: Do you really know why you prefer REST over RPC</a></i>
|
||
</p>
|
||
|
||
#### Source(s) and further reading: REST and RPC
|
||
|
||
* [Do you really know why you prefer REST over RPC](https://apihandyman.io/do-you-really-know-why-you-prefer-rest-over-rpc/)
|
||
* [When are RPC-ish approaches more appropriate than REST?](http://programmers.stackexchange.com/a/181186)
|
||
* [REST vs JSON-RPC](http://stackoverflow.com/questions/15056878/rest-vs-json-rpc)
|
||
* [Debunking the myths of RPC and REST](http://etherealbits.com/2012/12/debunking-the-myths-of-rpc-rest/)
|
||
* [What are the drawbacks of using REST](https://www.quora.com/What-are-the-drawbacks-of-using-RESTful-APIs)
|
||
* [Crack the system design interview](http://www.puncsky.com/blog/2016-02-13-crack-the-system-design-interview)
|
||
* [Thrift](https://code.facebook.com/posts/1468950976659943/)
|
||
* [Why REST for internal use and not RPC](http://arstechnica.com/civis/viewtopic.php?t=1190508)
|
||
|
||
## Security
|
||
|
||
This section could use some updates. Consider [contributing](#contributing)!
|
||
|
||
Security is a broad topic. Unless you have considerable experience, a security background, or are applying for a position that requires knowledge of security, you probably won't need to know more than the basics:
|
||
|
||
* Encrypt in transit and at rest.
|
||
* Sanitize all user inputs or any input parameters exposed to user to prevent [XSS](https://en.wikipedia.org/wiki/Cross-site_scripting) and [SQL injection](https://en.wikipedia.org/wiki/SQL_injection).
|
||
* Use parameterized queries to prevent SQL injection.
|
||
* Use the principle of [least privilege](https://en.wikipedia.org/wiki/Principle_of_least_privilege).
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [API security checklist](https://github.com/shieldfy/API-Security-Checklist)
|
||
* [Security guide for developers](https://github.com/FallibleInc/security-guide-for-developers)
|
||
* [OWASP top ten](https://www.owasp.org/index.php/OWASP_Top_Ten_Cheat_Sheet)
|
||
|
||
## Appendix
|
||
|
||
You'll sometimes be asked to do 'back-of-the-envelope' estimates. For example, you might need to determine how long it will take to generate 100 image thumbnails from disk or how much memory a data structure will take. The **Powers of two table** and **Latency numbers every programmer should know** are handy references.
|
||
|
||
### Powers of two table
|
||
|
||
```
|
||
Power Exact Value Approx Value Bytes
|
||
---------------------------------------------------------------
|
||
7 128
|
||
8 256
|
||
10 1024 1 thousand 1 KB
|
||
16 65,536 64 KB
|
||
20 1,048,576 1 million 1 MB
|
||
30 1,073,741,824 1 billion 1 GB
|
||
32 4,294,967,296 4 GB
|
||
40 1,099,511,627,776 1 trillion 1 TB
|
||
```
|
||
|
||
#### Source(s) and further reading
|
||
|
||
* [Powers of two](https://en.wikipedia.org/wiki/Power_of_two)
|
||
|
||
### Latency numbers every programmer should know
|
||
|
||
```
|
||
Latency Comparison Numbers
|
||
--------------------------
|
||
L1 cache reference 0.5 ns
|
||
Branch mispredict 5 ns
|
||
L2 cache reference 7 ns 14x L1 cache
|
||
Mutex lock/unlock 25 ns
|
||
Main memory reference 100 ns 20x L2 cache, 200x L1 cache
|
||
Compress 1K bytes with Zippy 10,000 ns 10 us
|
||
Send 1 KB bytes over 1 Gbps network 10,000 ns 10 us
|
||
Read 4 KB randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD
|
||
Read 1 MB sequentially from memory 250,000 ns 250 us
|
||
Round trip within same datacenter 500,000 ns 500 us
|
||
Read 1 MB sequentially from SSD* 1,000,000 ns 1,000 us 1 ms ~1GB/sec SSD, 4X memory
|
||
HDD seek 10,000,000 ns 10,000 us 10 ms 20x datacenter roundtrip
|
||
Read 1 MB sequentially from 1 Gbps 10,000,000 ns 10,000 us 10 ms 40x memory, 10X SSD
|
||
Read 1 MB sequentially from HDD 30,000,000 ns 30,000 us 30 ms 120x memory, 30X SSD
|
||
Send packet CA->Netherlands->CA 150,000,000 ns 150,000 us 150 ms
|
||
|
||
Notes
|
||
-----
|
||
1 ns = 10^-9 seconds
|
||
1 us = 10^-6 seconds = 1,000 ns
|
||
1 ms = 10^-3 seconds = 1,000 us = 1,000,000 ns
|
||
```
|
||
|
||
Handy metrics based on numbers above:
|
||
|
||
* Read sequentially from HDD at 30 MB/s
|
||
* Read sequentially from 1 Gbps Ethernet at 100 MB/s
|
||
* Read sequentially from SSD at 1 GB/s
|
||
* Read sequentially from main memory at 4 GB/s
|
||
* 6-7 world-wide round trips per second
|
||
* 2,000 round trips per second within a data center
|
||
|
||
#### Latency numbers visualized
|
||
|
||
|
||
|
||
#### Source(s) and further reading
|
||
|
||
* [Latency numbers every programmer should know - 1](https://gist.github.com/jboner/2841832)
|
||
* [Latency numbers every programmer should know - 2](https://gist.github.com/hellerbarde/2843375)
|
||
* [Designs, lessons, and advice from building large distributed systems](http://www.cs.cornell.edu/projects/ladis2009/talks/dean-keynote-ladis2009.pdf)
|
||
* [Software Engineering Advice from Building Large-Scale Distributed Systems](https://static.googleusercontent.com/media/research.google.com/en//people/jeff/stanford-295-talk.pdf)
|
||
|
||
### Additional system design interview questions
|
||
|
||
> Common system design interview questions, with links to resources on how to solve each.
|
||
|
||
| Question | Reference(s) |
|
||
|---|---|
|
||
| Design a file sync service like Dropbox | [youtube.com](https://www.youtube.com/watch?v=PE4gwstWhmc) |
|
||
| Design a search engine like Google | [queue.acm.org](http://queue.acm.org/detail.cfm?id=988407)<br/>[stackexchange.com](http://programmers.stackexchange.com/questions/38324/interview-question-how-would-you-implement-google-search)<br/>[ardendertat.com](http://www.ardendertat.com/2012/01/11/implementing-search-engines/)<br/>[stanford.edu](http://infolab.stanford.edu/~backrub/google.html) |
|
||
| Design a scalable web crawler like Google | [quora.com](https://www.quora.com/How-can-I-build-a-web-crawler-from-scratch) |
|
||
| Design Google docs | [code.google.com](https://code.google.com/p/google-mobwrite/)<br/>[neil.fraser.name](https://neil.fraser.name/writing/sync/) |
|
||
| Design a key-value store like Redis | [slideshare.net](http://www.slideshare.net/dvirsky/introduction-to-redis) |
|
||
| Design a cache system like Memcached | [slideshare.net](http://www.slideshare.net/oemebamo/introduction-to-memcached) |
|
||
| Design a recommendation system like Amazon's | [hulu.com](https://web.archive.org/web/20170406065247/http://tech.hulu.com/blog/2011/09/19/recommendation-system.html)<br/>[ijcai13.org](http://ijcai13.org/files/tutorial_slides/td3.pdf) |
|
||
| Design a tinyurl system like Bitly | [n00tc0d3r.blogspot.com](http://n00tc0d3r.blogspot.com/) |
|
||
| Design a chat app like WhatsApp | [highscalability.com](http://highscalability.com/blog/2014/2/26/the-whatsapp-architecture-facebook-bought-for-19-billion.html)
|
||
| Design a picture sharing system like Instagram | [highscalability.com](http://highscalability.com/flickr-architecture)<br/>[highscalability.com](http://highscalability.com/blog/2011/12/6/instagram-architecture-14-million-users-terabytes-of-photos.html) |
|
||
| Design the Facebook news feed function | [quora.com](http://www.quora.com/What-are-best-practices-for-building-something-like-a-News-Feed)<br/>[quora.com](http://www.quora.com/Activity-Streams/What-are-the-scaling-issues-to-keep-in-mind-while-developing-a-social-network-feed)<br/>[slideshare.net](http://www.slideshare.net/danmckinley/etsy-activity-feeds-architecture) |
|
||
| Design the Facebook timeline function | [facebook.com](https://www.facebook.com/note.php?note_id=10150468255628920)<br/>[highscalability.com](http://highscalability.com/blog/2012/1/23/facebook-timeline-brought-to-you-by-the-power-of-denormaliza.html) |
|
||
| Design the Facebook chat function | [erlang-factory.com](http://www.erlang-factory.com/upload/presentations/31/EugeneLetuchy-ErlangatFacebook.pdf)<br/>[facebook.com](https://www.facebook.com/note.php?note_id=14218138919&id=9445547199&index=0) |
|
||
| Design a graph search function like Facebook's | [facebook.com](https://www.facebook.com/notes/facebook-engineering/under-the-hood-building-out-the-infrastructure-for-graph-search/10151347573598920)<br/>[facebook.com](https://www.facebook.com/notes/facebook-engineering/under-the-hood-indexing-and-ranking-in-graph-search/10151361720763920)<br/>[facebook.com](https://www.facebook.com/notes/facebook-engineering/under-the-hood-the-natural-language-interface-of-graph-search/10151432733048920) |
|
||
| Design a content delivery network like CloudFlare | [figshare.com](https://figshare.com/articles/Globally_distributed_content_delivery/6605972) |
|
||
| Design a trending topic system like Twitter's | [michael-noll.com](http://www.michael-noll.com/blog/2013/01/18/implementing-real-time-trending-topics-in-storm/)<br/>[snikolov .wordpress.com](http://snikolov.wordpress.com/2012/11/14/early-detection-of-twitter-trends/) |
|
||
| Design a random ID generation system | [blog.twitter.com](https://blog.twitter.com/2010/announcing-snowflake)<br/>[github.com](https://github.com/twitter/snowflake/) |
|
||
| Return the top k requests during a time interval | [cs.ucsb.edu](https://www.cs.ucsb.edu/sites/cs.ucsb.edu/files/docs/reports/2005-23.pdf)<br/>[wpi.edu](http://davis.wpi.edu/xmdv/docs/EDBT11-diyang.pdf) |
|
||
| Design a system that serves data from multiple data centers | [highscalability.com](http://highscalability.com/blog/2009/8/24/how-google-serves-data-from-multiple-datacenters.html) |
|
||
| Design an online multiplayer card game | [indieflashblog.com](https://web.archive.org/web/20180929181117/http://www.indieflashblog.com/how-to-create-an-asynchronous-multiplayer-game.html)<br/>[buildnewgames.com](http://buildnewgames.com/real-time-multiplayer/) |
|
||
| Design a garbage collection system | [stuffwithstuff.com](http://journal.stuffwithstuff.com/2013/12/08/babys-first-garbage-collector/)<br/>[washington.edu](http://courses.cs.washington.edu/courses/csep521/07wi/prj/rick.pdf) |
|
||
| Design an API rate limiter | [https://stripe.com/blog/](https://stripe.com/blog/rate-limiters) |
|
||
| Design a Stock Exchange (like NASDAQ or Binance) | [Jane Street](https://youtu.be/b1e4t2k2KJY)<br/>[Golang Implementation](https://around25.com/blog/building-a-trading-engine-for-a-crypto-exchange/)<br/>[Go Implemenation](http://bhomnick.net/building-a-simple-limit-order-in-go/) |
|
||
| Add a system design question | [المساهمة](#contributing) |
|
||
|
||
### Real world architectures
|
||
|
||
> Articles on how real world systems are designed.
|
||
|
||
<p align="center">
|
||
<img src="images/TcUo2fw.png">
|
||
<br/>
|
||
<i><a href=https://www.infoq.com/presentations/Twitter-Timeline-Scalability>Source: Twitter timelines at scale</a></i>
|
||
</p>
|
||
|
||
**Don't focus on nitty gritty details for the following articles, instead:**
|
||
|
||
* Identify shared principles, common technologies, and patterns within these articles
|
||
* Study what problems are solved by each component, where it works, where it doesn't
|
||
* Review the lessons learned
|
||
|
||
|Type | System | Reference(s) |
|
||
|---|---|---|
|
||
| Data processing | **MapReduce** - Distributed data processing from Google | [research.google.com](http://static.googleusercontent.com/media/research.google.com/zh-CN/us/archive/mapreduce-osdi04.pdf) |
|
||
| Data processing | **Spark** - Distributed data processing from Databricks | [slideshare.net](http://www.slideshare.net/AGrishchenko/apache-spark-architecture) |
|
||
| Data processing | **Storm** - Distributed data processing from Twitter | [slideshare.net](http://www.slideshare.net/previa/storm-16094009) |
|
||
| | | |
|
||
| Data store | **Bigtable** - Distributed column-oriented database from Google | [harvard.edu](http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/chang06bigtable.pdf) |
|
||
| Data store | **HBase** - Open source implementation of Bigtable | [slideshare.net](http://www.slideshare.net/alexbaranau/intro-to-hbase) |
|
||
| Data store | **Cassandra** - Distributed column-oriented database from Facebook | [slideshare.net](http://www.slideshare.net/planetcassandra/cassandra-introduction-features-30103666)
|
||
| Data store | **DynamoDB** - Document-oriented database from Amazon | [harvard.edu](http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/decandia07dynamo.pdf) |
|
||
| Data store | **MongoDB** - Document-oriented database | [slideshare.net](http://www.slideshare.net/mdirolf/introduction-to-mongodb) |
|
||
| Data store | **Spanner** - Globally-distributed database from Google | [research.google.com](http://research.google.com/archive/spanner-osdi2012.pdf) |
|
||
| Data store | **Memcached** - Distributed memory caching system | [slideshare.net](http://www.slideshare.net/oemebamo/introduction-to-memcached) |
|
||
| Data store | **Redis** - Distributed memory caching system with persistence and value types | [slideshare.net](http://www.slideshare.net/dvirsky/introduction-to-redis) |
|
||
| | | |
|
||
| File system | **Google File System (GFS)** - Distributed file system | [research.google.com](http://static.googleusercontent.com/media/research.google.com/zh-CN/us/archive/gfs-sosp2003.pdf) |
|
||
| File system | **Hadoop File System (HDFS)** - Open source implementation of GFS | [apache.org](http://hadoop.apache.org/docs/stable/hadoop-project-dist/hadoop-hdfs/HdfsDesign.html) |
|
||
| | | |
|
||
| Misc | **Chubby** - Lock service for loosely-coupled distributed systems from Google | [research.google.com](http://static.googleusercontent.com/external_content/untrusted_dlcp/research.google.com/en/us/archive/chubby-osdi06.pdf) |
|
||
| Misc | **Dapper** - Distributed systems tracing infrastructure | [research.google.com](http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/36356.pdf)
|
||
| Misc | **Kafka** - Pub/sub message queue from LinkedIn | [slideshare.net](http://www.slideshare.net/mumrah/kafka-talk-tri-hug) |
|
||
| Misc | **Zookeeper** - Centralized infrastructure and services enabling synchronization | [slideshare.net](http://www.slideshare.net/sauravhaloi/introduction-to-apache-zookeeper) |
|
||
| | Add an architecture | [المساهمة](#contributing) |
|
||
|
||
### Company architectures
|
||
|
||
| Company | Reference(s) |
|
||
|---|---|
|
||
| Amazon | [Amazon architecture](http://highscalability.com/amazon-architecture) |
|
||
| Cinchcast | [Producing 1,500 hours of audio every day](http://highscalability.com/blog/2012/7/16/cinchcast-architecture-producing-1500-hours-of-audio-every-d.html) |
|
||
| DataSift | [Realtime datamining At 120,000 tweets per second](http://highscalability.com/blog/2011/11/29/datasift-architecture-realtime-datamining-at-120000-tweets-p.html) |
|
||
| Dropbox | [How we've scaled Dropbox](https://www.youtube.com/watch?v=PE4gwstWhmc) |
|
||
| ESPN | [Operating At 100,000 duh nuh nuhs per second](http://highscalability.com/blog/2013/11/4/espns-architecture-at-scale-operating-at-100000-duh-nuh-nuhs.html) |
|
||
| Google | [Google architecture](http://highscalability.com/google-architecture) |
|
||
| Instagram | [14 million users, terabytes of photos](http://highscalability.com/blog/2011/12/6/instagram-architecture-14-million-users-terabytes-of-photos.html)<br/>[What powers Instagram](http://instagram-engineering.tumblr.com/post/13649370142/what-powers-instagram-hundreds-of-instances) |
|
||
| Justin.tv | [Justin.Tv's live video broadcasting architecture](http://highscalability.com/blog/2010/3/16/justintvs-live-video-broadcasting-architecture.html) |
|
||
| Facebook | [Scaling memcached at Facebook](https://cs.uwaterloo.ca/~brecht/courses/854-Emerging-2014/readings/key-value/fb-memcached-nsdi-2013.pdf)<br/>[TAO: Facebook’s distributed data store for the social graph](https://cs.uwaterloo.ca/~brecht/courses/854-Emerging-2014/readings/data-store/tao-facebook-distributed-datastore-atc-2013.pdf)<br/>[Facebook’s photo storage](https://www.usenix.org/legacy/event/osdi10/tech/full_papers/Beaver.pdf)<br/>[How Facebook Live Streams To 800,000 Simultaneous Viewers](http://highscalability.com/blog/2016/6/27/how-facebook-live-streams-to-800000-simultaneous-viewers.html) |
|
||
| Flickr | [Flickr architecture](http://highscalability.com/flickr-architecture) |
|
||
| Mailbox | [From 0 to one million users in 6 weeks](http://highscalability.com/blog/2013/6/18/scaling-mailbox-from-0-to-one-million-users-in-6-weeks-and-1.html) |
|
||
| Netflix | [A 360 Degree View Of The Entire Netflix Stack](http://highscalability.com/blog/2015/11/9/a-360-degree-view-of-the-entire-netflix-stack.html)<br/>[Netflix: What Happens When You Press Play?](http://highscalability.com/blog/2017/12/11/netflix-what-happens-when-you-press-play.html) |
|
||
| Pinterest | [From 0 To 10s of billions of page views a month](http://highscalability.com/blog/2013/4/15/scaling-pinterest-from-0-to-10s-of-billions-of-page-views-a.html)<br/>[18 million visitors, 10x growth, 12 employees](http://highscalability.com/blog/2012/5/21/pinterest-architecture-update-18-million-visitors-10x-growth.html) |
|
||
| Playfish | [50 million monthly users and growing](http://highscalability.com/blog/2010/9/21/playfishs-social-gaming-architecture-50-million-monthly-user.html) |
|
||
| PlentyOfFish | [PlentyOfFish architecture](http://highscalability.com/plentyoffish-architecture) |
|
||
| Salesforce | [How they handle 1.3 billion transactions a day](http://highscalability.com/blog/2013/9/23/salesforce-architecture-how-they-handle-13-billion-transacti.html) |
|
||
| Stack Overflow | [Stack Overflow architecture](http://highscalability.com/blog/2009/8/5/stack-overflow-architecture.html) |
|
||
| TripAdvisor | [40M visitors, 200M dynamic page views, 30TB data](http://highscalability.com/blog/2011/6/27/tripadvisor-architecture-40m-visitors-200m-dynamic-page-view.html) |
|
||
| Tumblr | [15 billion page views a month](http://highscalability.com/blog/2012/2/13/tumblr-architecture-15-billion-page-views-a-month-and-harder.html) |
|
||
| Twitter | [Making Twitter 10000 percent faster](http://highscalability.com/scaling-twitter-making-twitter-10000-percent-faster)<br/>[Storing 250 million tweets a day using MySQL](http://highscalability.com/blog/2011/12/19/how-twitter-stores-250-million-tweets-a-day-using-mysql.html)<br/>[150M active users, 300K QPS, a 22 MB/S firehose](http://highscalability.com/blog/2013/7/8/the-architecture-twitter-uses-to-deal-with-150m-active-users.html)<br/>[Timelines at scale](https://www.infoq.com/presentations/Twitter-Timeline-Scalability)<br/>[Big and small data at Twitter](https://www.youtube.com/watch?v=5cKTP36HVgI)<br/>[Operations at Twitter: scaling beyond 100 million users](https://www.youtube.com/watch?v=z8LU0Cj6BOU)<br/>[How Twitter Handles 3,000 Images Per Second](http://highscalability.com/blog/2016/4/20/how-twitter-handles-3000-images-per-second.html) |
|
||
| Uber | [How Uber scales their real-time market platform](http://highscalability.com/blog/2015/9/14/how-uber-scales-their-real-time-market-platform.html)<br/>[Lessons Learned From Scaling Uber To 2000 Engineers, 1000 Services, And 8000 Git Repositories](http://highscalability.com/blog/2016/10/12/lessons-learned-from-scaling-uber-to-2000-engineers-1000-ser.html) |
|
||
| WhatsApp | [The WhatsApp architecture Facebook bought for $19 billion](http://highscalability.com/blog/2014/2/26/the-whatsapp-architecture-facebook-bought-for-19-billion.html) |
|
||
| YouTube | [YouTube scalability](https://www.youtube.com/watch?v=w5WVu624fY8)<br/>[YouTube architecture](http://highscalability.com/youtube-architecture) |
|
||
|
||
### Company engineering blogs
|
||
|
||
> Architectures for companies you are interviewing with.
|
||
>
|
||
> Questions you encounter might be from the same domain.
|
||
|
||
* [Airbnb Engineering](http://nerds.airbnb.com/)
|
||
* [Atlassian Developers](https://developer.atlassian.com/blog/)
|
||
* [AWS Blog](https://aws.amazon.com/blogs/aws/)
|
||
* [Bitly Engineering Blog](http://word.bitly.com/)
|
||
* [Box Blogs](https://blog.box.com/blog/category/engineering)
|
||
* [Cloudera Developer Blog](http://blog.cloudera.com/)
|
||
* [Dropbox Tech Blog](https://tech.dropbox.com/)
|
||
* [Engineering at Quora](https://www.quora.com/q/quoraengineering)
|
||
* [Ebay Tech Blog](http://www.ebaytechblog.com/)
|
||
* [Evernote Tech Blog](https://blog.evernote.com/tech/)
|
||
* [Etsy Code as Craft](http://codeascraft.com/)
|
||
* [Facebook Engineering](https://www.facebook.com/Engineering)
|
||
* [Flickr Code](http://code.flickr.net/)
|
||
* [Foursquare Engineering Blog](http://engineering.foursquare.com/)
|
||
* [GitHub Engineering Blog](https://github.blog/category/engineering)
|
||
* [Google Research Blog](http://googleresearch.blogspot.com/)
|
||
* [Groupon Engineering Blog](https://engineering.groupon.com/)
|
||
* [Heroku Engineering Blog](https://engineering.heroku.com/)
|
||
* [Hubspot Engineering Blog](http://product.hubspot.com/blog/topic/engineering)
|
||
* [High Scalability](http://highscalability.com/)
|
||
* [Instagram Engineering](http://instagram-engineering.tumblr.com/)
|
||
* [Intel Software Blog](https://software.intel.com/en-us/blogs/)
|
||
* [Jane Street Tech Blog](https://blogs.janestreet.com/category/ocaml/)
|
||
* [LinkedIn Engineering](http://engineering.linkedin.com/blog)
|
||
* [Microsoft Engineering](https://engineering.microsoft.com/)
|
||
* [Microsoft Python Engineering](https://blogs.msdn.microsoft.com/pythonengineering/)
|
||
* [Netflix Tech Blog](http://techblog.netflix.com/)
|
||
* [Paypal Developer Blog](https://medium.com/paypal-engineering)
|
||
* [Pinterest Engineering Blog](https://medium.com/@Pinterest_Engineering)
|
||
* [Reddit Blog](http://www.redditblog.com/)
|
||
* [Salesforce Engineering Blog](https://developer.salesforce.com/blogs/engineering/)
|
||
* [Slack Engineering Blog](https://slack.engineering/)
|
||
* [Spotify Labs](https://labs.spotify.com/)
|
||
* [Twilio Engineering Blog](http://www.twilio.com/engineering)
|
||
* [Twitter Engineering](https://blog.twitter.com/engineering/)
|
||
* [Uber Engineering Blog](http://eng.uber.com/)
|
||
* [Yahoo Engineering Blog](http://yahooeng.tumblr.com/)
|
||
* [Yelp Engineering Blog](http://engineeringblog.yelp.com/)
|
||
* [Zynga Engineering Blog](https://www.zynga.com/blogs/engineering)
|
||
|
||
#### Source(s) and further reading
|
||
|
||
Looking to add a blog? To avoid duplicating work, consider adding your company blog to the following repo:
|
||
|
||
* [kilimchoi/engineering-blogs](https://github.com/kilimchoi/engineering-blogs)
|
||
|
||
## Under development
|
||
|
||
Interested in adding a section or helping complete one in-progress? [المساهمة](#contributing)!
|
||
|
||
* Distributed computing with MapReduce
|
||
* Consistent hashing
|
||
* Scatter gather
|
||
* [المساهمة](#contributing)
|
||
|
||
## Credits
|
||
|
||
Credits and sources are provided throughout this repo.
|
||
|
||
Special thanks to:
|
||
|
||
* [Hired in tech](http://www.hiredintech.com/system-design/the-system-design-process/)
|
||
* [Cracking the coding interview](https://www.amazon.com/dp/0984782850/)
|
||
* [High scalability](http://highscalability.com/)
|
||
* [checkcheckzz/system-design-interview](https://github.com/checkcheckzz/system-design-interview)
|
||
* [shashank88/system_design](https://github.com/shashank88/system_design)
|
||
* [mmcgrana/services-engineering](https://github.com/mmcgrana/services-engineering)
|
||
* [System design cheat sheet](https://gist.github.com/vasanthk/485d1c25737e8e72759f)
|
||
* [A distributed systems reading list](http://dancres.github.io/Pages/)
|
||
* [Cracking the system design interview](http://www.puncsky.com/blog/2016-02-13-crack-the-system-design-interview)
|
||
|
||
## Contact info
|
||
|
||
Feel free to contact me to discuss any issues, questions, or comments.
|
||
|
||
My contact info can be found on my [GitHub page](https://github.com/donnemartin).
|
||
|
||
## License
|
||
|
||
*I am providing code and resources in this repository to you under an open source license. Because this is my personal repository, the license you receive to my code and resources is from me and not my employer (Facebook).*
|
||
|
||
Copyright 2017 Donne Martin
|
||
|
||
Creative Commons Attribution 4.0 International License (CC BY 4.0)
|
||
|
||
http://creativecommons.org/licenses/by/4.0/
|