메뉴 건너뛰기




Volumn 42, Issue 2, 2014, Pages 3-14

Joint latency and cost optimization for erasure-coded data center storage

Author keywords

[No Author keywords available]

Indexed keywords

FORWARD ERROR CORRECTION; MULTIPROCESSING SYSTEMS;

EID: 84908217731     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2667522.2667524     Document Type: Conference Paper
Times cited : (46)

References (46)
  • 4
    • 84875692741 scopus 로고    scopus 로고
    • Storage architecture and challenges
    • Fikes, Andrew. "Storage architecture and challenges." Talk at the Google Faculty Summit, available online at http://bit.ly/nUylRW, 2010.
    • (2010) Talk at the Google Faculty Summit
    • Fikes, A.1
  • 6
    • 33847729048 scopus 로고    scopus 로고
    • Distributed and energy-Aware MAC for differentiated services wireless packet networks: A general queuing analytical framework
    • A. Fallahi and E. Hossain, "Distributed and energy-Aware MAC for differentiated services wireless packet networks: a general queuing analytical framework", IEEE CS, CASS, ComSoc, IES, SPS, 2007.
    • (2007) IEEE CS, CASS, ComSoc, IES, SPS
    • Fallahi, A.1    Hossain, E.2
  • 7
    • 0001567447 scopus 로고
    • The fork-join queue and related systems with synchronization constraints: Stochastic ordering and computable bounds
    • F. Baccelli, A. Makowski, and A. Shwartz, "The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds, Advances in Applied Probability, pp. 629660, 1989.
    • (1989) Advances in Applied Probability , pp. 629660
    • Baccelli, F.1    Makowski, A.2    Shwartz, A.3
  • 8
    • 0032000009 scopus 로고    scopus 로고
    • Matrix-geometric solution of discrete time MAP/PH/1 priority queue
    • A. S. Alfa, "Matrix-geometric solution of discrete time MAP/PH/1 priority queue", Naval research logistics, vol. 45, 00. 23-50, 1998.
    • (1998) Naval Research Logistics , vol.45 , Issue.0 , pp. 23-50
    • Alfa, A.S.1
  • 9
    • 84908192991 scopus 로고    scopus 로고
    • Performance of carrier sense multiple access with collision avoidance in wireless LANs
    • J. H. Kim and J. K. Lee, "Performance of carrier sense multiple access with collision avoidance in wireless LANs", Proc. IEEE IPDS., 1998.
    • (1998) Proc. IEEE IPDS.
    • Kim, J.H.1    Lee, J.K.2
  • 10
    • 0037082689 scopus 로고    scopus 로고
    • CSMA/CA Performance under high traffic conditions: Throughput and delay analysis
    • E. Ziouva and T. Antoankopoulos, "CSMA/CA Performance under high traffic conditions: throughput and delay analysis", Computer Comm, vol. 25, pp. 313-321, 2002.
    • (2002) Computer Comm , vol.25 , pp. 313-321
    • Ziouva, E.1    Antoankopoulos, T.2
  • 12
    • 77952785803 scopus 로고    scopus 로고
    • Reliable storage and querying for collaborative data sharing systems
    • N. E. Taylor and Z. G. Ives, "Reliable storage and querying for collaborative data sharing systems", IEEE ICED Conference, 2010.
    • (2010) IEEE ICED Conference
    • Taylor, N.E.1    Ives, Z.G.2
  • 17
    • 70349656201 scopus 로고    scopus 로고
    • Link gradients: Predicting the impact of network latency on multi-tier applications
    • S. Chen, K. R. Joshi and M. A. Hiltunem, "Link Gradients: Predicting the Impact of Network Latency on Multi-Tier Applications", Proc. IEEE INFOCOM, 2009.
    • (2009) Proc. IEEE INFOCOM
    • Chen, S.1    Joshi, K.R.2    Hiltunem, M.A.3
  • 19
    • 44049097729 scopus 로고    scopus 로고
    • Erasure codes with small overhead factor and their distributed storage applications
    • H. Kameyam and Y. Sato, "Erasure Codes with Small Overhead Factor and Their Distributed Storage Applications", CISS'07. 41st Annual Conference, 2007.
    • (2007) CISS'07. 41st Annual Conference
    • Kameyam, H.1    Sato, Y.2
  • 23
    • 80054814962 scopus 로고    scopus 로고
    • Enabling node repair in any erasure code for distributed storage
    • K. V. Rashmi, N. Shah, and V. Kumar, "Enabling node repair in any erasure code for distributed storage", Proceedings of IEEE ISIT, 2011.
    • (2011) Proceedings of IEEE ISIT
    • Rashmi, K.V.1    Shah, N.2    Kumar, V.3
  • 25
    • 84908192979 scopus 로고    scopus 로고
    • Quantifying benefit and cost of erasure code based file systems
    • S. Mochan and L. Xu, "Quantifying Benefit and Cost of Erasure Code based File Systems." Technical report available at http://nisl.wayne.edu/Papers/Tech/cbefs.pdf, 2010.
    • (2010) Technical Report
    • Mochan, S.1    Xu, L.2
  • 32
    • 85077123991 scopus 로고    scopus 로고
    • Rethinking erasure codes for cloud file systems: Minimizing I/O for recovery and degraded reads
    • O. Khan, R. Burns, J. Plank, W. Pierce, and C. Huang, "Rethinking erasure codes for cloud file systems: Minimizing I/O for recovery and degraded reads", In Proceedings of FAST, 2012.
    • (2012) Proceedings of FAST
    • Khan, O.1    Burns, R.2    Plank, J.3    Pierce, W.4    Huang, C.5
  • 37
  • 39
    • 84908192972 scopus 로고    scopus 로고
    • Codes can reduce queueing delay in data centers
    • L. Huang, S. Pawar, H. Zhang and K. Ramchandran, "Codes Can Reduce Queueing Delay in Data Centers", Journals CORR, vol. 1202. 1359, 2012.
    • (2012) Journals CORR , vol.1202 , Issue.1359
    • Huang, L.1    Pawar, S.2    Zhang, H.3    Ramchandran, K.4
  • 44
    • 15244346000 scopus 로고    scopus 로고
    • The DC (difference of convex functions) programming and DCA revisited with DC models of real world non-convex optimization problems
    • Jan
    • L. T. Hoai An and P. D. Tao, "The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Non-convex Optimization Problems", Annals of Operations Research, vol. 133, Issue 1-4, pp. 23-46, Jan 2005.
    • (2005) Annals of Operations Research , vol.133 , Issue.1-4 , pp. 23-46
    • An, L.T.H.1    Tao, P.D.2


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