If we are facing these problems for "normal case" then hope the Solaris is
handling it !!
Amol
Fabio Riccardi [EMAIL PROTECTED] on 04/04/2001 07:03:57 AM
To: Alan Cox [EMAIL PROTECTED]
cc: [EMAIL PROTECTED] (bcc: Amol Lad/HSS)
Subject: Re: a quest for a better scheduler
Alan,
In 2.4 kernel we now have no limit on the number of tasks running on a system
(no NR_TASKS anymore)...
I was just wondering on the efficiency of get_pid() implemetation... Although
'next_safe' concept in this function seems useful but I think we now need a
robust PID allocator..
We can have a
Some stupid questions about videomem:
1) How do 2 or more X servers, or svgalibbed apps share the same physical video
memory ? Does it get saved to ram when switching between them ?
2) Does console switching (gfx or text) save and restore all registers of
videocard in kernel ? Or kernel only
It is a very good idea, and to implement quite easy. You just do have to
diff between three types of video cards (MDA, MGA and HGC vs. CGA and AGA vs. EGA+).
Then you do direct register writes. For the HGC I did it recently in a DOS proggy
which switched from text to gfx and back. I had a TSR
Errors building the following:
1)
gcc -D__KERNEL__ -I/usr/src/linux-2.4.3/include -Wall -Wstrict-prototypes
-O2 -fomit-frame-pointer -fno-strict-aliasing -pipe
-mpreferred-stack-boundary=2 -march=athlon -DMODULE -DMODVERSIONS
-include /usr/src/linux-2.4.3/include/linux/modversions.h -c -o
Hi folks,
i wonder if every ac-XX patch from the 2.4.2 Kernel is included in the new
2.4.3 kernel so that every bug in 2.4.2 has been fixed in 2.4.3 ?
Thanx a lot,
Thomas
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [EMAIL PROTECTED]
Hello Jim,
We have modified ptrace() such that it first allocates the debug register
before it is used. So, yes, if a debugger is using ptrace() interface it
need not be concerned about this centralised debug register allocation
scheme, the debug register allocation actually happens behind the
Sorry if I fork a bit the thread but I'm wondering why the load average is incremented
for each D process.
I don't know if the kernel use this information (if yes please let me know).
But some programs like sendmail use this information to sleep when the load is too
high (I believe from 12 for
Alan Cox [EMAIL PROTECTED] writes:
The MMX memcpy for CyrixIII and Athlon boxes is something like twice the
speed of rep movs. On most pentium II/III boxes the fast paths for rep movs
and for MMX are the same speed
As long as you are copying in real memory. So the PCI bus or the
On Tue, 3 Apr 2001, Fabio Riccardi wrote:
I've spent my afternoon running some benchmarks to see if MQ patches
would degrade performance in the "normal case".
no doubt priority-queue can run almost as fast as the current scheduler.
What i'm worried about is the restriction of the 'priority'
Hello all,
I've just installed the new kernel,
And I noticed something wierd:
When I'm running X it works Ok,
but when I log out of it, and runs it again,
it gives me an error about fixed fonts,
If I'm rebooting it will work again(Only one time per boot).
With the 2.2.3 kernel it works Ok.
Hello Thomas,
Thomas Foerster wrote:
i wonder if every ac-XX patch from the 2.4.2 Kernel is included in the new
2.4.3 kernel so that every bug in 2.4.2 has been fixed in 2.4.3 ?
No, I don't think so - they are different trees.
If you want Alan's latest patches against "2.4.3", you can
Err, tried the patch you recommended me to apply to the 2.4.3 source code (not
the 2.4.3-pre6), but everything else started complaining it couldn't see
printk() any more. Any advice? Thanks...
--
/| _,.:*^*:., |\ Cheers from the Viking family,
| |_/' viking@ `\_| |
Hi Guys,
I'm new to this list, so let me introduce myself first, I'm Remko van der
Vossen from Holland, I work for CMG in an internship at the moment. CMG
Eindhoven wants me to set up a project. This project involves making a
TCP/IP implementation for embedded systems. As it is way too hard to
Krzysztof Halasa [EMAIL PROTECTED] crit :
[...]
But it's still more complicated than the first one and I'm not sure
if doing that is worth it
struc sub_req {
int sub_ioctl;
... as we lose 4 bytes here (currently the union of structs in ifreq
is limited to 16 bytes)
I missed
On Wed, Apr 04, 2001 at 12:59:33AM +0200, Juan wrote:
I have the same problem in two different machines but they both are UP.
However, my kernel configuration has SMP support enabled.
Could you build a kernel without SMP support and see if the problem
still happens?
options parport_pc
On Tue, 3 Apr 2001, Tim Pepper wrote:
I know there was a thread on this previously and I was thinking it had been
resolved (or was that only for a specific mobo mfg?). When I finally got my
VIA chipset machine up to date with a 2.4.3 kernel I noticed the following on
boot up:
I get a like
Eric W. Biederman wrote:
I don't know if it applies to this case but one thing I have seen make
a noticeable difference is whether or not write-combining is enabled.
If we have only be enabling MTRR's for intel this could do account
for it.
And on some laptops, even on Intel MTRRs are not
Okay, I've seen various references to problems with loopback
mounts under (early) 2.2.x kernels. But I don't see any reference
to a solution (ie. how to umount the stupid thing).
My situation is that I have mounted a CD image on a machine
for use in kickstart builds. The mount point is
I recently acquired a 1.3GB MO drive. When I use small (230MB and 540MB)
MO disks which have normal 512 bytes/sector it all works flawlessly but
as soon
as a put in a 1.3GB disk which uses the 2048 bytes/sector format it all
goes
wrong. As soon as I write something to the disk by issuing
Hi Harald,
If I get the DVD stuff working, then I won't need NT anymore, i.e.
I will have an empty disk.
What is your impression about ReiserFS? Does it work? Is it stable
enough for my daily work, or is it something to try out and watch
carefully? Do you use ReiserFS for your boot
I was just wondering on the efficiency of get_pid() implemetation... Although
'next_safe' concept in this function seems useful but I think we now need a
robust PID allocator..
get_pid() isnt showing up on kernel profile runs I've seen, and that doesn't
actually suprise me. Its not a normal
Thank you very much for your help.
In the linux kernel version 2.4.X,
Does anybody mount a hard drive with MSDOS type file system ??
yes
When I mount this hard drive using the command :
mount -t msdos /dev/hda1 /mnt/hd -o blocksize=1024
After mounting a hard disk, I read a file
On Sun, 25 Mar 2001 18:40:03 +0200, Benjamin Herrenschmidt wrote:
There is a problem with the power management code for console.c
The current code calls do_blank_screen(0); on PM_SUSPEND, and
unblank_screen() on PM_RESUME.
The problem happens when X is the current display while putting the
The file locking use real IO and so when you ask for a lock, if the loc=
k is already owned, you fall in a D state.
That seems odd. They should be using interruptible sleeps so you can interrupt
the task waiting for the lock, surely.
-
To unsubscribe from this list: send the line "unsubscribe
hi,
I'm running the 2.4.3 kernel and my system always (!) crashes when I try
to generate the "Linux kernel poster" from lgp.linuxcare.com.au. After
working for one hour, the kernel printed this message:
kernel BUG at page_alloc.c:75!
invalid operand:
CPU:0
EIP:
The sleep should certainly be interruptible and I that's what I said to the GFS guy.
But what the reason to increment the load average for each D process ?
Thanks,
Christophe
On mer, 04 avr 2001 13:15:52 Alan Cox wrote:
The file locking use real IO and so when you ask for a lock, if the loc=
On Wed, 4 Apr 2001, Remko van der Vossen wrote:
second problem is that when I use the PThread functions from this module I
need the pthread library. As you probably know gcc doesn't link the pthread
library into the module, so I tried to do that with ld, that in itself
worked, I successfully
The sleep should certainly be interruptible and I that's what I said to t=
he GFS guy.
But what the reason to increment the load average for each D process ?
D indicates short term I/O wait. This is how unix has always computed the
laod average.
-
To unsubscribe from this list: send the line
On Tue, 3 Apr 2001, Fabio Riccardi wrote:
I agree that a better threading model would surely help in a web
server, but to me this is not an excuse to live up with a broken
scheduler.
believe me, there are many other parts of the kernel that are not
optimized for the nutcase. In this case
On Wed, 4 Apr 2001, Alan Cox wrote:
The problem has always been - alternative scheduler, crappier
performance for 2 tasks running (which is most boxes). [...]
it's not only the 2-task case, but also less flexibility or lost
semantics.
Indeed. I'd love to see you beat tux entirely in
On Tue, Apr 03, 2001 at 11:02:51PM -0400, John Jasen wrote:
On Tue, 3 Apr 2001, Simon Kirby wrote:
Three times now I've had 2.4.3 freeze on my dual CPU box while doing a
"dd if=/dev/zero of=/dev/hdc bs=1024k" (a drive to be RMA'd :)). I got
bored and opened an rxvt, and as the machine
I'm not sure what the problem is, but the whole deal about checking whether the
controller runs in 16 bit or 32 bit mode, is a little bit tricky.
There doesn't seem to be a clean way to do the check, so it's done by writing a certain
pattern to a register and read it back again.
Doing the check
This is an important point that Mike is raising and it also addresses a
critique that Ingo issued yesterday, namely interactivity and fairness.
The HP scheduler completely separates the per-CPU runqueues and does
not take preemption goodness or alike into account. This can lead to
unfair
Hi,
This patch fixes a problem the the firestream card and adds support for
atm aal2 mode. This is a patch against the 2.4.0 tree and not agains 2.4.3
because we're having trouble whith the ixj driver in 2.4.3.
Patrick
diff -u linux-2.4.0.clean/drivers/atm/firestream.c
Hello,
sorry, this might be a beginner question, but I couldn't find any
infos in the FAQ.
I'm writing a driver (module) for a PCI card with a neural processor
(NP-processor) on it for kernel 2.4.1. The registers of this processor
are mapped to a memory area. When I probe for the device, I
I grant you that the code is not as clean as the current scheduler,
so maybe you missed that part.
For the priority scheduler:
Yes the task_to_qid assumes a NON-affinity (no cpu, no mm) to determine
the list index to where the task has to be enqueued.
However, if you wonder down to the
I'll be assembling a terabyte of IDE RAID network attached storage,
and was looking for some advice on:
- best supported and most reliable multi-channel IDE controller;
- best supported and most reliable NFS implementation;
- any other random advise about things to do or not do in
I have MOXA C218Turbo PCI card, in the moment i have 4 leased lines connected
to it (all of them 115200). Form time to time (2 times a day, sometimes 1
time/2 days - seems random), one or more ports looks like there're dead...
Pppd is loaded, interface is up, but there's no activity on port (i
Finished tested my random PID kernel/fork.c:get_pid() replacement.
This one keeps track of the last N (default is 64) pids who have exited.
These are then not used. So, one cannot have more then 32767 - (64 + 1
(init) + 1 (idle)) = 32761 processes :o)
I know that it was all implemented before,
On Wed, 4 Apr 2001, christophe barbe wrote:
The sleep should certainly be interruptible and I that's what I
said to the GFS guy. But what the reason to increment the load
average for each D process ?
from a philosical POV: they are processes that will be runnable as
soon as the kernel
Hi, I had problems with compiling a piece of code with gcc.
It seems to produce asm output (for the gnu assembler) that it incorrect!
The reason that I post this in linux-kernel is that it _may_ be an error
cause of a
header file in the linux-2.4.3 kernel. (I suspect asm/uaccess.h a lot).
The
On Wed, Apr 04, 2001 at 04:17:45PM +0200, Heusden, Folkert van wrote:
Finished tested my random PID kernel/fork.c:get_pid() replacement.
This one keeps track of the last N (default is 64) pids who have exited.
These are then not used. So, one cannot have more then 32767 - (64 + 1
(init) + 1
On Wed, 4 Apr 2001, Hubertus Franke wrote:
I understand the dilemma that the Linux scheduler is in, namely
satisfy the low end at all cost. [...]
nope. The goal is to satisfy runnable processes in the range of NR_CPUS.
You are playing word games by suggesting that the current behavior
On Wed, 4 Apr 2001, Hubertus Franke wrote:
It is not clear that yielding the same decision as the current
scheduler is the ultimate goal to shoot for, but it allows
comparision.
obviously the current scheduler is not cast into stone, it never was,
never will be.
but determining whether the
skip
I've unfortunately no significant Unix culture.
I'm certainly young enough to be excused and by luck Linux shows me the road to the
hacker heaven.
So now I move forward the good direction, trying to understand the POSIX stuff
/skip
From me, a POV without technical reasons is not a
Finished tested my random PID kernel/fork.c:get_pid() replacement.
This one keeps track of the last N (default is 64) pids who have exited.
These are then not used. So, one cannot have more then 32767 - (64 + 1
(init) + 1 (idle)) = 32761 processes :o)
DW Huh, should be 32701, right?!
You're
On Wed, 4 Apr 2001, christophe barbe wrote:
From me, a POV without technical reasons is not a philosical one
but more certainly an historical one.
there may be (and indeed probably are) good technical reasons, however
i am not well enough informed to say what they are.
Process that will be
Is there any documentation on ths linux console terminal type? If
so, where?
Thanks,
Mark
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [EMAIL PROTECTED]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the
On Wed, Apr 04, 2001 at 03:34:22PM +0200, Ingo Molnar wrote:
On Wed, 4 Apr 2001, Hubertus Franke wrote:
Another point to raise is that the current scheduler does a exhaustive
search for the "best" task to run. It touches every process in the
runqueue. this is ok if the runqueue length
On mer, 04 avr 2001 17:05:05 Paul Jakma wrote:
imagine a box with a bunch of processes that do almost nothing but
call on the kernel to do IO. If you only count the runnable state
towards load_avg then your load_avg will be very low, even though your
box is swamped - you are ignoring the work
On Wed, Apr 04, 2001 at 10:03:10AM -0400, Hubertus Franke wrote:
I understand the dilemma that the Linux scheduler is in, namely satisfy
the low end at all cost. [..]
We can satisfy the low end by making the numa scheduler at compile time (that's
what I did in my patch at least).
Andrea
-
To
Carsten Langgaard wrote:
I'm not sure what the problem is, but the whole deal about checking whether the
controller runs in 16 bit or 32 bit mode, is a little bit tricky.
[snip]
Without the changes listed in this thread, 2.4.3 crashed vmware 2.0.3
Linux. It did not OOPS the kernel, it caused
I've found a bug in the write path of the read/write semaphore stuff (at least
for the i386 arch). The attached kernel module (rwsem.c) and driver program
(driver.c) demonstrate it.
What happens is that once the driver finishes, you end up with a whole load of
processes forked off of driver that
Yes, Andrea.
We actually already went a step further. We treat the scheduler
as a single entity, rather than splitting it up.
Based on the MQ scheduler we do the balancing across all nodes
at reschedule_idle time. We experimented to see whether only looking
for idle tasks remotely is a good
You imply that high end means thousands of processes,
simply because we have shown that in our graphs as an
asymptotic end.
No, it could mean 5*#cpus and that is not all that absurd.
This could happen with a spike in demand.
TUX is not the greatest example to use, because it does
static
On my toshiba laptop, I am trying to use 2.2.19.
However, building it with the Toshiba Laptop option
set to Y or M results in errors. The errors
from setting it to M are:
toshiba.c:81: toshiba.h: No such file or directory
toshiba.c:156: parse error before `*'
...
The fix is to edit
hello!
i have been using a spea mediafx soundcard for quite some time now but
recently faced a problem configuring the card. the card has a mic/line input
that can be switched between mic mode (mono, 20db preamplification) and line
mode (stereo, no preamp). since i recently aquired a tv-card i
Hubertus Franke wrote:
This is an important point that Mike is raising and it also addresses a
critique that Ingo issued yesterday, namely interactivity and fairness.
The HP scheduler completely separates the per-CPU runqueues and does
not take preemption goodness or alike into account.
I recently rewrote the syscall numbering for the x86_64 platform to optimize it
at the cacheline usage level. If somebody wants to overview the numbering and
give feedback or find something better that's welcome. We know we'll break the
kernel API still at least once. I choosed the numbering in
This one didn't quite make 2.4.3, this time I've CC'd to AC.
I've been using this fix for a few days now it's cleared up a lot of
problems - although I'm not 100% sure why it worked (the memset should
do the same job as the spin_lock_init surely?).
Tony
Original Message
Since 2.2.4-ac28 and 2.4.3 I keep on getting processes in D state that I
cannot kill, usually mozilla or nautilus which use a large amount of RAM.
Today is galeon:
A ps -eo pid,stat,pcpu,nwchan,wchan=WIDE-WCHAN-COLUMN -o args shows the
following:
11520 D 0.0 105db1 down_write_failed
Andrea Arcangeli wrote:
On Wed, Apr 04, 2001 at 10:03:10AM -0400, Hubertus Franke wrote:
I understand the dilemma that the Linux scheduler is in, namely satisfy
the low end at all cost. [..]
We can satisfy the low end by making the numa scheduler at compile time (that's
what I did in
This problem seems to be related with the recent post from David Howells
[EMAIL PROTECTED] with the subject "rw_semaphore bug".
Christophe
On mar, 03 avr 2001 18:40:53 Manfred Spraul wrote:
ps xl:
F UID PID PPID PRI NI VSZ RSS WCHAN STAT TTY TIME COMMAND
040 1000 1230 1 9 0 24320 4
On Wed, Apr 04, 2001 at 09:44:22AM -0600, Khalid Aziz wrote:
Let me stress that HP scheduler is not meant to be a replacement for the
current scheduler. The HP scheduler patch allows the current scheduler
to be replaced by another scheduler by loading a module in special
cases.
HP also has a
On 04-Apr-2001 Ingo Molnar wrote:
On Tue, 3 Apr 2001, Fabio Riccardi wrote:
I've spent my afternoon running some benchmarks to see if MQ patches
would degrade performance in the "normal case".
no doubt priority-queue can run almost as fast as the current scheduler.
What i'm worried
I too have noticed that nicing processes does not work nearly as
effectively as I'd like it to. I run on an underpowered machine,
and have had to stop running things such as seti because it steals too
much cpu time, even when maximally niced.
As an example, I can run mpg123 and a kernel build
Look in section 4 of the man pages for entries starting with "console".
console
console_codes
etc.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [EMAIL PROTECTED]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please
On Wed, 4 Apr 2001, Hubertus Franke wrote:
Another point to raise is that the current scheduler does a exhaustive
search for the "best" task to run. It touches every process in the
runqueue. this is ok if the runqueue length is limited to a very small
multiple of the #cpus. [...]
I didn't seen anything from Kanoj but I did something myself for the wildfire:
ftp://ftp.us.kernel.org/pub/linux/kernel/people/andrea/kernels/v2.4/2.4.3aa1/10_numa-sched-1
this is mostly an userspace issue, not really intended as a kernel optimization
(however it's also partly a
I just came across a very good page on exactly the same issue. Have a look
at http://www.research.att.com/~gjm/linux/ide-raid.html.
David Christensen
-Original Message-
From: John Kodis [mailto:[EMAIL PROTECTED]]
Sent: Wednesday, April 04, 2001 7:04 AM
To: [EMAIL PROTECTED]
Subject:
Hello,
Problem: Linux kernel 2.4 consistently hangs at boot on 486 machine
Shortly after lilo starts the kernel it hangs at the following message:
Checking if this processor honours the WP bit even in supervisor mode...
blinking cursor
I experience this problem on a VLB AMD 486 DX/2-66 system.
On Wed, Apr 04, 2001 at 09:39:23AM -0700, Kanoj Sarcar wrote:
example, for NUMA, we need to try hard to schedule a thread on the
node that has most of its memory (for no reason other than to decrease
memory latency). Independently, some NUMA machines build in multilevel
caches and local
Kanoj, our cpu-pooling + loadbalancing allows you to do that.
The system adminstrator can specify at runtime through a
/proc filesystem interface the cpu-pool-size, whether loadbalacing
should take place.
We can put limiting to the local cpu-set during reschedule_idle
back into the code, to
Kanoj, our cpu-pooling + loadbalancing allows you to do that.
The system adminstrator can specify at runtime through a
/proc filesystem interface the cpu-pool-size, whether loadbalacing
should take place.
Yes, I think this approach can support the various requirements
put on the
On Wed, Apr 04, 2001 at 09:50:58AM -0700, Kanoj Sarcar wrote:
I didn't seen anything from Kanoj but I did something myself for the wildfire:
ftp://ftp.us.kernel.org/pub/linux/kernel/people/andrea/kernels/v2.4/2.4.3aa1/10_numa-sched-1
this is mostly an userspace issue, not
Well put, this how we can eliminate searching all bins or lists and that's
how we do it under.
http://lse.sourceforge.net/scheduling/2.4.1-pre8-prioSched.
If you have a list per priority level, then you can even pick the first one
you find if its on
the same level. That's what I tried in a more
Khyron wrote:
Okay, I've seen various references to problems with loopback
mounts under (early) 2.2.x kernels. But I don't see any reference
to a solution (ie. how to umount the stupid thing).
My situation is that I have mounted a CD image on a machine
for use in kickstart builds. The
On Tue, Apr 03, 2001 at 09:21:57PM -0700, Fabio Riccardi wrote:
I was actually suspecting that the extra lines in your patch were there for a
reason :)
A few questions:
What is the real impact of a (slight) change in scheduling semantics?
Under which situation one should notice a
On Tue, Apr 03, 2001 at 09:07:55PM -0600, Mark Lehrer wrote:
Date: Tue, 3 Apr 2001 21:07:55 -0600
From: Mark Lehrer [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: "linux" terminal type
Is there any documentation on ths linux console terminal type? If
so, where?
Maybe cryptic
Correct, that's true.
Our patch does various things.
(a) limit search for a task to a admin specified set of cpu's
during schedule()..
(b) limits search for a preemptable task to another set of cpu's
during reschedule_idle()
need to reactivate this functionality 10 lines of code
Just a quick comment. Andrea, unless your machine has some hardware
that imply pernode runqueues will help (nodelevel caches etc), I fail
to understand how this is helping you ... here's a simple theory though.
If your system is lightly loaded, your pernode queues are actually
implementing
It helps by keeping the task in the same node if it cannot keep it in
the same cpu anymore.
Assume task A is sleeping and it last run on cpu 8 node 2. It gets a wakeup
and it gets running and for some reason cpu 8 is busy and there are other
cpus idle in the system. Now with the current
On Wed, Apr 04, 2001 at 10:49:04AM -0700, Kanoj Sarcar wrote:
Imagine that most of the program's memory is on node 1, it was scheduled
on node 2 cpu 8 momentarily (maybe because kswapd ran on node 1, other
higher priority processes took over other cpus on node 1, etc).
Then, your patch
Here's is the trace of a nautilus process in D state.
I'm rebooting now in 2.4.3-ac2 to see if it still happens.
Pau
trace.bz2
Alan Cox wrote:
Problem: Linux kernel 2.4 consistently hangs at boot on 486 machine
Shortly after lilo starts the kernel it hangs at the following message:
Checking if this processor honours the WP bit even in supervisor mode...
blinking cursor
Does this happen on 2.4.3-ac kernel
There has been a little cross talk lately about the "HP" schedulers that
may be sowing some confusion.
1) Pluggable policies provides a minimally intrusive way to develop and
test new scheduler policies such as Processor Sets, or the Fair Share
Scheduler. It provides a good way to test a
Hello,
We have been seeing some problems with running nfs benchmarks
at very high loads and were wondering if somebody could show
some pointers to where the problem lies.
The system is a 2.4.0 kernel on a 6.2 Red at distribution ( so
nfs utils from 6.2 and the nfsd of 2.4.0 ) -
We have been seeing some problems with running nfs benchmarks
at very high loads and were wondering if somebody could show
some pointers to where the problem lies.
The system is a 2.4.0 kernel on a 6.2 Red at distribution ( so
Use 2.2.19. The 2.4 VM is currently too broken to
Hey,
After I did put in /etc/sysconfig/harddisks
USE_DMA=1
my system did crash very badly, I guess after my hard disks did wake up
again. For I while I though I'd lose some sectors because of this, I had
to re-install my RedHat 7.0, had a not so productive day :) But, hard
disks are OK
I initially upgraded my kernel from 2.4.2-ac5 to 2.4.3 and the first thing I
noticed was that mysqld was stuck. Killing it left it hanging in a D state.
Then I tried 2.4.2-ac28 (which I am using now), and the got the same result.
My key_buffer was set to 256MB, so I figured maybe it was
After I did put in /etc/sysconfig/harddisks
USE_DMA=1
my system did crash very badly, I guess after my hard disks did wake up
So you forced DMA on
BTW: my motherboard runs at 112 Mhz, overclocked, was 100 Mhz.
and ran overclocked
Been running this configuration over more than 2
I initially upgraded my kernel from 2.4.2-ac5 to 2.4.3 and the first thing I
noticed was that mysqld was stuck. Killing it left it hanging in a D state.
Then I tried 2.4.2-ac28 (which I am using now), and the got the same result.
I'd expect that bit. 2.4.2-ac28 basically has the same new
I give you a concrete example:
Running DB2 on an SMP system.
In DB2 there is a processes/thread pool that is sized based
on memory and numcpus. People tell me that the size of this pool
is in the order of 100s for an 8-way system with reasonable
sized database. These maxagents determine the
If you have a serial console on the server, you can get sysrq by
sending a serial break followed by the character.
Hi,
i've tried it with minicom and functioned : ctrl+a+F and key for function
as in normal sysrq.
This approach will probably not help you a lot thought, since you wouldn't
Hi Nathan,
I've just made an experimental module which offers syscall to privileged
process, which internally translates itself into real sysrq handler
(handle_sysrq) defined in drivers/char/sysrq.c. It occupates itself
one of unussed linux system calls (concretely stty - no. 31).
Makefile
gcc -D__KERNEL__ -I/usr/src/linux/include -Wall -Wstrict-prototypes -02
-fomit-frame-pointer -fno-strict-aliasing -pipe -march=i486 -c -o init/main.o
init/main.c
gcc -D__KERNEL__ -I/usr/src/linux/include -Wall -Wstrict-prototypes -02
fomit-frame-pointer -fno-strict-aliasing -pipe
Alan Cox wrote:
David Brownell recently added this check to the usb-ohci driver
since noone has gotten information from AMD for the workaround,
which is rumored to exist, for this bug.
Do any of you have contacts within AMD who might be able to
get an explanation of the workaround
Second time around, I didn't evoke any interest the first time.
I reported it back on Mar/27. It is still an almost daily problem
requiring a reboot. Mozilla gets stuck in down_write_failed. This time
I'm sure it's not reiser's fault.
# uname -r
2.4.3-pre8
mozilla-bin D C781849C 0
I have two Adaptec 2930CU (ultra narrow) cards. I modified the driver to
make them work in ultra mode. The card connected to my CDROM and MO drive,
operating at different bus clocks, does not behave well. Transfers stop
often for 10-20 seconds and it spits out warnings like these:
Apr 3
1 - 100 of 356 matches
Mail list logo
