Path: utzoo!attcan!uunet!ginosko!usc!polyslo!cosmos.acs.calpoly.edu!mdeale
From: mdeale@cosmos.acs.calpoly.edu (Myron Deale)
Newsgroups: comp.arch
Subject: Re: Memory utilization & inter-process contention
Keywords: paging, swapping, scheduling
Message-ID: <13770@polyslo.CalPoly.EDU>
Date: 24 Aug 89 22:55:02 GMT
References: <3332@blake.acs.washington.edu> <219@qusunc.queensu.CA>
Sender: news@polyslo.CalPoly.EDU
Reply-To: mdeale@cosmos.acs.calpoly.edu.UUCP (Myron Deale)
Organization: ACS, Cal Poly, San Luis
Lines: 15


   There's a paper by Jerry C. Yan, "Post-Game Analysis - A Heuristic
Resource Managment Framework for Concurrent Systems." Tech. Rpt. CSL-
TR-88-374, Stanford U., where the idea is "program-machine mapping
is improved 'in between' program executions."

   Not exactly dynamic, doesn't necessarily catch the thrasher in the
act, but the next time it's run, gotcha. Love the name, "Post-Game
Analysis."  ["Ho, what about these Dodgers! 22nd inning, the catcher
calls for a jsr to hi-mem and Dempsey swaps it out of the ball-park." :]
Would be nice to bring it into real-time though.


-Myron
// mdeale@cosmos.acs.calpoly.edu