Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Oleg Drokin

dblp:89/7436 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 1 since 2021Security and privacy · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Storage systems · 53% Memory systems · 40% Performance modeling and evaluation · 5%
Artificial intelligence
1 paper
3D vision · 100%
Network and information security
1 paper
Cyber-physical and IoT security · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › file systems
distributed file system
0.722022
MetaWBC: POSIX-Compliant Metadata Write-Back Caching for Distributed File Systems · SC 2022
Efficient Object Storage Journaling in a Distributed Parallel File System · FAST 2010
Storage systems
file systems
0.612022
MetaWBC: POSIX-Compliant Metadata Write-Back Caching for Distributed File Systems · SC 2022
Memory systems › cache management › storage caching
metadata caching
0.612022
MetaWBC: POSIX-Compliant Metadata Write-Back Caching for Distributed File Systems · SC 2022
Memory systems › cache management › storage caching
write-back caching
0.612022
MetaWBC: POSIX-Compliant Metadata Write-Back Caching for Distributed File Systems · SC 2022
Computer vision › 3D vision
depth perception
0.412020
Phantom of the ADAS: Securing Advanced Driver-Assistance Systems from Split-Second Phantom Attacks · CCS 2020
Cyber-physical and IoT security
autonomous vehicle security
0.412020
Phantom of the ADAS: Securing Advanced Driver-Assistance Systems from Split-Second Phantom Attacks · CCS 2020
Storage systems › file systems › distributed file system
parallel file system
0.322012
Characterizing output bottlenecks in a supercomputer · SC 2012
Efficient Object Storage Journaling in a Distributed Parallel File System · FAST 2010
Performance modeling and evaluation
workload characterization
0.112012
Characterizing output bottlenecks in a supercomputer · SC 2012
High-performance computing
parallel i/o
0.012012
Characterizing output bottlenecks in a supercomputer · SC 2012

Methods — techniques the papers use, named apart from their topics

convolutional neural network · 0.9committee of experts · 0.9file caching state machine · 0.6POSIX-compliant memory file system · 0.6statistical sampling · 0.1journaling · 0.1
YearPublicationVenuePosition
2022 MetaWBC: POSIX-Compliant Metadata Write-Back Caching for Distributed File Systems
abstract
In parallel and distributed file systems, caching can improve data performance and metadata operations. Currently, most distributed file systems adopt a write-back data cache for performance and a write-through metadata cache for simplifying consistency. However, with modern file systems scales and workloads, write-through metadata caching can impact overall file system performance, e.g., through lock contention and heavy RPC loads required for namespace synchronization and transaction serialization. This paper proposes a novel metadata write-back caching (MetaWBC) mechanism to improve the performance of metadata operations in distributed environments. To achieve extreme metadata performance, we developed a fast, lightweight, and POSIXcompatible memory file system as a metadata cache. Further, we designed a file caching state machine and included other performance optimizations. We coupled MetaWbc with Lustre and evaluated that MetaWbc can outperform the native parallel file system by up to 8x for metadata-intensive benchmarks, and up to 7x for realistic workloads in throughput.
Yingjin Qian, Wen Cheng 0003, Lingfang Zeng, Marc-Andre Vef, Oleg Drokin, Andreas Dilger, Shuichi Ihara, Wusheng Zhang, Yang Wang 0006, André Brinkmann
SC5
2020 Phantom of the ADAS: Securing Advanced Driver-Assistance Systems from Split-Second Phantom Attacks
abstract
In this paper, we investigate "split-second phantom attacks," a scientific gap that causes two commercial advanced driver-assistance systems (ADASs), Telsa Model X (HW 2.5 and HW 3) and Mobileye 630, to treat a depthless object that appears for a few milliseconds as a real obstacle/object. We discuss the challenge that split-second phantom attacks create for ADASs. We demonstrate how attackers can apply split-second phantom attacks remotely by embedding phantom road signs into an advertisement presented on a digital billboard which causes Tesla's autopilot to suddenly stop the car in the middle of a road and Mobileye 630 to issue false notifications. We also demonstrate how attackers can use a projector in order to cause Tesla's autopilot to apply the brakes in response to a phantom of a pedestrian that was projected on the road and Mobileye 630 to issue false notifications in response to a projected road sign. To counter this threat, we propose a countermeasure which can determine whether a detected object is a phantom or real using just the camera sensor. The countermeasure (GhostBusters) uses a "committee of experts" approach and combines the results obtained from four lightweight deep convolutional neural networks that assess the authenticity of an object based on the object's light, context, surface, and depth. We demonstrate our countermeasure's effectiveness (it obtains a TPR of 0.994 with an FPR of zero) and test its robustness to adversarial machine learning attacks.
Ben Nassi, Yisroel Mirsky, Dudi Nassi, Raz Ben-Netanel, Oleg Drokin, Yuval Elovici
CCS5
2012 Characterizing output bottlenecks in a supercomputer
abstract
Supercomputer I/O loads are often dominated by writes. HPC (High Performance Computing) file systems are designed to absorb these bursty outputs at high bandwidth through massive parallelism. However, the delivered write bandwidth often falls well below the peak. This paper characterizes the data absorption behavior of a center-wide shared Lustre parallel file system on the Jaguar supercomputer. We use a statistical methodology to address the challenges of accurately measuring a shared machine under production load and to obtain the distribution of bandwidth across samples of compute nodes, storage targets, and time intervals. We observe and quantify limitations from competing traffic, contention on storage servers and I/O routers, concurrency limitations in the client compute node operating systems, and the impact of variance (stragglers) on coupled output such as striping. We then examine the implications of our results for application performance and the design of I/O middleware systems on shared supercomputers.
Jeffrey S. Chase, David Dillow, Oleg Drokin, Scott Klasky, Sarp Oral, Norbert Podhorszki
SC4
2010 Efficient Object Storage Journaling in a Distributed Parallel File System
Sarp Oral, Feiyi Wang, David Dillow, Galen M. Shipman, Ross G. Miller, Oleg Drokin
FAST6
2009 Design, implementation, and evaluation of transparent pNFS on Lustre
abstract
Parallel NFS (pNFS) is an emergent open standard for parallelizing data transfer over a variety of I/O protocols. Prototypes of pNFS are actively being developed by industry and academia to examine its viability and possible enhancements. In this paper, we present the design, implementation, and evaluation of lpNFS, a Lustre-based parallel NFS. We achieve our primary objective in designing lpNFS as an enabling technology for transparent pNFS accesses to an opaque Lustre file system. We optimize the data flow paths in lpNFS by using two techniques: (a) fast memory coping for small messages, and (b) page sharing for zero-copy bulk data transfer. Our initial performance evaluation shows that the performance of lpNFS is comparable to that of original Lustre. Given these results, we assert that lpNFS is a promising approach to combining the benefits of pNFS and Lustre, and it exposes the underlying capabilities of Lustre file systems while transparently supporting pNFS clients.
Weikuan Yu, Oleg Drokin, Jeffrey S. Vetter
IPDPS2