Titlebook: Network and Parallel Computing; 15th IFIP WG 10.3 In Feng Zhang,Jidong Zhai,Mateo Valero Conference proceedings 2018 IFIP International Fed

lattice

PANIC

https://doi.org/10.1007/978-3-030-05677-3artificial intelligence; cloud computing; clustering; computer architecture; computer networks; computer

N防腐劑

FSObserver: A Performance Measurement and Monitoring Tool for Distributed Storage Systems,sed on the message analysis, named FSObserver, which can accurately and fine-grained trace individual request or response by observing network traffic. Experiments results show that our approach can get accurate performance with slight performance degradation.

隼鷹

帳單

窗簾等

ALOR: Adaptive Layout Optimization of Raft Groups for Heterogeneous Distributed Key-Value Stores, node hardware configuration for the underlying cluster and thus adopt even data distribution schemes. However, today’s distributed systems tend to be heterogeneous in nodes’ I/O devices due to the regular worn I/O device replacement and the emergence of expensive new storage media (e.g., non-volati

緩和

STrieGD: A Sampling Trie Indexed Compression Algorithm for Large-Scale Gene Data, of compression algorithms have been developed. However, currently used algorithms fail to simultaneously achieve high compression ratio as well as high compression speed. We propose an algorithm STrieGD that is based on a trie index structure for improving the compression speed of FASTQ files. To r

CRAFT

西瓜

An Efficient Method for Determining Full Point-to-Point Latency of Arbitrary Indirect HPC Networks,eling, link-failure detection, and application optimization. However, it is often hard to determine the full-scale point-to-point latency of large scale HPC networks since it often requires measurements to the square of the number of terminal nodes. In this paper, we propose an efficient method to g

AER

KT-Store: A Key-Order and Write-Order Hybrid Key-Value Store with High Write and Range-Query Perforlability. There are two types of data organization in current KV stores: . layout and . layout, which organize records according to key order and write sequence, respectively. While the former and the latter layouts deliver high throughput for range-query and write operations respectively, neither o