Re: Scheduling times revisited

Paul Barton-Davis (pbd@Op.Net)
Sun, 27 Sep 1998 21:41:31 -0400


Victor Yodaiken (hi Victor, its been a while since talk.politics.theory)
writes:

> That is, you should be able to show that for Application X, wall
> clock time of T involves T_s time searching the queue where T_s is a
> substantial fraction of T.

Not quite. Thats true if you're interested in throughput. If you care
about latency then the the test is something quite different: you only
need show that T_s is comparable to or exceeds your desired latency.

--pbd

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/