Awesome-Mirrors/awesome-scalability
1
0
Fork 0
mirror of https://github.com/binhnguyennus/awesome-scalability.git synced 2024-10-01 01:06:14 -04:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #22 from tsvetilian-ty/master

Browse Source 
refactor 404 links to "The Paper Trail"
This commit is contained in:
Binh Nguyen 2018-10-30 09:18:08 +08:00 committed by GitHub
commit 9d66dd8b82
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@ -65,7 +65,7 @@ An updated and curated list of readings to illustrate best practices and pattern
* [Uniform Consistent Hashing at Netflix](https://medium.com/netflix-techblog/distributing-content-to-open-connect-3e3e391d4dc9)
* [Eventually Consistent - Werner Vogels, CTO at Amazon](https://www.allthingsdistributed.com/2008/12/eventually_consistent.html)
* [Cache is King](https://www.stevesouders.com/blog/2012/10/11/cache-is-king/)
* [Anti-Caching](http://the-paper-trail.org/blog/paper-notes-anti-caching/)
* [Anti-Caching](https://www.the-paper-trail.org/post/2014-06-06-paper-notes-anti-caching/)
* [Understand Latency](http://highscalability.com/latency-everywhere-and-it-costs-you-sales-how-crush-it)
* [Latency Numbers Every Programmer Should Know](http://norvig.com/21-days.html#answers)
* [The Calculus of Service Availability](https://queue.acm.org/detail.cfm?id=3096459&__s=dnkxuaws9pogqdnxmx8i)
@ -431,7 +431,7 @@ An updated and curated list of readings to illustrate best practices and pattern
* [Loop Parallelism Pattern: Extracting parallel tasks from loops](https://www.cs.umd.edu/class/fall2001/cmsc411/projects/unroll/main.htm)
* [Fork/Join Pattern: Good for recursive data processing](http://highscalability.com/learn-how-exploit-multiple-cores-better-performance-and-scalability)
* [Map-Reduce: Born for Simplified Data Processing on Large Clusters](http://static.googleusercontent.com/media/research.google.com/en/us/archive/mapreduce-osdi04.pdf)
* [On the Death of Map-Reduce - Henry Robinson, Cloudera](http://the-paper-trail.org/blog/the-elephant-was-a-trojan-horse-on-the-death-of-map-reduce-at-google/)
* [On the Death of Map-Reduce - Henry Robinson, Cloudera](https://www.the-paper-trail.org/post/2014-06-25-the-elephant-was-a-trojan-horse-on-the-death-of-map-reduce-at-google/)
* [Server-side Optimization to Parallelize the Rendering of Web Pages at Yelp](https://engineeringblog.yelp.com/2017/07/generating-web-pages-in-parallel-with-pagelets.html)
* [Accelerator: Data Processing Framework with Fast Data Access and Parallel Execution at eBay](https://www.ebayinc.com/stories/blogs/tech/announcing-the-accelerator-processing-1-000-000-000-lines-per-second-on-a-single-computer/)
* [Event-Driven Architecture](https://martinfowler.com/articles/201701-event-driven.html)
@ -770,4 +770,4 @@ An updated and curated list of readings to illustrate best practices and pattern
[![CC-BY](https://mirrors.creativecommons.org/presskit/buttons/88x31/svg/by.svg)](https://creativecommons.org/licenses/by/4.0/)
This project is created and maintained by Binh Nguyen, R&D Engineer at The Agency for Science, Technology and Research of Singapore (A*Star). I am fortunate to be a part of a small but elite Vietnamese team, working remotely on various software projects with international clients. If you want to join us (especially if you are a Vietnamese student who want to gain more experience while making good money), please message me directly on [my LinkedIn](https://www.linkedin.com/in/binhnguyennus/)! Thank You & Happy Coding! :heart:
This project is created and maintained by Binh Nguyen, R&D Engineer at The Agency for Science, Technology and Research of Singapore (A*Star). I am fortunate to be a part of a small but elite Vietnamese team, working remotely on various software projects with international clients. If you want to join us (especially if you are a Vietnamese student who want to gain more experience while making good money), please message me directly on [my LinkedIn](https://www.linkedin.com/in/binhnguyennus/)! Thank You & Happy Coding! :heart: