From owner-freebsd-questions Wed Feb 4 16:45:28 1998 Return-Path: Received: (from majordom@localhost) by hub.freebsd.org (8.8.8/8.8.8) id QAA22328 for questions-outgoing; Wed, 4 Feb 1998 16:45:28 -0800 (PST) (envelope-from owner-freebsd-questions@FreeBSD.ORG) Received: from cs.rpi.edu (root@fred.cs.rpi.edu [128.213.8.2]) by hub.freebsd.org (8.8.8/8.8.8) with ESMTP id QAA22286 for ; Wed, 4 Feb 1998 16:45:15 -0800 (PST) (envelope-from maniattb@cs.rpi.edu) Received: from cs.rpi.edu (maniattb@eggbeater.cs.rpi.edu [128.213.8.32]) by cs.rpi.edu (8.8.8/8.8.8) with ESMTP id TAA07323 for ; Wed, 4 Feb 1998 19:42:40 -0500 (EST) Message-Id: <199802050042.TAA07323@cs.rpi.edu> X-Mailer: exmh version 2.0.1 12/23/97 To: freebsd-questions@FreeBSD.ORG Subject: Reference on FreeBSD VM/Paging Algorithms Wanted Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Wed, 04 Feb 1998 19:45:10 -0500 From: Bill Maniatty Sender: owner-freebsd-questions@FreeBSD.ORG Precedence: bulk X-Loop: FreeBSD.ORG X-To-Unsubscribe: mail to majordomo@FreeBSD.org "unsubscribe questions" I am teaching an undergraduate operating systems course this semester and am going into paging algorithms next week. I was wondering if there is a pointer to a (brief) description of the algorithms and internals of the FreeBSD virtual memory management/paging system. It would be nice to show the students a high quality paging real world example (give them a sense of what the big boys can do :-)). I realize it is probably well documented, I just hope that not all the documentation is in C :-). Bill