Pranay Kanwar r4um

Internet Scale Services Checklist

A checklist for designing and developing internet scale services, inspired by James Hamilton's 2007 paper "On Desgining and Deploying Internet-Scale Services."

http://mvdirona.com/jrh/talksandpapers/jamesrh_lisa.pdf

Basic tenets

Does the design expect failures to happen regularly and handle them gracefully?
Have we kept things as simple as possible?

Channels Are Not Enough

... or Why Pipelining Is Not That Easy

Golang Concurrency Patterns for brave and smart.

By @kachayev

Intro

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

The Learning Haskell guide has been moved to a git repo to enable outside contribution

Find it here: https://github.com/bitemyapp/learnhaskell

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=rep1&t

	# /tmp/test = EBS-SSD
	# /mnt/test = instance-store

	root@ip-10-0-2-6:~# dd bs=1M count=256 if=/dev/zero of=/tmp/test
	256+0 records in
	256+0 records out
	268435456 bytes (268 MB) copied, 3.26957 s, 82.1 MB/s
	root@ip-10-0-2-6:~# dd bs=1M count=256 if=/dev/zero of=/tmp/test
	256+0 records in
	256+0 records out


	// Create a new MergeStrategy for aop.xml files
	val aopMerge: MergeStrategy = new MergeStrategy {
	val name = "aopMerge"
	import scala.xml._
	import scala.xml.dtd._

	def apply(tempDir: File, path: String, files: Seq[File]): Either[String, Seq[(File, String)]] = {
	val dt = DocType("aspectj", PublicID("-//AspectJ//DTD//EN", "http://www.eclipse.org/aspectj/dtd/aspectj.dtd"), Nil)
	val file = MergeStrategy.createMergeTarget(tempDir, path)

	#!/bin/bash

	if [ -e /opt/chefdk ]; then
	rm -rf /opt/chefdk
	else
	echo "can not found chefdk"
	fi

	rm /usr/bin/berks
	rm /usr/bin/chef

	#!/usr/bin/env python
	# vim: tabstop=4 expandtab shiftwidth=4 softtabstop=4 textwidth=79 autoindent

	"""
	Python source code
	Last modified: 15 Feb 2014 - 13:38
	Last author: lmwangi at gmail com

	Displays the available memory fragments
	by querying /proc/buddyinfo

	server {
	listen 80;
	server_name nessus.gmi.oeaw.ac.at;
	rewrite ^ https://$server_name$request_uri? permanent;
	}

	server {
	listen 443;
	server_name nessus.gmi.oeaw.ac.at;
	client_max_body_size 100m;