83:, tracking down bottlenecks (sometimes known as "hot spots" - sections of the code that execute most frequently - i.e. have the highest execution count) is called performance analysis. Reduction is usually achieved with the help of specialized tools, known as performance analyzers or
53:
and provides the lowest throughput. Bottlenecks are usually avoided by system designers, also a great amount of effort is directed at locating and tuning them. Bottleneck may be for example a
132:) and of all the flows sharing this link, the given data flow achieves maximum data rate network-wide. Note that this definition is substantially different from a common meaning of a
17:
42:
is a phenomenon by which the performance or capacity of an entire system is severely limited by a single component. The component is sometimes called a
46:. The term is metaphorically derived from the neck of a bottle, where the flow speed of the liquid is limited by its neck.
121:
data flows. To put it another way, in case of network congestion any data flow is only impacted by smaller or equal flows.
139:
A data rate allocation is max-min fair if and only if a data flow between any two nodes has at least one bottleneck link.
170:
160:
87:. The objective being to make those particular sections of code perform as fast as possible to improve overall
199:
217:
200:
Jean-Yves Le Boudec (EPFL Lausanne) "Rate adaptation, Congestion
Control and Fairness: A Tutorial" Nov 2005
84:
28:
136:. Also note, that this definition does not forbid a single link to be a bottleneck for multiple flows.
117:
policy. With max-min fairness, data flow between any two nodes is maximized, but only at the cost of
20:
This graphic shows the bottleneck that can arise between the CPU, memory controller, and peripherals.
165:
114:
88:
180:
106:
74:
100:
80:
50:
8:
58:
153:
148:
110:
175:
211:
35:
62:
16:
128:
for a given data flow is a link that is fully utilized (is
54:
113:
of the network is desired, usually opposed to the basic
94:
209:
68:
49:Formally, a bottleneck lies on a system's
15:
210:
13:
14:
229:
171:Profiling (computer programming)
161:Optimization (computer science)
95:Bottlenecks in max-min fairness
193:
1:
186:
7:
142:
29:Bottleneck (disambiguation)
10:
234:
98:
72:
26:
119:more or equally expensive
24:Phenomenon in engineering
166:Performance engineering
115:first-come first-served
69:Bottlenecks in software
89:algorithmic efficiency
21:
181:Theory of constraints
107:communication network
75:Bottleneck (software)
19:
101:Bottleneck (network)
81:computer programming
61:, a data processing
27:For other uses, see
218:Network performance
124:In such context, a
59:communication link
22:
225:
202:
197:
154:Max-min fairness
149:Fairness measure
111:max-min fairness
44:bottleneck point
233:
232:
228:
227:
226:
224:
223:
222:
208:
207:
206:
205:
198:
194:
189:
145:
126:bottleneck link
103:
97:
77:
71:
32:
25:
12:
11:
5:
231:
221:
220:
204:
203:
191:
190:
188:
185:
184:
183:
178:
176:Route capacity
173:
168:
163:
158:
157:
156:
144:
141:
109:, sometimes a
99:Main article:
96:
93:
73:Main article:
70:
67:
23:
9:
6:
4:
3:
2:
230:
219:
216:
215:
213:
201:
196:
192:
182:
179:
177:
174:
172:
169:
167:
164:
162:
159:
155:
152:
151:
150:
147:
146:
140:
137:
135:
131:
127:
122:
120:
116:
112:
108:
102:
92:
90:
86:
82:
76:
66:
64:
60:
56:
52:
51:critical path
47:
45:
41:
37:
30:
18:
195:
138:
133:
129:
125:
123:
118:
104:
78:
48:
43:
39:
33:
36:engineering
187:References
134:bottleneck
40:bottleneck
130:saturated
85:profilers
55:processor
212:Category
143:See also
63:software
65:, etc.
105:In a
57:, a
38:, a
79:In
34:In
214::
91:.
31:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
