Sreekanth sreeix

Node.js for Raspberry Pi

Pre-built binaries

Recent releases have been pre-built using cross-compilers and this script and are downloadable below.

If you have found these packages useful, give me a shout out on twitter: @adammw

[Ciju] (https://gist.github.com/4664768)
Sreekanth
Dinesh
Anantha
Sreehari
Pavana
Rahul

I am sure you have heard about memcached. It is a classic key value store. Maintaining a O(1) execution time for most operations.

What We'd like you to implement is memcached in ruby(or the language of your choice)

I normally start memcached this memcached -m 1280 -vv (Actually I use -t 6, but ignore it for now)

Where -m is the amount of memory to allocate and -vv is the verbosity of the logs.

Context: I was asked for a list of interesting reading relating to "distributed databases, behavior under partitions and failures, failure detection." Here's what I came up with in about an hour.

For textbooks, "Introduction to Reliable and Secure Distributed Programming" is a superb introduction to distributed computing from a formal perspective; it's really not about "programming" or "engineering" but about distributed system fundamentals like consensus, distributed registers, and broadcast. Used in Berkeley's Distributed Computing course (and HT to @lalithsuresh) Book Site

Notes from courses like Lorenzo Alvisi's Distributed Computing class can be great.

There are a bunch of classics on causality, [Paxos](ht

Here's where I understand the state of the art to be:

In this INRIA tech report, Shapiro, Preguiça, Baquero and Zawirski (SPBZ) prove, amongst other things, that a sufficient condition for CRDTs to achieve eventual consistency on networks which may reorder and duplicate packets (which I'll call flaky networks, henceforth) is that
1. the underlying datatype forms a semilattice,
2. messages are full states,
3. incoming messages are combined with the node's current state using the least-upper-bound operation in the semilattice.
It's possible to relax condition 2 and still achieve eventual consistency over flaky networks by fragmenting the state into independent parts and transmitting updates to each part separately. For instance, in the G-Set CRDT (an add-only bitset) one can transmit only the index of the element to be added.
In [these slides from a talk at Dagstuhl](http://www.dagstuhl.de/mat/Files/13/13081/13081.BaqueroCarlos.Sl

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

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

	# Create design documents with the filters
	curl -vX PUT 'http://127.0.0.1:5984/couchdb_myapp_development/_design/Product' -d '{
	"_id": "_design/Product",
	"language": "javascript",
	"filters": {
	"product": "function(doc, req) { return doc['type'] == 'Product'; }"
	}
	}'

	curl -vX PUT 'http://127.0.0.1:5984/couchdb_myapp_development/_design/Person' -d '{

	#!/usr/bin/env sh

	##
	# This is script with usefull tips taken from:
	# https://github.com/mathiasbynens/dotfiles/blob/master/.osx
	#
	# install it:
	# curl -sL https://raw.github.com/gist/2108403/hack.sh \| sh
	#

	#!/bin/bash
	# ssh-multi
	# D.Kovalov
	# Based on http://linuxpixies.blogspot.jp/2011/06/tmux-copy-mode-and-how-to-control.html

	# a script to ssh multiple servers over multiple tmux panes


	starttmux() {
	if [ -z "$HOSTS" ]; then