Skip to main content

High Availability Percentage Calculation



Availability %
Downtime per year
Downtime per month
Downtime per week
Downtime per day
90% ("one nine")
36.5 days
72 hours
16.8 hours
2.4 hours
95% ("one and a half nines")
18.25 days
36 hours
8.4 hours
1.2 hours
97%
10.96 days
21.6 hours
5.04 hours
43.2 minutes
98%
7.30 days
14.4 hours
3.36 hours
28.8 minutes
99% ("two nines")
3.65 days
7.20 hours
1.68 hours
14.4 minutes
99.5% ("two and a half nines")
1.83 days
3.60 hours
50.4 minutes
7.2 minutes
99.80%
17.52 hours
86.23 minutes
20.16 minutes
2.88 minutes
99.9% ("three nines")
8.76 hours
43.8 minutes
10.1 minutes
1.44 minutes
99.95% ("three and a half nines")
4.38 hours
21.56 minutes
5.04 minutes
43.2 seconds
99.99% ("four nines")
52.56 minutes
4.38 minutes
1.01 minutes
8.64 seconds
99.995% ("four and a half nines")
26.28 minutes
2.16 minutes
30.24 seconds
4.32 seconds
99.999% ("five nines")
5.26 minutes
25.9 seconds
6.05 seconds
864.3 milliseconds
99.9999% ("six nines")
31.5 seconds
2.59 seconds
604.8 milliseconds
86.4 milliseconds
99.99999% ("seven nines")
3.15 seconds
262.97 milliseconds
60.48 milliseconds
8.64 milliseconds
99.999999% ("eight nines")
315.569 milliseconds
26.297 milliseconds
6.048 milliseconds
0.864 milliseconds
99.9999999% ("nine nines")
31.5569 milliseconds
2.6297 milliseconds
0.6048 milliseconds
0.0864 milliseconds

Comments

Popular posts from this blog

What is the difference between Elastic and Enterprise Redis w.r.t "Hybrid Query" capabilities

  We'll explore scenarios involving nested queries, aggregations, custom scoring, and hybrid queries that combine multiple search criteria. 1. Nested Queries ElasticSearch Example: ElasticSearch supports nested documents, which allows for querying on nested fields with complex conditions. Query: Find products where the product has a review with a rating of 5 and the review text contains "excellent". { "query": { "nested": { "path": "reviews", "query": { "bool": { "must": [ { "match": { "reviews.rating": 5 } }, { "match": { "reviews.text": "excellent" } } ] } } } } } Redis Limitation: Redis does not support nested documents natively. While you can store nested structures in JSON documents using the RedisJSON module, querying these nested structures with complex condi...

Training LLM model requires more GPU RAM than storing same LLM

Storing an LLM model and training the same model both require memory, but the memory requirements for training are typically higher than just storing the model. Let's dive into the details: Memory Requirement for Storing the Model: When you store an LLM model, you need to save the weights of the model parameters. Each parameter is typically represented by a 32-bit float (4 bytes). The memory requirement for storing the model weights is calculated by multiplying the number of parameters by 4 bytes. For example, if you have a model with 1 billion parameters, the memory requirement for storing the model weights alone would be 4 GB (4 bytes * 1 billion parameters). Memory Requirement for Training: During the training process, additional components use GPU memory in addition to the model weights. These components include optimizer states, gradients, activations, and temporary variables needed by the training process. These components can require additional memory beyond just storing th...

How are vector databases used?

  Vector Databases Usage: Typically used for vector search use cases such as visual, semantic, and multimodal search. More recently, they are paired with generative AI text models for conversational search experiences. Development Process: Begins with building an embedding model designed to encode a corpus (e.g., product images) into vectors. The data import process is referred to as data hydration. Application Development: Application developers utilize the database to search for similar products. This involves encoding a product image and using the vector to query for similar images. k-Nearest Neighbor (k-NN) Indexes: Within the model, k-nearest neighbor (k-NN) indexes facilitate efficient retrieval of vectors. A distance function like cosine is applied to rank results by similarity.