Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Jaeyoung Do"'
Autor:
Robert K Bradley, Adam Roberts, Michael Smoot, Sudeep Juvekar, Jaeyoung Do, Colin Dewey, Ian Holmes, Lior Pachter
Publikováno v:
PLoS Computational Biology, Vol 5, Iss 5, p e1000392 (2009)
We describe a new program for the alignment of multiple biological sequences that is both statistically motivated and fast enough for problem sizes that arise in practice. Our Fast Statistical Alignment program is based on pair hidden Markov models w
Externí odkaz:
https://doaj.org/article/e3b9454ac68745d18b7a4d98c31e59bf
Autor:
Huaicheng Li, Martin L. Putra, Ronald Shi, Fadhil I. Kurnia, Xing Lin, Jaeyoung Do, Achmad Imam Kistijantoro, Gregory R. Ganger, Haryadi S. Gunawi
Publikováno v:
ACM Transactions on Storage. 19:1-33
Predictable latency on flash storage is a long-pursuit goal, yet unpredictability stays due to the unavoidable disturbance from many well-known SSD internal activities. To combat this issue, the recent NVMe IO Determinism (IOD) interface advocates ho
Publikováno v:
IEEE Transactions on Computers. 72:278-290
K-nearest neighbor search is one of the fundamental tasks in various applications and the hierarchical navigable small world (HNSW) has recently drawn attention in large-scale cloud services, as it easily scales up the database while offering fast se
Autor:
JAEYOUNG DO1 jaedo@microsoft.com, SENGUPTA, SUDIPTA2 sudipta@amazon.com, SWANSON, STEVEN3 swanson@cs.ucsd.edu
Publikováno v:
Communications of the ACM. Jun2019, Vol. 62 Issue 6, p54-62. 9p. 2 Color Photographs, 5 Diagrams, 1 Graph.
Publikováno v:
2022 IEEE 30th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM).
Autor:
Priscila M. V. Lima, Siavash Rezaei, Brunno F. Goldstein, Hossein Bobarshad, Jaeyoung Do, Mahdi Torabzadehkashi, Min Soo Kim, Diego Fonseca Pereira de Souza, Felipe M. G. França, Leandro Santiago, Victor C. Ferreira, Vladimir Alves, Ali Heydarigorji
Publikováno v:
ACM Transactions on Storage. 16:1-37
The growing volume of data produced continuously in the Cloud and at the Edge poses significant challenges for large-scale AI applications to extract and learn useful information from the data in a timely and efficient way. The goal of this article i
Publikováno v:
FCCM
K-nearest neighbor algorithm that searches the K closest samples in a high dimensional feature space is one of the most fundamental tasks in machine learning and image retrieval applications. Computational storage device that combines computing unit
Publikováno v:
ICDE
Exploiting a storage hierarchy is critical to cost-effective data management. However, most systems are challenged when data is not in cache because of the additional I/O to move data between SSD and main memory. To improve both cost and performance,
Publikováno v:
Communications of the ACM. 62:54-62
Programmable software-defined solid-state drives can move computing functions closer to storage.
Publikováno v:
Conference on Very Large Data Bases (VLDB Journal)
Do, J, Picoli, I L, Lomet, D B & Bonnet, P 2021, ' Better database cost/performance via batched I/O on programmable SSD ', The VLDB Journal, bind 30, nr. 3, s. 403-424 . https://doi.org/10.1007/s00778-020-00648-z
Do, J, Picoli, I L, Lomet, D B & Bonnet, P 2021, ' Better database cost/performance via batched I/O on programmable SSD ', The VLDB Journal, bind 30, nr. 3, s. 403-424 . https://doi.org/10.1007/s00778-020-00648-z
Data should be placed at the most cost- and performance-effective tier in the storage hierarchy. While performance and cost decrease with distance from the CPU, the cost/performance trade-off depends on how efficiently data can be moved across tiers.