# limits

Published articles for limits.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## How Marathon Incidents Expose Organizational Fragility and Require Structured Incident Response

DevFeed: [How Marathon Incidents Expose Organizational Fragility and Require Structured Incident Response](<https://devfeed.tech/articles/presentation-when-incidents-refuse-to-end-41300.md>)

Original publisher: [Read original article](<https://www.infoq.com/presentations/stream-incidents/>)

Author: Vanessa Huerta Granda

Published: 2026-09-17T09:30:00Z

Content type: article

Language: en

Sources: [InfoQ](<https://devfeed.tech/sources/infoq.md>)

Topics: [incident](<https://devfeed.tech/topics/incident.md>), [Incident response](<https://devfeed.tech/topics/incident-response.md>)

Tags: [devops](<https://devfeed.tech/tags/devops.md>), [incident](<https://devfeed.tech/tags/incident.md>), [incident-response](<https://devfeed.tech/tags/incident-response.md>), [infoq](<https://devfeed.tech/tags/infoq.md>), [limits](<https://devfeed.tech/tags/limits.md>), [organizational](<https://devfeed.tech/tags/organizational.md>), [outages](<https://devfeed.tech/tags/outages.md>), [presentation](<https://devfeed.tech/tags/presentation.md>), [qcon-san-francisco-2026](<https://devfeed.tech/tags/qcon-san-francisco-2026.md>), [qcon-software-development-conference](<https://devfeed.tech/tags/qcon-software-development-conference.md>), [real-world](<https://devfeed.tech/tags/real-world.md>), [stream-incidents](<https://devfeed.tech/tags/stream-incidents.md>), [structured](<https://devfeed.tech/tags/structured.md>), [system](<https://devfeed.tech/tags/system.md>), [transcripts](<https://devfeed.tech/tags/transcripts.md>)

### AI overview

Vanessa Huerta Granda discusses how prolonged incidents reveal gaps between planned work and work as performed. Drawing on real-world scenarios, the presentation examines organizational fragility, human limits, system interdependencies, and the need for structured, humane, cross-functional incident response.

### Source excerpt

Vanessa Huerta Granda explains how marathon incidents expose the gap between work as imagined and work as done. Drawing from real-world scenarios, she shares how complex outages reveal organizational fragility, human limits, and system interdependencies--and why incident response requires structured endurance, humane rotations, and holistic cross-functional coordination. By Vanessa Huerta Granda

## Rate limits on GitLab.com are changing

DevFeed: [Rate limits on GitLab.com are changing](<https://devfeed.tech/articles/rate-limits-on-gitlab-com-are-changing-41278.md>)

Original publisher: [Read original article](<https://about.gitlab.com/blog/rate-limit-change-2026/>)

Author: Sam Wiskow

Published: 2026-09-17T00:00:00Z

Content type: release

Language: en

Sources: [GitLab](<https://devfeed.tech/sources/gitlab.md>)

Topics: [GitLab](<https://devfeed.tech/topics/gitlab.md>), [Automation](<https://devfeed.tech/topics/automation.md>), [Users](<https://devfeed.tech/topics/users.md>), [account](<https://devfeed.tech/topics/account.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [automation](<https://devfeed.tech/tags/automation.md>), [credentials](<https://devfeed.tech/tags/credentials.md>), [gitlab](<https://devfeed.tech/tags/gitlab.md>), [limits](<https://devfeed.tech/tags/limits.md>), [platform](<https://devfeed.tech/tags/platform.md>), [product](<https://devfeed.tech/tags/product.md>), [user](<https://devfeed.tech/tags/user.md>), [users](<https://devfeed.tech/tags/users.md>)

### AI overview

GitLab.com will align rate limits with subscription tiers beginning October 19, 2026. Free accounts and unauthenticated requests change first, while Premium and Ultimate limits change in January 2027. Unauthenticated requests are limited to 60 requests per hour per IP address, with preview windows scheduled for October 7 and 14.

### Source excerpt

GitLab.com hosts millions of projects for teams of every size that need a platform they can rely on. Demand is climbing quickly, and we expect platform load to grow several times over this year. Predictable limits are what keep GitLab.com fast for everyone on it, including the automation and agent workloads teams are building on the platform. To hold that as we scale, we're updating how rate limits work. Starting October 19, 2026, rate limits on GitLab.com will align with your subscription tier. Free accounts and unauthenticated requests happen first, on October 19. Premium and Ultimate move in January 2027. What is changing Limits align with your subscription. Free, Premium, and Ultimate subscription plans get their own limits, applied per user and per top-level group. Free takes effect October 19; Premium and Ultimate in January 2027. Signing in gets you the full limit. An authenticated request is governed by your subscription plan below. A request that arrives with no credentials gets 60 requests per hour per IP address. The per-plan limits are published in the rate limits documentation. What happens on October 19 There will be two preview windows for Free and unauthenticated traffic, on October 7 and October 14 from 15:00 to 19:00 UTC. Signed-in Premium and Ultimate requests are not affected, since those limits do not change until January. Unauthenticated requests are capped no matter where they come from, including automation running against a paid account without credentials. A preview window (engineers call these brownouts) is a short, planned window where we switch the new limits on and then switch them back off. Nothing else about the service changes while it runs. The point is to give you a real look at how your own workloads behave under the new limits, weeks before they apply for good. On October 19 the new limits take effect. We set these limits by looking at how GitLab.com is actually used. Almost all users are already inside the new limits and won't n

## Making Python respect Docker memory limits

DevFeed: [Making Python respect Docker memory limits](<https://devfeed.tech/articles/making-python-respect-docker-memory-limits-37830.md>)

Original publisher: [Read original article](<https://carlosbecker.com/posts/python-docker-limits/>)

Author: Carlos Alexandro Becker

Published: 2020-11-20T00:00:00Z

Content type: tutorial

Language: en

Sources: [Carlos Becker](<https://devfeed.tech/sources/carlos-becker.md>)

Topics: [Docker](<https://devfeed.tech/topics/docker.md>), [Python](<https://devfeed.tech/topics/python.md>), [Linux](<https://devfeed.tech/topics/linux.md>), [Containers](<https://devfeed.tech/topics/containers.md>), [Processes](<https://devfeed.tech/topics/processes.md>)

Tags: [containers](<https://devfeed.tech/tags/containers.md>), [docker](<https://devfeed.tech/tags/docker.md>), [limits](<https://devfeed.tech/tags/limits.md>), [linux](<https://devfeed.tech/tags/linux.md>), [memory](<https://devfeed.tech/tags/memory.md>), [process](<https://devfeed.tech/tags/process.md>), [python](<https://devfeed.tech/tags/python.md>)

### AI overview

This article explains that Python running in Docker containers can see the host's available resources instead of the container's memory limit, potentially causing Linux's OOM killer to terminate the process. It presents a workaround that reads the limit and sets Python's maximum address space, then discusses testing, limitations, and Java's container support as a possible model.

### Source excerpt

If you run Python inside containers, chances are you have seen Linux's OOMKiller working at least a couple of times.

## 70% cheaper Kubernetes cluster on AWS

DevFeed: [70% cheaper Kubernetes cluster on AWS](<https://devfeed.tech/articles/70-cheaper-kubernetes-cluster-on-aws-37798.md>)

Original publisher: [Read original article](<https://carlosbecker.com/posts/k8s-sandbox-costs/>)

Author: Carlos Alexandro Becker

Published: 2017-04-28T00:00:00Z

Content type: tutorial

Language: en

Sources: [Carlos Becker](<https://devfeed.tech/sources/carlos-becker.md>)

Topics: [Kubernetes](<https://devfeed.tech/topics/kubernetes.md>), [Amazon Web Services](<https://devfeed.tech/topics/aws.md>), [nginx](<https://devfeed.tech/topics/nginx.md>), [Bash](<https://devfeed.tech/topics/bash.md>)

Tags: [aws](<https://devfeed.tech/tags/aws.md>), [bash](<https://devfeed.tech/tags/bash.md>), [clusters](<https://devfeed.tech/tags/clusters.md>), [deployments](<https://devfeed.tech/tags/deployments.md>), [ingress](<https://devfeed.tech/tags/ingress.md>), [kubernetes](<https://devfeed.tech/tags/kubernetes.md>), [limits](<https://devfeed.tech/tags/limits.md>), [nginx](<https://devfeed.tech/tags/nginx.md>), [production](<https://devfeed.tech/tags/production.md>), [sandbox](<https://devfeed.tech/tags/sandbox.md>)

### AI overview

This tutorial describes strategies for reducing the cost of a sandbox Kubernetes cluster on AWS by about 70%. It covers tuning pod resource requests and limits, routing services through one nginx Ingress load balancer, and scaling down idle deployments with a Bash script.

### Source excerpt

We are running Kubernetes on both sandbox and production for some months now. Our production cluster is still small, with few services running on it, but, most of our sandbox environment is running on a Kubernetes cluster on AWS.

## There are Infinitely Many Primes (Erdős)

DevFeed: [There are Infinitely Many Primes (Erdős)](<https://devfeed.tech/articles/there-are-infinitely-many-primes-erdos-40291.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2012/11/10/there-are-infinitely-many-primes-erdos/>)

Published: 2012-11-10T13:48:52Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [primes](<https://devfeed.tech/topics/primes.md>)

Tags: [limits](<https://devfeed.tech/tags/limits.md>), [lower-bounds](<https://devfeed.tech/tags/lower-bounds.md>), [number](<https://devfeed.tech/tags/number.md>), [primes](<https://devfeed.tech/tags/primes.md>), [product](<https://devfeed.tech/tags/product.md>), [square](<https://devfeed.tech/tags/square.md>)

### AI overview

A proof by Paul Erdős establishes that infinitely many primes exist by bounding the number of factorizations of integers as a square-free number times a square. This yields π(n) >= 1/2 log(n), which grows without bound.

### Source excerpt

Problem: Prove there are infinitely many primes Solution: Denote by $ \pi(n)$ the number of primes less than or equal to $ n$. We will give a lower bound on $ \pi(n)$ which increases without bound as $ n \to \infty$. Note that every number $ n$ can be factored as the product of a square free number $ r$ (a number which no square divides) and a square $ s^2$.

## Big-O Notation--A Primer

DevFeed: [Big-O Notation--A Primer](<https://devfeed.tech/articles/big-o-notation-a-primer-40201.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2011/06/14/big-o-notation-a-primer/>)

Published: 2011-06-14T16:26:27Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Algorithms, Complexity](<https://devfeed.tech/topics/algorithms-complexity.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [big-o-notation](<https://devfeed.tech/tags/big-o-notation.md>), [big-theta-notation](<https://devfeed.tech/tags/big-theta-notation.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [computational-complexity](<https://devfeed.tech/tags/computational-complexity.md>), [example](<https://devfeed.tech/tags/example.md>), [limits](<https://devfeed.tech/tags/limits.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [measurement](<https://devfeed.tech/tags/measurement.md>), [primer](<https://devfeed.tech/tags/primer.md>), [real-analysis](<https://devfeed.tech/tags/real-analysis.md>), [time](<https://devfeed.tech/tags/time.md>)

### AI overview

This primer introduces Big-O notation as a way to describe an algorithm's runtime growth. It defines the notation mathematically and illustrates it with a list-summing algorithm characterized as O(n), while also distinguishing Big-Theta notation.

### Source excerpt

The Quest to Capture Speed Companies and researchers spend hundreds of millions of dollars for the fruits of their algorithms. Whether one is indexing websites on the internet for search, folding proteins, or figuring out which warehouse is the most cost-effective to ship a product from, improvements in algorithm speed save immense amounts of money. It's no surprise then, that a similarly immense amount of money has gone into the mathematics behind algorithm analysis.

## Why businesses need a longer-term focus than quarterly goals

DevFeed: [Why businesses need a longer-term focus than quarterly goals](<https://devfeed.tech/articles/nearsighted-business-41040.md>)

Original publisher: [Read original article](<https://www.craigkerstiens.com/2008/06/05/Nearsighted-Business/>)

Author: Map

Published: 2008-06-06T01:26:27Z

Content type: opinion

Language: en

Sources: [Craig Kerstiens](<https://devfeed.tech/sources/craig-kerstiens.md>)

Topics: [Risk](<https://devfeed.tech/topics/risk.md>), [ibm](<https://devfeed.tech/topics/ibm.md>)

Tags: [business](<https://devfeed.tech/tags/business.md>), [ceo](<https://devfeed.tech/tags/ceo.md>), [company](<https://devfeed.tech/tags/company.md>), [employees](<https://devfeed.tech/tags/employees.md>), [focus](<https://devfeed.tech/tags/focus.md>), [growth](<https://devfeed.tech/tags/growth.md>), [hiring](<https://devfeed.tech/tags/hiring.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [limits](<https://devfeed.tech/tags/limits.md>), [risk](<https://devfeed.tech/tags/risk.md>)

### AI overview

The article argues that businesses often prioritize quarterly or yearly targets over long-term goals, leading to poorly timed hiring freezes and rushed recruitment. It contrasts this with smaller companies' more constrained spending decisions and questions whether private ownership enables a longer-term focus.

### Source excerpt

Adobe's former CEO, Bruce Chizen, when asked 'What advice do you have for new/young public companies?', gave a response of 'Go private'. While partially a joke he went on to elaborate something that many businesses seem to miss on. The main idea is that businesses are very nearsighted in their focus, they look at quarterly goals and in some cases yearly, but not where they want to be in 10 years. When companies become worried that head count is high they simply freeze hiring across the board without thinking of its ramifications. Good people, well great people are truly hard to find, and when a company enforces a blanket hiring freeze they miss out on those few great people that they truly need to grow. Meanwhile when they decide they have bandwidth for 1000 new employees they open the flood gates and let the first 1000 that can spell their name correctly in, because they can. This short term focus in the long run greatly limits the ability of what a company can achieve. In contrast a smaller company that is actually much more at risk of dying seems to have a better understanding of what their approach should be. While they may be understaffed and overworked, they firmly understand that they only have so many funds and therefore make wiser decisions when using them. The characteristics of the larger business and their short sighted focus leads to the cyclical performance that many experience over a few years, rather than a very steady growth they would like to maintain, and often leads to their end. A prime example would be IBM that laid off so many of their more talented people to lower their numbers years ago. As a result they lost their best workers and had many unexperienced individuals in there when they began hiring again. They are still working to catch back up to where they once were in the IT industry... In part I wonder if being a private entity is really the only way to have the long term focus and not worry about quarterly earnings. Personally I have never