Fast Lossless Compression of Scientific Floating-Point Data
Fast Lossless Compression of Scientific Floating-Point Data Paruj Ratanaworabhan, Jian Ke, and Martin Burtscher Computer Systems Laboratory School of Electrical and Computer Engineering Cornell University, Ithaca, NY 14853 {paruj, jke, burtscher}@csl.cornell.edu Abstract In scientific computing environments, large amounts of floating-point data often need to be transferred between computers as wel
Hybrid computing using a neural network with dynamic external memory
Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.
Cache Obvious Algorithms and Data structures.pdf
Cache-Oblivious Algorithms and Data Structures Erik D. Demaine MIT Laboratory for Computer Science, 200 Technology Square, Cambridge, MA 02139, USA, edemaine@mit.edu Abstract. A recent direction in the design of cache-efficient and disk- efficient algorithms and data structures is the notion of cache oblivi- ousness, introduced by Frigo, Leiserson, Prokop, and Ramachandran in 1999. Cache-oblivious
Log Structured Merge Trees - ben stopford
It’s nearly a decade since Google released its ‘Big Table’ paper. One of the many cool aspects of that paper was the file organisation it uses. The approach is more generally known as the Log Structured Merge Tree, after this 1996 paper, although the algorithm described there differs quite significantly from most real-world implementations. LSM is now used in a number of products as the main file
The Log-Structured Merge-Tree (LSM-Tree)
-1- The Log-Structured Merge-Tree (LSM-Tree) Patrick O'Neil1, Edward Cheng2 Dieter Gawlick3, Elizabeth O'Neil1 To be published: Acta Informatica ABSTRACT. High-performance transaction system applications typically insert rows in a History table to provide an activity trace; at the same time the transaction system generates log records for purposes of system recovery. Both types of generated inform
A Fast, Minimal Memory, Consistent Hash Algorithm ご紹介(システム系論文紹介 Advent Calendar 2014）. - Qiita
(本稿は, システム系論文紹介 Advent Calendar 2014, 12/20 です http://www.adventar.org/calendars/440) 論文は arXiv から取得できます. http://arxiv.org/abs/1406.2294 Jump Consitent Hash と呼ばれる, 分散ストレージ系で有益なハッシュ関数を求めるアルゴリズムです. 現在史上最強のハッシュアルゴリズムのひとつと言えるでしょう. 無性に分散ストレージライブラリを作りたくなってきますね! 共著者の Eric Veach にも注目です. Google を救ったと言われている distinguished engineer です. (G 社のひとは彼の名前を社員名簿データベース? から探してみましょう! 社員番号 20 くらいにあるらしいですよ!) そんな彼がなんと 10 年以
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Decoding billions of integers per second through vectorization
https://dl.acm.org/citation.cfm?doid=368637.368709&CFID=762056675&CFTOKEN=14141388
https://dl.acm.org/citation.cfm?id=1187859
CiteSeerX
Fast Prefix Code Processing