Name: fasst
Owner: Efficient Computing at Carnegie Mellon
Description: Source code for our OSDI 2016 paper
Created: 2016-11-02 15:18:29.0
Updated: 2018-05-02 06:31:02.0
Pushed: 2018-04-21 14:55:14.0
Homepage: null
Size: 29798
Language: C++
GitHub Committers
User | Most Recent Commit | # Commits |
---|
Other Committers
User | Most Recent Commit | # Commits |
---|
Fast, scalable, and simple transactions over RDMA. For historical reasons, FaSST is called HoTS in this codebase. This is the source code for our USENIX OSDI paper.
is_roce()
usage in HERD for
details.All benchmarks run in a symmetric setting with multiple machines (i.e., there are no designated server or client machines. Every benchmark is contained in one directory.
HRD_REGISTRY_IP
in run-servers.sh
to the IP address of server 0's
machine. This machine runs a memcached instance that is used as a queue pair
registry. echo 8192 > /sys/devices/system/node/node0/hugepages/hugepages-2048kB/nr_hugepages
| Directory | Description |
| ————- | ————- |
| libhrd
| An RDMA management and communication library. |
| rpc
| FaSST RPCs. This should depend only on libhrd
and hots.h
. |
| mica2
| A C++ implementation of a MICA hash table. |
| datastore
| Interface of FaSST datastores, and RPC handlers for MICA.|
| tx
| The transaction protocol. |
| logger
| The commit record logger for transactions. |
| mappings
| Helper functions to determine primary/backup/log machine numbers. |
| app
| Benchmarks (TATP, SmallBank, RPC microbenchmark, packet loss test). |
| drivers
| Modified libmlx4
and libmlx5
drivers with the cheap RECV posting optimization.|
| loss\_study
| The code and output logs used in our InfiniBand packet loss study. |
| other
| Contains a DCT benchmark. |
Each benchmark in the app
directory contains a Makefile to build the benchmark.
HRD_REGISTRY_IP
to node-1
's IP addressHRD_MAX_INLINE
to 60 bytesnum_ports
to 1thread i -> core 2 * i
to
thread i -> core i
Hyeontaek Lim's MICA code is used directly and in a modified way.
Anuj Kalia (akalia@cs.cmu.edu)
Copyright 2016, Carnegie Mellon University
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.