메뉴 건너뛰기




Volumn , Issue , 2014, Pages

From application requests to virtual IOPs: Provisioned key-value storage with libra

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EID: 84900449925     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2592798.2592823     Document Type: Conference Paper
Times cited : (26)

References (33)
  • 4
    • 84900433279 scopus 로고    scopus 로고
    • Amazon. EBS Provisioned IOPs. http://docs.aws.amazon.com/AWSEC2/latest/ UserGuide/EBSVolumeTypes.html, 2014.
    • (2014) EBS Provisioned IOPs
  • 5
    • 84900386892 scopus 로고    scopus 로고
    • Amazon DynamoDB. http://aws.amazon.com/dynamodb/, 2014.
    • (2014) Amazon DynamoDB
  • 7
    • 84942108849 scopus 로고    scopus 로고
    • Apache. Cassandra. http://cassandra.apache.org/, 2014.
    • (2014) Cassandra
  • 8
    • 33646418570 scopus 로고    scopus 로고
    • Linux Block IO-present and future
    • J. Axboe. Linux Block IO-present and future. In Ottawa Linux Symp., 2004.
    • (2004) Ottawa Linux Symp
    • Axboe, J.1
  • 9
    • 47649110802 scopus 로고    scopus 로고
    • Group ratio round-robin: O(1) proportional share scheduling for uniprocessor and multiprocessor systems
    • B. Caprita, W. C. Chan, J. Nieh, C. Stein, and H. Zheng. Group ratio round-robin: O(1) proportional share scheduling for uniprocessor and multiprocessor systems. In USENIX Annual, 2005.
    • (2005) USENIX Annual
    • Caprita, B.1    Chan, W.C.2    Nieh, J.3    Stein, C.4    Zheng, H.5
  • 12
    • 0024889726 scopus 로고
    • Analysis and simulation of a fair queueing algorithm
    • A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In SIGCOMM, 1989.
    • (1989) SIGCOMM
    • Demers, A.1    Keshav, S.2    Shenker, S.3
  • 13
    • 84883292413 scopus 로고    scopus 로고
    • Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler
    • K. J. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler. In SOSP, 1999.
    • (1999) SOSP
    • Duda, K.J.1    Cheriton, D.R.2
  • 15
    • 84900437182 scopus 로고    scopus 로고
    • Google. Google cloud SQL. https://cloud.google.com/products/cloud-sql/ 2014.
    • (2014) Google Cloud SQL
  • 16
    • 0003212892 scopus 로고    scopus 로고
    • Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks
    • P. Goyal, H. M. Vin, and H. Chen. Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks. In SIGCOMM, 1996.
    • (1996) SIGCOMM
    • Goyal, P.1    Vin, H.M.2    Chen, H.3
  • 17
    • 79952807933 scopus 로고    scopus 로고
    • PClock: An arrival curve based approach for QoS guarantees in shared storage systems
    • A. Gulati, A. Merchant, and P. J. Varman. pClock: An arrival curve based approach for QoS guarantees in shared storage systems. In SIGMETRICS, 2007.
    • (2007) SIGMETRICS
    • Gulati, A.1    Merchant, A.2    Varman, P.J.3
  • 18
    • 84860347560 scopus 로고    scopus 로고
    • PARDA: Proportional allocation of resources for distributed storage access
    • A. Gulati, I. Ahmad, and C. A. Waldspurger. PARDA: Proportional allocation of resources for distributed storage access. In FAST, 2009.
    • (2009) FAST
    • Gulati, A.1    Ahmad, I.2    Waldspurger, C.A.3
  • 19
    • 80052536661 scopus 로고    scopus 로고
    • MClock: Handling throughput variability for hypervisor IO scheduling
    • A. Gulati, A. Merchant, and P. J. Varman. mClock: Handling throughput variability for hypervisor IO scheduling. In OSDI, 2010.
    • (2010) OSDI
    • Gulati, A.1    Merchant, A.2    Varman, P.J.3
  • 21
    • 67650021813 scopus 로고    scopus 로고
    • Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
    • T. Li, D. Baumberger, and S. Hahn. Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin. In PPoPP, 2009.
    • (2009) PPoPP
    • Li, T.1    Baumberger, D.2    Hahn, S.3
  • 22
    • 84900422951 scopus 로고    scopus 로고
    • P. Menage. Cgroups. https://www.kernel.org/doc/Documentation/cgroups/ cgroups.txt 2014.
    • (2014) Cgroups
    • Menage, P.1
  • 26
    • 85077125433 scopus 로고    scopus 로고
    • FIOS: A fair, efcient flash I/O schedule
    • S. Park and K. Shen. FIOS: A fair, efcient flash I/O schedule. In FAST, 2012.
    • (2012) FAST
    • Park, S.1    Shen, K.2
  • 27
    • 84900391548 scopus 로고    scopus 로고
    • Rackspace. Cloud Block Storage. http://www.rackspace.com/cloud/block- storage/2014.
    • (2014) Cloud Block Storage
  • 28
    • 84897795528 scopus 로고    scopus 로고
    • FlashFQ: A fair queueing I/O scheduler for flash-based SSDs
    • K. Shen and S. Park. FlashFQ: A fair queueing I/O scheduler for flash-based SSDs. In USENIX Annual, 2013.
    • (2013) USENIX Annual
    • Shen, K.1    Park, S.2
  • 29
    • 0030171894 scopus 로고    scopus 로고
    • Efficient fair queuing using deficit round-robin
    • M. Shreedhar and G. Varghese. Efficient fair queuing using deficit round-robin. Trans. Networking, 4(3):375- 385, 1996.
    • (1996) Trans. Networking , vol.4 , Issue.3 , pp. 375-385
    • Shreedhar, M.1    Varghese, G.2
  • 30
    • 85076924934 scopus 로고    scopus 로고
    • Performance isolation and fairness for multi-tenant cloud storage
    • D. Shue, M. J. Freedman, and A. Shaikh. Performance isolation and fairness for multi-tenant cloud storage. In OSDI, 2012.
    • (2012) OSDI
    • Shue, D.1    Freedman, M.J.2    Shaikh, A.3
  • 31
    • 0003208227 scopus 로고    scopus 로고
    • A hierarchical fair service curve algorithm for link-sharing, real-time and priority services
    • I. Stoica, H. Zhang, and T. S. E. Ng. A hierarchical fair service curve algorithm for link-sharing, real-time and priority services. In SIGCOMM, 1997.
    • (1997) SIGCOMM
    • Stoica, I.1    Zhang, H.2    Ng, T.S.E.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.