Knowledge (XXG)

Talk:ZeroMQ

Source 📝

129: 73: 49: 161: 22: 246:
As an aside what a great improvement 0MQ is over MQ generally! I once was given the great general advice: "MIddleware? Just say no!". 0MQ does a great job while avoiding some of the overly complex MQ implementations I have seen, where the implementation of the MQ and MQ-similar middleware often
211:"Utilizing a message batching technique, ØMQ can outperform raw TCP in terms of throughput" is a polemic claim made by the ØMQ developers, but it is (deliberately) misleading. Since TCP is (for the most time) the underlying transport, ØMQ does not and cannot "outperform" TCP in any way. 263:
I've reworded that claim to be more accurate. I'm not sure if sending messages individually is "very naive"; opportunistic batching is very hard to do right, so typical apps (and frameworks) do not do it. Which is why 0MQ seems faster than "typical TCP apps".
225:
sending individual small messages over a TCP_NODELAY socket by batching several messages into a batch opportunistically. It does, on the other hand, not incur the latency of a TCP socket with Nagle's algorithm enabled, as there is no fixed timeout.
326:)? I looked for it under the letter Z and in the number (zero) 0, but amazingly found it under the letter O, which, I guess at least *appears* in the word, but not in the traditional first letter position. This seems to violate 288: 218:
does is send any number of messages that are in the buffer at the time the socket becomes ready in one batch. This is basically a "opportunistic, lucky chance Nagle's algorithm" without a timeout.
363: 388: 373: 358: 113: 119: 292: 368: 89: 353: 179: 138: 59: 171: 80: 54: 378: 29: 383: 195: 299:
more eleberated description of the common patterns, which are described in the 'Technology' section, would be helpful
175: 35: 335: 331: 88:
on Knowledge (XXG). If you would like to participate, please visit the project page, where you can join
308: 265: 185: 284: 323: 269: 189: 252: 235: 230:
Your point is correct and must be addressed but your suggestion does not seem more concise!
327: 304: 347: 221:
A more concise wording would be: ØMQ can maintain low latency while outperforming a
128: 248: 231: 72: 48: 247:
complicated rather than simplified the message queue problem being addressed.
170:
to the subject of this article. Relevant policies and guidelines may include
85: 168:
contributor has declared a personal or professional connection
155: 15: 324:
https://en.wikipedia.org/Category:Message-oriented_middleware
339: 312: 273: 256: 239: 127: 28:
This article has not yet been rated on Knowledge (XXG)'s
328:
https://en.wikipedia.org/Principle_of_least_astonishment
84:, a collaborative effort to improve the coverage of 364:Unassessed software articles of Unknown-importance 118:This article has not yet received a rating on the 207:ØMQ can outperform raw TCP in terms of throughput 322:Why is this sorting under the letter O (e.g. in 280:Reader feedback: more eleberated description ... 8: 198:) This user has contributed to the article. 43: 21: 19: 389:Articles edited by connected contributors 45: 374:Unknown-importance Computing articles 7: 359:Unknown-importance software articles 98:Knowledge (XXG):WikiProject Software 78:This article is within the scope of 34:It is of interest to the following 14: 303:I guess it should be pictures. -- 159: 71: 47: 20: 166:The following Knowledge (XXG) 1: 369:Unassessed Computing articles 136:This article is supported by 101:Template:WikiProject Software 92:and see a list of open tasks. 354:Unassessed software articles 340:01:33, 24 October 2023 (UTC) 313:01:21, 6 October 2013 (UTC) 405: 120:project's importance scale 274:12:14, 14 June 2013 (UTC) 223:very naive implementation 135: 117: 66: 42: 257:17:54, 7 May 2013 (UTC) 240:17:54, 7 May 2013 (UTC) 379:All Computing articles 301: 132: 384:All Software articles 297: 180:neutral point of view 139:WikiProject Computing 131: 172:conflict of interest 81:WikiProject Software 291:on 7 August 2013 ( 133: 30:content assessment 293:view all feedback 204: 203: 154: 153: 150: 149: 146: 145: 104:software articles 396: 163: 162: 156: 106: 105: 102: 99: 96: 75: 68: 67: 62: 51: 44: 25: 24: 23: 16: 404: 403: 399: 398: 397: 395: 394: 393: 344: 343: 320: 282: 266:Pieter Hintjens 209: 160: 103: 100: 97: 94: 93: 57: 12: 11: 5: 402: 400: 392: 391: 386: 381: 376: 371: 366: 361: 356: 346: 345: 319: 318:Sorting order? 316: 281: 278: 277: 276: 260: 259: 249:Paul Beardsell 243: 242: 232:Paul Beardsell 208: 205: 202: 201: 200: 199: 164: 152: 151: 148: 147: 144: 143: 134: 124: 123: 116: 110: 109: 107: 90:the discussion 76: 64: 63: 52: 40: 39: 33: 26: 13: 10: 9: 6: 4: 3: 2: 401: 390: 387: 385: 382: 380: 377: 375: 372: 370: 367: 365: 362: 360: 357: 355: 352: 351: 349: 342: 341: 337: 333: 332:RussellSenior 329: 325: 317: 315: 314: 310: 306: 300: 296: 294: 290: 286: 279: 275: 271: 267: 262: 261: 258: 254: 250: 245: 244: 241: 237: 233: 229: 228: 227: 224: 219: 217: 212: 206: 197: 194: 191: 187: 184: 183: 181: 177: 176:autobiography 173: 169: 165: 158: 157: 141: 140: 130: 126: 125: 121: 115: 112: 111: 108: 91: 87: 83: 82: 77: 74: 70: 69: 65: 61: 56: 53: 50: 46: 41: 37: 31: 27: 18: 17: 321: 302: 298: 289:this comment 283: 222: 220: 215: 213: 210: 192: 167: 137: 79: 36:WikiProjects 348:Categories 330:. Thanks. 305:4th-otaku 214:What ØMQ 60:Computing 196:contribs 95:Software 86:software 55:Software 287:posted 186:Pieterh 285:Uwydoc 216:really 178:, and 32:scale. 336:talk 309:talk 270:talk 253:talk 236:talk 190:talk 295:). 182:. 114:??? 350:: 338:) 311:) 272:) 255:) 238:) 174:, 58:: 334:( 307:( 268:( 251:( 234:( 193:· 188:( 142:. 122:. 38::

Index

content assessment
WikiProjects
WikiProject icon
Software
Computing
WikiProject icon
WikiProject Software
software
the discussion
???
project's importance scale
Taskforce icon
WikiProject Computing
conflict of interest
autobiography
neutral point of view
Pieterh
talk
contribs
Paul Beardsell
talk
17:54, 7 May 2013 (UTC)
Paul Beardsell
talk
17:54, 7 May 2013 (UTC)
Pieter Hintjens
talk
12:14, 14 June 2013 (UTC)
Uwydoc
this comment

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.