cgcl-codes Goto Github PK

fastcryptgpu

FastCryptGPU is a GPU-based system for privacy-preserving machine learning based on secure multi-party computation

fastjoin

A scalable distributed stream join system

fastresponse

featureindistinguishableattack

Implementation of ACM CCS 2021 paper "Feature-Indistinguishable Attack to Circumvent Trapdoor-enabled Defense".

fjoin

fog

FoG is a Fast Out-of-core Graph processing framework.

fr3e

FR3E is an entity extraction and relation extraction model for financial texts.

frog

Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule) about coloring algorithms as we observed through masses of real graph coloring cases.

geckodag

gengar

Gengar, a distributed shared hybrid memory pool with RDMA support. Gengar allows applications to access remote DRAM/NVM in a large and global memory space through a client/server model.

giraffe

we propose Giraffe, a scalable distributed coordination service. There are three important contributions in our design. (1) Giraffe organizes coordination servers using interior-node- disjoint trees for better scalability. (2) Giraffe employs a novel Paxos protocol for strong consistency and fault-tolerance. (3) Giraffe supports hierarchical data organization and in-memory storage for high throughput and low latency.

gradientsscrutinizer

graphchallenge21

graph challenge 2021

hcb-phcb

hiergat

the implementation of "Entity Resolution via Hierarchical Graph Attention Network"

hmcached

HMCached is an in-memory K-V store built on a hybrid DRAM/NVM system. HMCached utilizes an application-level data access counting mechanism to identify frequently-accessed (hotspot) objects (i.e., K-V pairs) in NVM, and migrates them to fast DRAM to reduce the costly NVM accesses. We also propose an NVM-friendly index structure to store the frequently-updated portion of object metadata in DRAM, and thus further mitigate the NVM accesses. Moreover, we propose a benefit-aware memory reassignment policy to address the slab calcification problem in slab-based K-V store systems, and significantly improve the benefit gain from the DRAM.

hme

HME a hybrid memory emulator for studying the performance and energy characteristics of upcoming NVM technologies. HME exploits features available in commodity NUMA architectures to emulate two kinds of memories: fast, local DRAM, and slower, remote NVM on other NUMA nodes. HME can emulates a wide range of NVM latencies and bandwidth by injecting different memory access delay on the remote NUMA nodes. To facilitate programmers and researchers in evaluating the impact of NVM on the application performance, a high-level programming interface is also provided to allocate memory from NVM or DRAM nodes.

homdroid

horae

Horae is a graph stream summarization structure for efficient temporal range queries. Horae can deal with temporal queries with arbitrary and elastic range while guaranteeing one-sided and controllable errors. More to the point, Horae provides a worst query time of O(log L), where L is the length of query range. Hoare leverages multi-layer storage and Binary Range Decomposition (BRD) algorithm to decompose the temporal range query to logarithmic time interval queries and executes these queries in corresponding layers.

hscc

HSCC is implemented with zsim-nvmain hybrid simulator, it has achieved the following functions: (1) Memory management simulations (such as MemoryNode, Zone, Buddy Allocator etc.); (2) TLB, page table and reversed page table simulations; (3) Implementation of SHMA, a hierarchical hybrid DRAM/NVM memory system that brought DRAM caching issues into software level; (4) Multiple DRMA-NVM hybrid architecture supports.

indexgraph

a dynamic graph processing system

jidar

An implementation for the paper [ICDCS'19]Jidar

lama-tk

LAMA-TK (LAnguage Model Analysis for Temporal Knowledge) is a new dataset for probing language models for temporally-scoped knowledge. LAMA-TK queries temporal knowledge including entity names and special timestamps, and reserves all correct answers for each query.

lambdamisuse

layrub

Layrub is a runtime data placement strategy for extreme-scale net training. It is developed on BVLC Caffe, and achieves memory savings more than 50% over BVLC Caffe.

layup

Layup provides a memory optimization strategy for CNNs based on BVLC Caffe.

lcs

LCS is an efficient data eviction strategy for Spark, a popular distributed in-memory data processing system. LCS gets dependencies information between cache data via analyzing application, and calculates the recovery cost during running

ldcf

LDCF is a novel efficient approximate set representation structure for large-scale dynamic data sets. LDCF uses a novel multi-level tree structure and reduces the worst insertion and membership testing times from O(N) to O(1).

ldv

A Lightweight DAG-Based Blockchain for Vehicular Social Networks

libdroid

An unikernel-based runtime for mobile computation offloading under Mobile Fog Computing or Mobile Edge Computing scenarios.