Path: utzoo!utgpu!news-server.csri.toronto.edu!clyde.concordia.ca!uunet!aplcen!uakari.primate.wisc.edu!sdd.hp.com!decwrl!ucbvax!agate!darkstar!rennet.cs.wisc.edu
From: mcheng@rennet.cs.wisc.edu (Chin-Long (Michael) Cheng)
Newsgroups: comp.os.research
Subject: looking for sample "real-life" programs that use large VM space
Message-ID: <6189@darkstar.ucsc.edu>
Date: 20 Aug 90 22:19:01 GMT
Sender: usenet@darkstar.ucsc.edu
Organization: U of Wisconsin CS Dept
Lines: 22
Approved: comp-os-research@jupiter.ucsc.edu


Are you running programs that are potentially slowed down by the 
virtual memory (VM) policy in your machine? I'm looking for ways to improve
VM performance by using policies that differ from global CLOCK.
I would appreciate any help with the following:

a) Descriptions of programs that you think can run faster if different 
VM policies (replacement + prefetch + user assisted) were used.

b) Sample programs segments that you can give me so that I can study the
performance for different policies. (Even if you don't know if there
will be improvements.)

A textbook example would be Gaussian Elimination when the size of the
array is bigger than physical memory. When eliminating the lower
diagonal, prefetching the next row while working on the current 
row can be a big help. I am, however, looking for "real-life" programs.
That is, program segments that you use regularly for your work.
Thanks in advance. Any discussions welcome.

Mike
mcheng@rennet.cs.wisc.edu