Thus spake Matthew Dillon [EMAIL PROTECTED]:
Generally speaking I don't think you have to go into this level of
detail to figure out approximate real memory use. Just look at the
output of the /proc/PID/map and pull out the 'default' or 'swap'
lines. Ignore the 'vnode' lines.
Audsin wrote:
I wish to change the Maximum segment size
of the TCP. Can you please help me , where i should change the MSS of the
TCP. Can you tell me where the default size of the MSS mentioned?
$ sysctl -a | grep mss
net.inet.tcp.mssdflt: 512
net.inet.tcp.v6mssdflt: 1024
Ex:
$ sysctl -w
Hi hackers,
I implement a Kerberos in my company. For the purpose I use MIT Kerberos v5,
OpenSSH v3.4p1 and approriate GSSAPI patches for OpenSSH from
http://www.sxw.org.uk/computing/patches/openssh.html .
Kerbelized sshd works fine and uses Kerberos tickets for
Hi all,
I've recently acquired a motherboard with a VIA Rhine III onboard NIC.
I couldn't see support for this in the current vr(4) driver in either
-current or -stable and am trying to add support for it. Having not
done any kernel hacking before I'd appreciate some pointers if someone
would be
Nicolas Mallet wrote:
Audsin wrote:
I wish to change the Maximum segment size
of the TCP. Can you please help me , where i should change the MSS of the
TCP. Can you tell me where the default size of the MSS mentioned?
$ sysctl -a | grep mss
net.inet.tcp.mssdflt: 512
phk == phk [EMAIL PROTECTED] writes:
phk NBD wouldn't be hard to implement on FreeBSD, the easiest way
phk would be to write two GEOM modules to do it: a client and a
phk server.
phk No, I don't have time to do that right now, but I will happily
phk guide anybody who wants to try.
I would be
In message [EMAIL PROTECTED], David Gilbert writes:
phk == phk [EMAIL PROTECTED] writes:
phk NBD wouldn't be hard to implement on FreeBSD, the easiest way
phk would be to write two GEOM modules to do it: a client and a
phk server.
phk No, I don't have time to do that right now, but I will
I haven't been following this thread too closely, but I was hoping you could
clarify something for me. For what does GEOM mean/stand?
Thanks for the clarification,
Mike
Quoting [EMAIL PROTECTED]:
In message [EMAIL PROTECTED], David Gilbert
writes:
phk == phk [EMAIL PROTECTED] writes:
Terry Lambert [EMAIL PROTECTED] wrote:
Audsin wrote:
I am Dev, doing my research in Centre for Telecommunications Research,
King's college London. My research project involves evaluating the
performance of MIP6 TCP in the presence of fragmentation and without
fragmentation. I am using
In message [EMAIL PROTECTED], [EMAIL PROTECTED] wri
tes:
I haven't been following this thread too closely, but I was hoping you could
clarify something for me. For what does GEOM mean/stand?
GEOM is basically our disk-I/O subsystem at this point.
--
Poul-Henning Kamp | UNIX since Zilog
You mailed me personally; you mailed the MIT Kerberos list; and
you cross-posted on (at least) two FreeBSD mailing lists, all at
approximately the same time.
Please don't do that: it is rude. At least wait for replies in one
area before launching into another.
Cheers,
--
Jacques A. Vidrine
On Thu, 30 Jan 2003, Greg Lewis wrote:
Hi all,
I've recently acquired a motherboard with a VIA Rhine III onboard NIC.
I couldn't see support for this in the current vr(4) driver in either
-current or -stable and am trying to add support for it. Having not
done any kernel hacking before
Matthew Dillon [EMAIL PROTECTED] writes:
You can also theoretically push into shadow VM objects to locate
pages from the parent process that have not yet been COW'd into the
child (in the case of a fork()), noting also that these shadow objects
might be shared with other
:I think the original poster wanted to know the real memory use of
:a set of processes, taking sharing into account. I don't see how
:your approach could do that. Even if you knew the structure of
:the shadow chain, you would have to know specifically which pages
:had been COWed, no?
:
:I
I just had another idea on how you could do this. It's actually not
all that complex.
All you do is collect statistics on each VM object individually
(whether shadow or top level or whatever). e.g. Resident page count,
swap usage.
Then you collect a list of VM objects
Matthew Dillon [EMAIL PROTECTED] writes:
Then you simply group all the processes which share VM
objects together and report statistics on a group-by-group basis
rather then on a process-by-process basis. You won't know what an
individual process uses but you know exactly what
On Wed, 29 Jan 2003, Matthew N. Dodd wrote:
What you really want is SCSI over IP. Anything else is just a hack and
not to be trusted.
And iSCSI isn't?
I think that NFS is less of a hack than NBD though.
Of course if Linux still suffers from poor NFS performance that might
explain why
Well, here's a counterpoint. Lets say you have an FTP
server with 1G of ram full of, say, pirated CDs at 600MB a
pop.
Now lets say someone puts up a new madonna CD and suddenly
you have thousands of people from all over the world trying
to download a single 600MB file.
Daniel Ellard wrote:
man ifconfigcr
/mtucr
The original question asked about the TCP MSS, not the MTU. Looking
at ifconfig isn't going to help.
Actually, the original question is about how to cause the
creation of fragments, for the purposes of testing. The
MSS question is
In message [EMAIL PROTECTED], [EMAIL PROTECTED]
writes:
I haven't been following this thread too closely, but I was hoping you could
clarify something for me. For what does GEOM mean/stand?
GEOM is not an acronym, even though the last three letters are
uppercase, as they would be with an
On Thursday 30 January 2003 05:22 pm, Matthew Dillon wrote:
| Well, here's a counterpoint. Lets say you have an FTP
| server with 1G of ram full of, say, pirated CDs at 600MB a
| pop.
|
| Now lets say someone puts up a new madonna CD and suddenly
| you have thousands of
I partially missed the discussion, but why would anyone want to implement random
expiration, when there are better method to deal with issue. Including UBM which was
already imemented in FreeBSD 2.2.8.
(http://www.usenix.org/events/osdi2000/full_papers/kim/kim_html/)
To Unsubscribe: send
Matthew Dillon wrote:
Your idea of 'sequential' access cache restriction only
works if there is just one process doing the accessing.
Not necessarily. I suspect that there is
a strong tendency to access particular files
in particular ways. E.g., in your example of
a download server,
Thus spake Matthew Dillon [EMAIL PROTECTED]:
It's not possible to get a wholely accurate count no matter what
you do. For example, to truely know whether a process is using
a page you have to run through the process's page table (PMAP),
access the vm_page, then locate where in
:
:Thus spake Matthew Dillon [EMAIL PROTECTED]:
: It's not possible to get a wholely accurate count no matter what
: you do. For example, to truely know whether a process is using
: a page you have to run through the process's page table (PMAP),
: access the vm_page, then locate
:Not necessarily. I suspect that there is
:a strong tendency to access particular files
:in particular ways. E.g., in your example of
:a download server, those files are always
:read sequentially. You can make similar assertions
:about a lot of files: manpages, gzip files,
:C source code
On Thursday 30 January 2003 07:06 pm, Tim Kientzle wrote:
| Matthew Dillon wrote:
| Your idea of 'sequential' access cache restriction only
|
| works if there is just one process doing the accessing.
|
| Not necessarily. I suspect that there is
| a strong tendency to access particular files
Hi, re:
If a file's access history were stored as a hint
associated with the file, then it would
be possible to make better up-front decisions about
how to allocate cache space.
I believe at one time this was a hot area, and now
maybe it is back. I vaguely recall a recent PhD in
this
Thus spake Matthew Dillon [EMAIL PROTECTED]:
:Thanks for the explanations! I still don't understand why this
:doesn't work, assuming you don't care about nonresident pages:
:
:for each process p in the set
: for each map entry e in p-vmspace-vm_map
: for each page m in
Thus spake Fergal Daly [EMAIL PROTECTED]:
[EMAIL PROTECTED] (Tim Kientzle) wrote in message
news:b128ta$b0n$[EMAIL PROTECTED]...
Personally, I think there's a lot of merit to _trying_
There's even more merit in only pretending to try...
Welcome to my quotes file.
As you can see, the
You have found an optimal replacement algorithm for the case of
repeated sequential reads. In fact, if you know in advance what
the access pattern is going to be, it is *always* possible to find
an optimal replacement algorithm. Specifically, you always
replace the block in the cache that
31 matches
Mail list logo
