Article

Using Memcached for Data Distribution in Industrial Environment

Author:

Jure PetrovicAuthors Info & Claims

ICONS '08: Proceedings of the Third International Conference on Systems

Pages 368 - 372

https://doi.org/10.1109/ICONS.2008.51

Published: 13 April 2008 Publication History

Publisher Site

Abstract

This article focuses on data exchange in a distributed industrial application. It presents data distribution mechanism that imitates distributed shared memory by caching heavily used objects in memory. When configured and used properly such system is suitable for transparent data sharing in a distributed real-time image processing environment.

Cited By

View all

Xu HLi AWheatman BMarneni MPandey P(2023)BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-TreesProceedings of the VLDB Endowment10.14778/3611479.361150216:11(2976-2989)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611502
Tan JZhang TLi FChen JZheng QZhang PQiao HShi YCao WZhang R(2019)iBTuneProceedings of the VLDB Endowment10.14778/3339490.333950312:10(1221-1234)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.14778/3339490.3339503
Zhang JLi QZhou W(2016)HDCacheJournal of Grid Computing10.1007/s10723-015-9360-914:3(407-428)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1007/s10723-015-9360-9
Show More Cited By

Index Terms

Using Memcached for Data Distribution in Industrial Environment
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Distributed memory
    2. Software system structures
      1. Distributed systems organizing principles
        Organizing principles for web applications

Recommendations

An Empirical Analysis on Memcached's Replacement Policies
MEMSYS '23: Proceedings of the International Symposium on Memory Systems

The performance of large-scale web services heavily relies on the hit ratio of the key-value caches. One core component of a high-performance key-value cache is the replacement policy. A right replacement policy can help the caching system achieve a ...
Larchant: persistence by reachability in distributed shared memory through garbage collection
ICDCS '96: Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)

We consider a shared store based on distributed shared memory (DSM) supporting persistence by reachability (PBR) a very simple data sharing model for a distributed system. This DSM+PBR model is based on distributed garbage collection (GC). Within a ...
Using Memcached to Promote Read Throughput in Massive Small-File Storage System
GCC '10: Proceedings of the 2010 Ninth International Conference on Grid and Cloud Computing

Because of the bottleneck of disk I/O, the distributed file system based on disk is limited in the performance on data throughput and latency. It is a big challenge for such a system to meet the high performance requirement of the massive small-file ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICONS '08: Proceedings of the Third International Conference on Systems

April 2008

388 pages

ISBN:9780769531052

Publisher

IEEE Computer Society

United States

Publication History

Published: 13 April 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Xu HLi AWheatman BMarneni MPandey P(2023)BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-TreesProceedings of the VLDB Endowment10.14778/3611479.361150216:11(2976-2989)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611502
Tan JZhang TLi FChen JZheng QZhang PQiao HShi YCao WZhang R(2019)iBTuneProceedings of the VLDB Endowment10.14778/3339490.333950312:10(1221-1234)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.14778/3339490.3339503
Zhang JLi QZhou W(2016)HDCacheJournal of Grid Computing10.1007/s10723-015-9360-914:3(407-428)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1007/s10723-015-9360-9
Lin PBi JHu HLee DTouch JFdida S(2012)ASICProceedings of the 7th International Conference on Future Internet Technologies10.1145/2377310.2377317(21-26)Online publication date: 11-Sep-2012
https://dl.acm.org/doi/10.1145/2377310.2377317
Atikoglu BXu YFrachtenberg EJiang SPaleczny M(2012)Workload analysis of a large-scale key-value storeACM SIGMETRICS Performance Evaluation Review10.1145/2318857.225476640:1(53-64)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1145/2318857.2254766
Atikoglu BXu YFrachtenberg EJiang SPaleczny MHarrison PArlitt MCasale G(2012)Workload analysis of a large-scale key-value storeProceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems10.1145/2254756.2254766(53-64)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1145/2254756.2254766
Zhang JWu GHu XWu X(2012)A Distributed Cache for Hadoop Distributed File System in Real-Time Cloud ServicesProceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing10.1109/Grid.2012.17(12-21)Online publication date: 20-Sep-2012
https://dl.acm.org/doi/10.1109/Grid.2012.17
Patibandla RKurra SMundukur N(2012)A study on scalability of services and privacy issues in cloud computingProceedings of the 8th international conference on Distributed Computing and Internet Technology10.1007/978-3-642-28073-3_19(212-230)Online publication date: 2-Feb-2012
https://dl.acm.org/doi/10.1007/978-3-642-28073-3_19
Vaquero LRodero-Merino LBuyya R(2011)Dynamically scaling applications in the cloudACM SIGCOMM Computer Communication Review10.1145/1925861.192586941:1(45-52)Online publication date: 22-Jan-2011
https://dl.acm.org/doi/10.1145/1925861.1925869

Abstract

Cited By

Index Terms

Recommendations

An Empirical Analysis on Memcached's Replacement Policies

Larchant: persistence by reachability in distributed shared memory through garbage collection

Using Memcached to Promote Read Throughput in Massive Small-File Storage System

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations