EXPLOITING THE OPTIMAL PAGING ALGORITHMS.ARORA RK; SUBRAMANIAN RK.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 5; PP. 233-236; BIBL. 5 REF.Article

OPTIMAL SHIFT STRATEGY FOR A BLOCK-TRANSFER CCD MEMORY.SITES RL.1978; COMMUNIC. A.C.M.; U.S.A.; DA. 1978; VOL. 21; NO 5; PP. 423-425; BIBL. 2 REF.Article

The measurement of locality and the behavior of programsBUNT, R. B; MURPHY, J. M.Computer journal (Print). 1984, Vol 27, Num 3, pp 238-245, issn 0010-4620Article

ANALYSIS OF A CLASS OF HYBRID PAGE REPLACEMENT POLICIESBABAOGLU O.1981; MODELISATION ET EVALUATION DES SYSTEMES INFORMATIQUES. SEMINAIRE/1979/ROCQUENCOURT; FRA; ROCQUENCOURT: INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE; DA. 1981; PP. 289-317; BIBL. 20 REF.Conference Paper

TRANSIENT-FREE WORKING-SET STATISTICS.EASTON MC; BENNETT BT.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 2; PP. 93-99; BIBL. 4 REF.Article

A DATA FLOW ARCHITECTURE WITH A PAGED MEMORY SYSTEMCALUWAERTS LJ; DEBACKER J; PEPERSTRAETE JA et al.1982; ANNUAL SYMPOSIUM ON COMPUTER ARCHITECTURE. 9/1982-04-26/AUSTIN TX; USA; NEW YORK: IEEE; DA. 1982; PP. 120-127; BIBL. 21 REF.Conference Paper

ORGANISATION DE LA MEMOIRE VIRTUELLE DANS UN SYSTEME MULTIPROCESSEURGODUNOV AN; SVERDLOV SS.1978; AVTOMAT. I TELEMEKH.; SUN; DA. 1978; NO 12; PP. 139-142; ABS. ENG; BIBL. 3 REF.Article

ANOMALIES WITH VARIABLE PARTITION PAGING ALGORITHMS.FRANKLIN MA; GRAHAM GS; GUPTA RK et al.1978; COMMUNIC. A.C.M.; U.S.A.; DA. 1978; VOL. 21; NO 3; PP. 232-236; BIBL. 13 REF.Article

TWO METHODS FOR THE EFFICIENT ANALYSIS OF MEMORY ADDRESS TRACE DATA.SMITH AJ.1977; I.E.E.E. TRANS. SOFTWARE ENGNG; U.S.A.; DA. 1977; VOL. 3; NO 1; PP. 94-101; BIBL. 19 REF.Article

A CHARACTERIZATION OF VM/370 WORKLOADS.BARD Y.1977; IN: MODELLING PERFORMANCE EVAL. COMPUT. SYST. INT. WORKSHOP. PROC.; ISPRA; 1976; AMSTERDAM; NORTH-HOLLAND; DA. 1977; VOL. 35-55; BIBL. 10 REF.Conference Paper

HOW TO EXPAND A MICROCOMPUTER'S MEMORY.RAPHAEL H.1976; ELECTRONICS; U.S.A.; DA. 1976; VOL. 49; NO 26; PP. 67-69Article

DETERMINATION DU NIVEAU OPTIMAL DE MULTIPROGRAMMATION DES SYSTEMES DE CALCUL AVEC ORGANISATION PAGINEE DE LA MEMOIREBROJTMAN MD; PETERSON EH YA.1979; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1979; NO 1; PP. 206-208; BIBL. 6 REF.Article

EXPLOITING THE LEAST RECENTLY USED PAGE REPLACEMENT ALGORITHM.INNES DR.1977; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1977; VOL. 7; NO 2; PP. 271-273; BIBL. 4 REF.Article

A NOTE ON THE INFLUENCE OF PROGRAM BONDING ON THE PAGE FAULT RATE.PARENT M; POTIER D.1977; IN: MODELLING PERFORMANCE EVAL. COMPUT. SYST. INT. WORKSHOP. PROC.; ISPRA; 1976; AMSTERDAM; NORTH-HOLLAND; DA. 1977; PP. 267-285; BIBL. 1 P. 1/2Conference Paper

CLEARING UP THE CONFUSION: VIRTUAL VS MAPPED MEMORY.TANNER DJ.1976; COMPUTER DESIGN; U.S.A.; DA. 1976; VOL. 15; NO 10; PP. 101-105Article

PREPAGING AND APPLICATIONS TO ARRAY ALGORITHMS.STRIVEDI KS.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 9; PP. 915-921; BIBL. 9 REF.Article

PROGRAM BEHAVIOR AND THE PAGE-FAULT-FREQUENCY REPLACEMENT ALGORITHM.CHU WW; OPDERBECK H.1976; COMPUTER; U.S.A.; DA. 1976; VOL. 9; NO 11; PP. 29-38; BIBL. 10 REF.Article

SOME RESULTS ON DISTRIBUTION-FREE ANALYSIS OF PAGING ALGORITHMS.AVEN OI; BOGUSLAVSKY LB; KOGAN YA et al.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 7; PP. 737-745; BIBL. 16 REF.Article

ETUDE DU WORKING-SET DANS LE SYSTEME EDELWEISS.RUGGIU G.1976; REV. TECH. THOMSON-C.S.F.; FR.; DA. 1976; VOL. 8; NO 2; PP. 237-254; ABS. ANGL. ALLEM.; BIBL. 1 REF.Article

AN ANALYSIS OF THE PERFORMANCE OF THE PAGE FAULT FREQUENCY (PFF) REPLACEMENT ALGORITHM.SADEH E.1975; IN: SYMP. OPER. SYST. PRINC. 5; AUSTIN; 1975; NEW YORK; ASSOC. FOR COMPUTING MACHINERY; DA. 1975; PP. 6-13; BIBL. 14 REF.Conference Paper

A MULTICLASS NETWORK MODEL OF A DEMAND PAGING COMPUTER SYSTEM.KRZESINSKI A; TEUNISSEN P.1978; ACTA INFORMAT.; ALLEM.; DA. 1978; VOL. 9; NO 4; PP. 331-343; BIBL. 12 REF.Article

POLICY/MECHANISM SEPARATION IN HYDRA.LEVIN R; COHEN E; CORWIN W et al.1975; IN: SYMP. OPER. SYST. PRINC. 5; AUSTIN; 1975; NEW YORK; ASSOC. FOR COMPUTING MACHINERY; DA. 1975; PP. 132-140; BIBL. 10 REF.Conference Paper

INTERNAL SCHEDULING AND MEMORY CONTENTIONSMITH AJ.1981; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1981; VOL. 7; NO 1; PP. 135-146; BIBL. 29 REF.Article

MULTIPROGRAMMED MEMORY MANAGEMENT FOR RANDOM-SIZED PROGRAMS.WALKE B.1976; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1976; NO 44; PP. 62-78; BIBL. 7 REF.; (EUR. COOP. INF. CONF. 1. PROC.; AMSTERDAM; 1976)Conference Paper

QUELQUES PROBLEMES DE RESTRUCTURATION DANS UN ENVIRONNEMENT PAGINE.LACOLLE B.1976; ; S.L.; DA. 1976; PP. (167P.); BIBL. 5 P. 1/2; (THESE DOCT. 3E CYCLE, MATH. APPL., OPTION ANAL. NUMER.; UNIV. SCI. MED. INST. NATL. POLYTECH. GRENOBLE)Thesis