Goldbrakteaten und Dänenkönige

Axboe, Morten; Keller, Hagen; Staubach, Nikolaus

doi:10.1515/9783110846119.144

Cited by 22 publications

(26 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Workload and testbed. We use FIO [2] for microbenchmark evaluations. FIO generates reads and writes with full sequential and full random patterns; in the evaluation, four different microbenchmark patterns, we denote them as SEQ_RD (sequential reads), RND_RD (random reads), SEQ_WR (sequential writes), and RND_WR (random writes), respectively.…”

Section: Discussionmentioning

confidence: 99%

Automatic-SSD

Park

2020

Proceedings of the 39th International Conference on Computer-Aided Design

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 99%

Automatic-SSD

Park

2020

Proceedings of the 39th International Conference on Computer-Aided Design

View full text Add to dashboard Cite

“…We employ the widely used [4,6,23,25,39,42] Flexible I/O tester (fio-2.99) [18] to characterize the performance and latency of the systems presented in Table 3. We configure fio to use the libaio Linux library to generate asynchronous I/O traffic for both read and write requests to the NVMe drive.…”

Section: Evaluation 41 Experimental Methodologymentioning

confidence: 99%

“…Considering that the smallest block size that the FastPath architecture supports is 4 KB, the maximum request size that can be served simultaneously by the FastPath_Control_MP module is 16 KB. Figure 8 presents the distribution of the latency amongst various layers when running the standard Flexible I/O (fio) benchmark [18] for a single I/O request with 4 KB block size. In particular, Figure 8(a) shows the breakdown of the latency across the Linux OS layers on the Xilinx Zynq-7000 SoC, as presented in our previous work [37].…”

Section: Fastpath_control_mp Modulementioning

confidence: 99%

FastPath_MP

Stratikopoulos

Kotselidis

Goodacre

et al. 2020

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

In this article, we present FastPath_MP, a novel low-overhead and energy-efficient storage multi-path architecture that leverages FPGAs to operate transparently to the main processor and improve the performance and energy efficiency of accessing storage devices. We prototyped FastPath_MP on both Arm-FPGA Zynq 7000 SoC and Zynq UltraScale+ MPSoC and evaluated its performance against standard microbenchmarks as well as the real-world in-memory Redis database. Our results show that FastPath_MP achieves up to 82% lower latency, up to 12× higher throughput, and up to 10× more energy efficiency against the baseline storage path of the Linux kernel. CCS Concepts: • Computer systems organization → System on a chip; • Hardware → External storage;

show abstract

“…To provide a fair comparison, for each SSE scheme given in the comparison, we analyzed its memory access pattern to deduce its IO workload. We then replayed that workload using the highly optimized fio Flexible I/O Tester (version 3.19) [Axb20]. While doing so, we have systematically advantaged the competition.…”

Section: Performancementioning

confidence: 99%

SSE and SSD: Page-Efficient Searchable Symmetric Encryption

Bossuat

Bost

Fouque

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Searchable Symmetric Encryption (SSE) enables a client to outsource a database to an untrusted server, while retaining the ability to securely search the data. The performance bottleneck of classic SSE schemes typically does not come from their fast, symmetric cryptographic operations, but rather from the cost of memory accesses. To address this issue, many works in the literature have considered the notion of locality, a simple design criterion that helps capture the cost of memory accesses in traditional storage media, such as Hard Disk Drives. A common thread among many SSE schemes aiming to improve locality is that they are built on top of new memory allocation schemes, which form the technical core of the constructions.The starting observation of this work is that for newer storage media such as Solid State Drives (SSDs), which have become increasingly common, locality is not a good predictor of practical performance. Instead, SSD performance mainly depends on page efficiency, that is, reading as few pages as possible. We define this notion, and identify a simple memory allocation problem, Data-Independent Packing (DIP), that captures the main technical challenge required to build page-efficient SSE. As our main result, we build a page-efficient and storage-efficient data-independent packing scheme, and deduce the Tethys SSE scheme, the first SSE scheme to achieve at once O(1) page efficiency and O(1) storage efficiency. The technical core of the result is a new generalization of cuckoo hashing to items of variable size. Practical experiments show that this new approach achieves excellent performance.

show abstract

Goldbrakteaten und Dänenkönige

Cited by 22 publications

References 0 publications

Automatic-SSD

Automatic-SSD

FastPath_MP

SSE and SSD: Page-Efficient Searchable Symmetric Encryption

Contact Info

Product

Resources

About