Quick, dirty and slow HashSet based on https://www.youtube.com/watch?v=ncHmEUmJZf4
A checklist for designing and developing internet scale services, inspired by James Hamilton's 2007 paper "On Desgining and Deploying Internet-Scale Services."
- Does the design expect failures to happen regularly and handle them gracefully?
- Have we kept things as simple as possible?
- General Background and Overview
- Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
- Models and Issues in Data Stream Systems
- Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
- Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
- [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
### Keybase proof | |
I hereby claim: | |
* I am fcofdez on github. | |
* I am fcofdezc (https://keybase.io/fcofdezc) on keybase. | |
* I have a public key whose fingerprint is 9AEF 6F1F E047 3851 E9B4 DD5F 25C7 AB23 6C9F 230B | |
To claim this, I am signing this object: |
Data directories are created in /home/coreos
and mounted into the container using volume cli options of docker run. All data the container writes is stored on the host and as long as the host persists safe against container restarts / recreates.
- Pro
- No effort, just create the directories and mount them into the container
- Contra
- Container is bound to host (unable to failover)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Client: | |
Version: 1.8.1 | |
API version: 1.20 | |
Go version: go1.4.2 | |
Git commit: d12ea79 | |
Built: Thu Aug 13 02:33:17 UTC 2015 | |
OS/Arch: linux/amd64 | |
Server: | |
Version: 1.8.1 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
In [14]: dis(x) | |
2 0 BUILD_LIST 0 | |
3 LOAD_GLOBAL 0 (range) | |
6 LOAD_CONST 1 (10) | |
9 CALL_FUNCTION 1 | |
12 GET_ITER | |
>> 13 FOR_ITER 16 (to 32) | |
16 STORE_FAST 0 (x) | |
19 LOAD_FAST 0 (x) | |
22 LOAD_CONST 2 (1) |
Questions about Distributed systems by @tsantero.
- explain the life of an http request.
- what does the FLP result teach us?
- what is a byzantine failure?
- explain CRDTs
- explain linearizability.
- how does DNS work?
- crash-stop vs crash-recovery?
- difference between soft and hard real time
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdlib.h> | |
#include <stdio.h> | |
int main(){ | |
int *a; | |
a = (int *) malloc(sizeof(int) * 12); | |
for (int i = 0; i < 12 ; i++) | |
a[i] = i; | |
for (int i = 0; i < 12 ; i++) | |
printf("%i\n", a[i]); |
NewerOlder