High Tech, High Touch

Search
Close
Search
 

교수소개

  • home
  • 교수소개
  • 전임교수
  • 소프트웨어학과

교수소개

전임교수 -

소프트웨어학과

  • 교수 대용량 데이터 처리 시스템
  • 남범석
    Lab 대용량 데이터처리 연구실
  • 031-290-7967
  • 산학협력센터 5층 85566호실

관심분야

대용량 데이터 처리, 컴퓨터 시스템, 분산 병렬 컴퓨팅

학력

  • Ph.D. University of Maryland, College Park, 2007
  • M.S./B.S. 서울대학교

약력/경력

  • UNIST (울산과학기술원), 20010-2018
  • Oracle USA, 2007-2010

학술지 논문

  • (2022)  Pivotal B plus tree for Byte-Addressable Persistent Memory.  IEEE ACCESS.  10,  -
  • (2021)  Failure-Atomic Byte-Addressable R-tree for Persistent Memory.  IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS.  32,  3
  • (2021)  Failure-Atomic Byte-Addressable R-tree for Persistent Memory.  IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS.  32,  3
  • (2020)  B-3-Tree: Byte-Addressable Binary B-Tree for Persistent Memory.  ACM TRANSACTIONS ON STORAGE.  16,  3
  • (2018)  clfB-tree: Cacheline Friendly Persistent B-tree for NVRAM.  ACM TRANSACTIONS ON STORAGE.  14,  1
  • (2018)  Co-processing heterogeneous parallel index for multi-dimensional datasets..  JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING.  113, 

학술회의논문

  • (2023)  NV-SQL: Boosting OLTP Performance with Non-Volatile DIMMs.  International Conference on Very Large Databases.  캐나다
  • (2023)  NVMe-Driven Lazy Cache Coherence for Immutable Data with NVMe over Fabrics.  IEEE International Conference on Cloud Computing.  미국
  • (2023)  On Stacking a Persistent Memory File System on Legacy File Systems.  USENIX Conference on File and Storage Technologies.  미국
  • (2022)  In-Page Shadowing and Two-Version Timestamp Ordering for Mobile DBMSs.  International Conference on Very Large Databases.  오스트레일리아
  • (2022)  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory.  USENIX Symposium on Operating Systems Design and Implementation.  미국
  • (2022)  VeloxDFS: Streaming Access to Distributed Datasets to Reduce Disk Seeks.  IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing.  이탈리아
  • (2020)  BoLT: Barrier-optimized LSM-Tree.  ACM/IFIP MIDDLEWARE (BKCSA083).  네덜란드
  • (2020)  Doubleheader Logging: Eliminating Journal Write Overhead for Mobile DBMS.  International Conference on Data Engineering.  미국
  • (2020)  FAST and FAIR B+-Tree for Byte-Addressable Persistent Memory.  10th Annual Non-Volatile Memories Workshop.  미국
  • (2020)  SLM-DB: Single-Level Key-Value Store with Persistent Memory.  USENIX Conference on File and Storage Technologies.  미국
  • (2019)  Write-Optimized Dynamic Hashing for Persistent Memory.  USENIX Conference on File and Storage Technologies.  미국
  • (2019)  SLM-DB: Single-Level Key-Value Store with Persistent Memory.  USENIX Conference on File and Storage Technologies.  미국
  • (2019)  Write-Optimized Dynamic Hashing for Persistent Memory.  USENIX Conference on File and Storage Technologies.  미국
  • (2018)  CAVA: Exploring Memory Locality for Big Data Analytics in Virtualized Clusters.  IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2018).  미국
  • (2018)  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree.  16th USENIX Conference on File and Storage Technologies (FAST 18).  미국