Path: utzoo!attcan!uunet!tut.cis.ohio-state.edu!pt.cs.cmu.edu!MATHOM.GANDALF.CS.CMU.EDU!lindsay From: lindsay@MATHOM.GANDALF.CS.CMU.EDU (Donald Lindsay) Newsgroups: comp.arch Subject: Re: Inverted Page Tables Message-ID: <8115@pt.cs.cmu.edu> Date: 22 Feb 90 17:04:27 GMT References: <9708@spool.cs.wisc.edu> <20270@cfctech.cfc.com> <11112@encore.Encore.COM> <753@dgis.dtic.dla.mil> <3606@uceng.UC.EDU> <757@dgis.dtic.dla.mil> <4852@scolex.sco.COM> <29718@brunix.UUCP> <6998@celit.fps.com> <43367@ames.ar Organization: Carnegie-Mellon University, CS/RI Lines: 20 In article <1990Feb22.034517.8676@esegue.segue.boston.ma.us> johnl@esegue.segue.boston.ma.us (John R. Levine) writes: >The ROMP, actually its mmu chip which is named Rosetta, handles this pretty >well despite having a reverse map page table with no provision for aliasing. >The high four bits of a memory address are looked up in a tiny fast memory >to get a segment number. These segment numbers are global to the entire >system. The file mapping we put into AIX maps a file to a segment, so if you >map a file into several processes there is no aliasing problem; they use the >same segment. The segment idea could have been built on top of any viable paging scheme, and doesn't require the inverted scheme that was used. The inverted table (+ hash table and chains) mostly gets in the way when the software wants aliasing. Since the hardware designers knew that AIX does aliasing, could you explain why they still went with the inverted approach? I don't understand the net benefit, or any benefit. -- Don D.C.Lindsay Carnegie Mellon Computer Science