RE: Kernel Internals

Dale R. Worley (
Mon, 3 Feb 1997 11:12:23 -0500

Ted mentioned that this is only done in places that are not time
crititical. So, what? To me it makes sense to have the process table
defined as an array to be able to "jump" and not "traverse." What
advantages would traversing bring over jumping? Since the array is
already being defined, why not use it?

Ted has already addressed the question of why PIDs are not direct
indexes into the process table. But if speed of access was a problem,
the kernel could use a binary tree that keeps pointers into the table
in sorted order.


Dale R. Worley					Ariadne Internet Services
Voice: +1 617-899-7949   Fax: +1 617-899-7946	E-mail:
"Internet-based electronic commerce solutions to real business problems."