similar to: how can I identify disconnect due to low <queue-size>

Displaying 20 results from an estimated 9000 matches similar to: "how can I identify disconnect due to low <queue-size>"

2005 Mar 05
4
how can I identify disconnect due to low <queue-size>
> On Sat, 2005-03-05 at 23:52, Mihail Egorov wrote: > > 1. How can I identify disconnect due to low <queue-size>. Suppose, I have > > enabled loglevel=4 (debug). Suppose, I have network jam. What shall I see at > > error.log? > > There is a log message that signifies the removal of a listener for > being too slow and that is > "Client has fallen too far
2005 Mar 05
1
how can I identify disconnect due to low <queue-size>
> > 2. Is it possible to mark reason of disconnect at standard access/error log > > at level 2 (warn)? > > not in the access.log. If you don't get the above message then it will > probably be because the listener closed the connection. The only other > ways are an explicit kill, via the admin interface, or a shutdown of the > source or server. > > > That is,
2005 Mar 05
0
how can I identify disconnect due to low <queue-size>
On Sat, 2005-03-05 at 23:52, Mihail Egorov wrote: > 1. How can I identify disconnect due to low <queue-size>. Suppose, I have > enabled loglevel=4 (debug). Suppose, I have network jam. What shall I see at > error.log? There is a log message that signifies the removal of a listener for being too slow and that is "Client has fallen too far behind, removing" It currently
2005 Feb 10
4
Could anybody kindly add statically linked icecast 2.2.0 download to www.icecast.org?
This is important to Debian users -- packets exists only for testing and unstable version of Debian Linux.
2005 Mar 07
1
how can I identify disconnect due to low
Hello Karl In your reply in this case you mentinoned: >> >> Check your TCP buffers sizes as well, a larger RTT (ping) will require a >> larger TCP window to maintain the same maximum bitrate. >> >> karl. We had troubles with the problem of "disconnecting when client has fallen too far behind" and we solved it temporarily by increasing the queue-size and
2005 Feb 09
2
relation between burst- and queue-size with low bitrate streams
Hi all, I have a question about the relationship between the "queue-size" and the "burst-size" <limits> parameters. Q: When a client connects is the burst-size immediately added to the queue-size? If this is the case then the slack for a 16kpbs client goes down from 50 sec (102400[queue-size] / 16kbps = 50 sec) to 18 seconds ( (102400 - 65536[burst-size]) / 16kpbs =
2011 Feb 23
5
Routing problem
In my app i have word model, words_controller and want create new action for word model. I create new method ''test'' in words_controller, and adds: resources :words do member do put ''test'' end end in routes.rb my rake routes output: test_word PUT /words/:id/test(.:format) {:action=>"test", :controller=>"words"}
2004 Nov 27
3
Prevent client disconnecting fallen-too-far-behind
Hello, Does anybody know how I can configure icecast so it doesn't disconnect a client which "has fallen too far behind". We are using icecast2.01 streaming software for our church home-listening system. Our client we use a netgem-netbox. We are streaming 25kbps MP3 on V90-56kbps modem connection After around 45 minutes after starting the cleint the icecast error.log reports:
2016 Feb 24
1
Publication : CERE LLVM Based Codelet Extractor and REplayer
Hello, We have published two papers which build upon the LLVM Compiler Infrastructure. Would it be possible to include them in the LLVM related publications at http://llvm.org/pubs/ ? I attach below the bibliographic references: "CERE: LLVM Based Codelet Extractor and REplayer for Piecewise Benchmarking and Optimization" P. de Oliveira Castro, C. Akel, E. Petit, M. Popov, and W.
2017 Nov 28
2
Publication LLVM Related Publications Submission
Hello, I would like to submit two papers that use LLVM to the Related Publications section. Both papers focus on code isolation applied to perform piecewise compiler optimizations. The code isolation process is performed by CERE, an open source tool based on LLVM. The second paper is an extended version of the first one. 1) Piecewise Holistic Autotuning of Compiler and Runtime Parameters
2011 Feb 25
2
problem with tunnels
I use ssh tunnels extensively. recently I upgraded my linux kernel from 2.6.18 to 2.6.37 and a problem with tunnels has resulted. prior to the upgrade use of ssh tunN devices was rock solid. the problem manifests as the tunnel from the initiator end ceasing to transfer data to the remote after a quantity of data is sent. it is necessary to create a new tunnel after destroying the old to get
2019 Apr 25
2
How to use the pass 'Unroll and Jam'
Dear LLVM developers, Recently I want to try the pass '-loop-unroll-and-jam' to observe how the IR is transformed, but I don't see the IR changed after doing the following steps. Here are the details for preparing my experiment and I have tried the LLVM 6, 7 and 8: 1) Simple 2D array source code (loop.c) is given ``` #define M 32768 #define N 32768 double a[M][N], b[M][N],
2018 Jan 30
0
Publication LLVM Related Publications Submission
Dear Mihail, I've added these two publications to the publications page. Please review it and let me know if I need to make any changes. In particular, if you have URLs to use for the papers, having those would be greatly appreciated. Regards, John Criswell On 11/28/17 12:05 PM, Mihail Popov via llvm-dev wrote: > > Hello, > > I would like to submit two papers that use LLVM
2013 Dec 10
3
[LLVMdev] Summary of TableNextGen BOF
Hello everyone. I apologise for the sizeable delay in sending this. The BoF was attended by quite a lot of people and there was general agreement that tablegen needs improvement in some shape of form. However there are many divergent ideas as to how to go about this improvement. Of course this is completely natural, tablegen being a versatile tool used by many different people for many different
2020 Jan 02
3
[RFC] Changing LoopUnrollAndJamPass to a function pass.
<div class="socmaildefaultfont" dir="ltr" style="font-family:Arial, Helvetica, sans-serif;font-size:10pt" ><div dir="ltr" ><font face="AppleSystemUIFont" size="3" >LoopUnrollAndJamPass is currently a loop pass. It is added in a LPM with only itself.</font><br><font face="AppleSystemUIFont"
2004 Apr 05
1
rect.hclust fails when k is specified (PR#6740)
Full_Name: Ivan Egorov Version: 1.8.1 OS: MS Windows 2000, SP4 Submission from: (NULL) (194.186.91.129) V<-t(matrix(scan('C:/V3.dat'),3)) d<-dist(V) hc<-hclust(d) rect.hclust(hc,5) Error message is displayed: Read 24 items Error in rect(m[which[n]] + 0.66, par("usr")[3], m[which[n] + 1] + 0.33, : plot.new has not been called yet Here's my data file
2005 Feb 18
14
autotoolizing xen?
Hi there! I was wondering what the general opinion on autotoolizing xen is? I am volunteering to do so, if there is interest in updating the build system to use autoconf, automake and/or libtool. Is one configure script for all of xen enough or do you want to be able to configure all/some tools separately? I know that Anthony is no fan of libtool... are there more reservations about some
2018 Aug 09
3
Legacy Loop Pass Manager question
Hi, If we add multiple loop passes to the pass manager in PassManagerBuilder.cpp consecutively without any func/module pass in between, I used to think they would belong to the same loop pass manager. But it does not seem to be the case. For example for this code snippet PM.add(createIndVarSimplifyPass()); // Canonicalize indvars MPM.add(createLoopIdiomPass()); //
2005 Jul 22
3
pop3 authentication failure - password mismatch
I tried to run dovecot 1.0 built by myself but encountered the above problem. See the error traces below. First of all, the password and user are correct, as it worked with the 0.99 rpm version of dovecot. I also hand verified with ssh. I also attached the dovecot config file below. Any ideas? Jun fetchmail output on client: ------------------------------------- fetchmail: POP3< +OK
2020 May 26
3
Loop Unroll
Awesome, thanks! Now I have another question. I have a matrix multiplication code. This is my code: #include <stdio.h> #include <stdlib.h> #define n 4 int main(int argc, char *argv[]) { int i, j, k; int A[n][n], B[n][n], C[n][n]; for(i=0;i<n;i++){ for(j=0;j<n;j++){ A[i][j] = 1; B[i][j] = 2; C[i][j] = 0; } }