pranasblk/hazelcast
Open Source In-Memory Data Grid
Discovered public repositories for pranasblk in the GitHub catalog.
Open Source In-Memory Data Grid
Minimal Vagrantfile for CoreOS
coursera.com / Data Science / Developing Data Products / Project 2 / Part 2
coursera.com / Data Science / Developing Data Products / Project 2
The project of Getting and Clearing Data
Peer Assessment 1 for Reproducible Research
Plotting Assignment 1 for Exploratory Data Analysis
Repository for Programming Assignment 2 for R Programming on Coursera
The Leek group guide to data sharing
Part of https://class.coursera.org/datascitoolbox-016 assigment
Versioning for Web Resources
Low latency, lock free, primitive bounded blocking queues backed by an primitive arrays such as an int[]. These classes mimic the interface of BlockingQueue, they work with primitive rather than Objects so are unable to actually implement the BlockingQueue. They takes advantage of the Unsafe.putOrdered<X>, which allows the creation of non-blocking code with guaranteed writes. These writes will not be re-orderd by instruction reordering. Under the covers they use a faster store-store barrier, rather than the the slower store-load barrier, which is used when doing a volatile write. One of the trade off with this improved performance is we are limited to a single producer, single consumer.
Spring in Practice, Chapter 4
Example application showing auth and debit of pre-paid balances
Public repository.
Interview questions
QSTK Clone
Quant Software Tool Kit
Just for http://git-scm.com/book practice
A fast Gherkin parser in Ragel (The parser behind Cucumber)
Cucumber for the JVM