Skip to main content

Memcached stat items explained

This is a really useful post, which gathers the explanation of every items in memcached stat result.

The full post is available at Memcached statistics (stats command)

The explanation is as followed:

Field Sample value Description
accepting_conns 1 The Memcached server is currently accepting new connections.
auth_cmds 0 Number of authentication commands processed by the server – if you use authentication within your installation. The default is IP (routing) level security which speeds up the actual Memcached usage by removing the authentication requirement.
auth_errors 0 Number of failed authentication tries of clients.
bytes 6775829 Number of bytes currently used for caching items, this server currently uses ~6 MB of it’s maximum allowed (limit_maxbytes) 1 GB cache size.
bytes_read 880545081 Total number of bytes received from the network by this server.
bytes_written 3607442137 Total number of bytes send to the network by this server.
cas_badval 0 The “cas” command is some kind of Memcached’s way to avoid locking. “cas” calls with bad identifier are counted in this stats key.
cas_hits 0 Number of successful “cas” commands.
cas_misses 0 “cas” calls fail if the value has been changed since it was requested from the cache. We’re currently not using “cas” at all, so all three cas values are zero.
cmd_flush 0 The “flush_all” command clears the whole cache and shouldn’t be used during normal operation.
cmd_get 1626823 Number of “get” commands received since server startup not counting if they were successful or not.
cmd_set 2279784 Number of “set” commands serviced since startup.
connection_structures 42 Number of internal connection handles currently held by the server. May be used as some kind of “maximum parallel connection count” but the server may destroy connection structures (don’t know if he ever does) or prepare some without having actual connections for them (also don’t know if he does). 42 maximum connections and 34 current connections (curr_connections) sounds reasonable, the live servers also have about 10% more connection_structures than curr_connections.
conn_yields 1 Memcached has a configurable maximum number of requests per event (-R command line argument), this counter shows the number of times any client hit this limit.
curr_connections 34 Number of open connections to this Memcached server, should be the same value on all servers during normal operation. This is something like the count of mySQL’s “SHOW PROCESSLIST” result rows.
curr_items 30345 Number of items currently in this server’s cache. The production system of this development environment holds more than 8 million items.
decr_hits 0 The “decr” command decreases a stored (integer) value by 1. A “hit” is a “decr” call to an existing key.
decr_misses 0 “decr” command calls to undefined keys.
delete_hits 138707 Stored keys may be deleted using the “delete” command, this system doesn’t delete cached data itself, but it’s using the Memcached to avoid recaching-races and the race keys are deleted once the race is over and fresh content has been cached.
delete_misses 107095 Number of “delete” commands for keys not existing within the cache. These 107k failed deletes are deletions of non existent race keys (see above).
evictions 0 Number of objects removed from the cache to free up memory for new items because Memcached reached it’s maximum memory setting (limit_maxbytes).
get_hits 391283 Number of successful “get” commands (cache hits) since startup, divide them by the “cmd_get” value to get the cache hitrate: This server was able to serve 24% of it’s get requests from the cache, the live servers of this installation usually have more than 98% hits.
get_misses 1235540 Number of failed “get” requests because nothing was cached for this key or the cached value was too old.
incr_hits 0 Number of successful “incr” commands processed. “incr” is a replace adding 1 to the stored value and failing if no value is stored. This specific installation (currently) doesn’t use incr/decr commands, so all their values are zero.
incr_misses 0 Number of failed “incr” commands (see incr_hits).
limit_maxbytes 1073741824 Maximum configured cache size (set on the command line while starting the memcached server), look at the “bytes” value for the actual usage.
listen_disabled_num 0 Number of denied connection attempts because memcached reached it’s configured connection limit (“-c” command line argument).
pid 24040 Current process ID of the Memcached task.
pointer_size 64 Number of bits of the hostsystem, may show “32″ instead of “64″ if the running Memcached binary was compiled for 32 bit environments and is running on a 64 bit system.
reclaimed 14740 Numer of times a write command to the cached used memory from another expired key. These are not storage operations deleting old items due to a full cache.
rusage_system 310.030000 Number of system time seconds for this server process.
rusage_user 103.230000 Numer of user time seconds for this server process.
threads 4 Number of threads used by the current Memcached server process.
time 1323008181 Current unix timestamp of the Memcached’s server.
total_connections 27384 Numer of successful connect attempts to this server since it has been started. Roughly $number_of_connections_per_task * $number_of_webserver_tasks * $number_of_webserver_restarts.
total_items 323615 Numer of items stored ever stored on this server. This is no “maximum item count” value but a counted increased by every new item stored in the cache.
uptime 1145873 Numer of seconds the Memcached server has been running since last restart.1145873 / (60 * 60 * 24) = ~13 days since this server has been restarted
version 1.4.5 Version number of the server

Labels:

Comments

Post a Comment

Popular posts from this blog

A simple implementation of DTW(Dynamic Time Warping) in C#/python

DTW(Dynamic Time Warping) is a very useful tools for time series analysis. This is a very simple (but not very efficient) c# implementation of DTW, the source code is available at  https://gist.github.com/1966342  . Use the program as below: double[] x = {9,3,1,5,1,2,0,1,0,2,2,8,1,7,0,6,4,4,5}; double[] y = {1,0,5,5,0,1,0,1,0,3,3,2,8,1,0,6,4,4,5}; SimpleDTW dtw = new SimpleDTW(x,y); dtw.calculateDTW(); The python implementation is available at  https://gist.github.com/3265694  . from python-dtw import Dtw import math dtw = Dtw([1, 2, 3, 4, 6], [1, 2, 3, 5],           distance_func=lambda x, y: math.fabs(x - y)) print dtw.calculate() #calculate the distance print dtw.get_path() #calculate the mapping path
14 comments
Read more

Change the default user when start a docker container

When run(start) a docker container from an image, we can specify the default user by passing -u option in command line(In https://docs.docker.com/engine/reference/run/#user ). For example docker run -i -t -u ubuntu ubuntu:latest /bin/bash We can also use the USER instruction in DOCKERFILE to do the same thing(In https://docs.docker.com/engine/reference/builder/#user), note that the option in command line will override the one in the DOCKERFILE. And there is actually another way to start a container with neither DOCKERFILE nor -u option, just by a command like: docker run -i -t ubuntu:latest /bin/bash # with ubuntu as the default user This happens when your start the container from an image committed by a container with ubuntu as the default user. Or in detail: Run a container from some basic images, create ubuntu user inside it, commit the container to CUSTOM_IMAGE:1 . Run a container from CUSTOM_IMAGE:1 with "-u ubuntu" option, and commit the container to CUSTOM...
Post a Comment
Read more

Notes on Sequential Pattern Mining (2) -- Partial Order Pattern Mining and Contrast Mining

1. In , the authors induce TEIRESIAS algorithms to mining combinatorial patterns with gap constraints in biological sequences. The patterns TEIRESIAS mined is similiar with the common sequential patterns, but it could contain "." the wild card which is also in the alphbel of the sequences database standing for any other item available, for example pattern "A..B" is a length-4 pattern, with two arbitrary items between the first A and the last B. Patterns "AC.B", "AADB" are all said to be more specific than pattern "A..B". TEIRESIAS mining all the maximal patterns () with a support over a min threshold K. There some key points of TEIRESIAS algorithms: 1)The growth of the patterns The growth of the patterns is accomplished by convolute current pattern by a short length pattern. Pattern A and pattern B are convolutable if the last L(very small) characters of pattern A is the same as the first L characters of pattern B, then ...
Post a Comment
Read more