cs   30903

« earlier    

FASTER - Microsoft Research
FASTER is a new key-value store for point operations, that combines a highly cache-optimized concurrent hash index with a novel self-tuning data organization. It extends the standard key-value store interface to handle read-modify-writes and blind update operations. FASTER achieves orders-of-magnitude better throughput – up to 160M operations per second on a single machine – than alternative systems deployed widely today, and exceeds the performance of pure in-memory data structures when the working set fits in memory.

The FASTER research paper appeared at SIGMOD 2018 conference, and can be downloaded under the publications tab.
cs  keyvalue  storage 
yesterday by euler
Q: Why Do Keynote Speakers Keep Suggesting That Improving Security Is Possible? A: Because Keynote Speakers Make Bad Life Decisions and Are Poor Role Models | USENIX
Q: Why Do Keynote Speakers Keep Suggesting That Improving Security Is Possible?
A: Because Keynote Speakers Make Bad Life Decisions and Are Poor Role Models
internet  iot  security  cs  keynote 
yesterday by euler
VigNAT: A Formally Verified Performant NAT
The challenge lies in combining the results of these two verification techniques, and for that we developed a technique we call “lazy proofs”. A lazy proof consists of sub-proofs structured in a way that top-level proofs proceed assuming lower level properties, and the latter are proven lazily a posteriori. For example, symbolic execution requires the use of models that must be correct; we first do the symbolic execution and only afterward validate automatically the correctness of the models. This approach enables us to avoid having to prove that our models are universally valid—which is hard—but instead only prove that they are valid for the specific NF and the specific properties we verified earlier with symbolic execution. This is much easier.
networking  cs  proof  NAT 
yesterday by euler
This repository contains JavaScript based examples of many popular algorithms and data structures.
cs  javascript  algorithms  datastructures 
2 days ago by gohai

« earlier    

related tags

(popular  abstract  academic  academicpublishing  ai  algo  algorithm  algorithms/data-structures/design-patterns  algorithms  architecture  artificial_intelligence  assembler  assembly  automation  automerge  axe  big-o  bigo  binary  blog  blunt  book  bookmarks_bar  books  boolean  bug  calcullus  calculus  categorytheory  cg  cheatsheet  circulationchanges  classes  clever  cli  cnf  code  coding-challenges  collaboration  collaborative  complexity  compsci  computational_complexity  computer-science  computer  computergraphics  computers  computerscience  computing  computingunplugged  concurrency  conflict  course  courses  cpp  cpu  crdt  curriculum  dance  data  datastructures  deeplearning  delta  designs-i-like  diff  differential-synchronization  diffing  diffs  digital_ethics  dijkstra  disss  dnf  drought  ebook  ebooks  eco  economic_history  economics  education  emu  emulator  essay  ethics  explore  expo  fre  free  gendergap  gh  github  googledocs  graph  graphs  guru  hardware  history  hobbies  humor  ifttt  interesting  internet  interpretation  interview  iot  javascript  journal  julia  kata  keynote  keyvalue  khan_academy  lambda  lamping  language  learn  learning  lectures  letter  lib  linux  machinelearning  math  maths  merge  metrics  mexico  mit  ml  nat  networking  nn  numericalanalysis  online  optimal  os  overview  paper  papers  parser  people  physics  pl  pocket  procesor  professional  programming  programs  programsynthesis  proof  publication  publications  py  recommendation  reduce  reduction  reference  regex  relation  repo  research  resources  retrodev  ruby  sat-solver  sat  science  search  security  sicp  solver  stackoverflow  storage  structure  sudoku  sync  synchronization  systems  talk  technique  texas  textdiff  theory  tools  toread  tries  truth  tsp  tut  tutorial  uncomfortable  university  vid  vlsi  water_supply  wiz  womenintech  yacc  yass 

Copy this bookmark: