rutvij93 Goto Github PK

clientserverapplication

Built an HTTP client-server application which includes HTTP request authentication and file transfer functionality between client and server.

concurrentlinkedlists

Implementations include: LazyList, Optimistic List, LockFree List, Coarse List, and Fine Grain List

cs50_problemsets_2015

flink-training

Apache Flink Training Excercises

lockfree_bidirectionalskiplist

In computer science, a skip list is a data structure that allows fast search within an ordered sequence of elements.

lockfreeredblacktree

This is a efficient lock-free algorithm for red-black tree that reduces the size of local area suggested by Kim and thus increases concurrency.

lockfreestack_withmanualmemorymanagement

This is a implementation of a lock-free stack that supports two operations: push and pop. The implementation reuses nodes/data (re-push-ing after pop-ing).

petersontreelcok

A Peterson Tree is a mechanism for achieving mutual exclusion for n-threads (where n is a power of two).

semilinearizablequeue

Highly concurrent servers mainly rely on thread pool which consist of (1) set of threads ready to serve tasks (2) task queue. More than often these thread pools do not need a strict FIFO queue, what is required is a queue with relaxed consistency.

spinlocks

Implements CLS, MCS, priorityCLH, Tas, TTAS and ALock

thesharemarketgame

Create your own virtual stock portfolio and experience what it is like to invest in the stock market.