brucewanght Goto Github PK

awesome-spider

爬虫集合

bullshitgenerator

Needs to generate some texts to test if my GUI rendering codes good or not. so I made this.

cache-simulation

cache replacement algorithm simulation

cloudharmony

fast_fair

cloned from https://github.com/DICL/FAST_FAIR.git

flashcache

Modified flashcache based on the open source flashcache of facebook.

gef

GEF - GDB Enhanced Features for exploit devs & reversers

hotspot

The Linux perf GUI for performance analysis.

kvm-docker-comparison

Experiments for the ISPASS 2015 poster "An Updated Performance Comparison of Virtual Machines and Linux Containers"

libart

Adaptive Radix Trees implemented in C

linux

The linux kernel source repository for Open-Channel SSDs

linux-custom

scripts for Archlinux to automake kernel

linux-nova

NOVA is a log-structured file system designed for byte-addressable non-volatile memories, developed at the University of California, San Diego.

mc-benchmark

Memcache port of Redis benchmark

mesh

A memory allocator that automatically reduces the memory footprint of C/C++ applications.

nvm-simulator

oc-cache

pointer-chasing

Utilities to measure read access times of caches, memory, and hardware prefetches for simple and fused operations

pymimircache

cache analysis platform developed at Emory University

random-distribution

These are some c files used to generate random distributed numbers，copy from this site: http://www.cse.usf.edu/~christen/tools/toolpage.html

recipe

RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)

slb

slsm-tree

High-Performance C++ Data System

smhasher

The new home of https://code.google.com/p/smhasher/

strata

Strata: A Cross Media File System

tlx

Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers

tools

some tools for disk read/write test

tpccbench

In memory TPC-C implementation. Used for a number of database research projects.

wormhole

Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)