STACK DISTANCE DENSITY AND PAGE FAULT PROBABILITY IN VIRTUAL MEMORY SYSTEMS.FRANKLIN MA; GUPTA RK.1976; COMPUTERS MATH. APPL.; G.B.; DA. 1976; VOL. 2; NO 1; PP. 41-48; BIBL. 10 REF.Article

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

ALLOCATION DE MEMOIRE OPERATIONNELLEBRODSKY J.1976; INFORM. SYST.; CESKOSL.; DA. 1976; VOL. 5; NO 1; PP. 65-79; ABS. RUSSE ANGL.; BIBL. 14 REF.Article

CHOIX DU NOMBRE OPTIMAL DE PROGRAMMES POUR LES SYSTEMES DE CALCUL DANS LE CAS D'UNE STRATEGIE DE PAGINATION POUR L'ALLOCATION DE LA MEMOIREGORITSKIJ YU A; KUTEPOV VP; STAROBOGATOVA NN et al.1975; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1975; NO 1; PP. 133-136; BIBL. 2 REF.Article

EFFECTS OF COMPACTION ON MEMORY UTILIZATION IN MULTIPROGRAMMING SYSTEMS.BUZEN JP; RUBIN DB.1974; IN: COMPUT. ARCHIT. NETWORKS. MODELLING EVAL. PROC. INT. WORKSHOP; ROCQUENCOURT, FR.; 1974; AMSTERDAM; NORTH-HOLLAND PUBLISHING CO.; DA. 1974; PP. 113-124; BIBL. 8 REF.Conference Paper

VIRTUAL MEMORY MANAGEMENT IN THE VAX/VMS OPERATING SYSTEMLEVY HM; LIPMAN PH.1982; COMPUTER; ISSN 0018-9162; USA; DA. 1982; VOL. 15; NO 3; PP. 35-41; BIBL. 4 REF.Article

LRU STACK PROCESSING.BENNETT BT; KRUSKAL VJ.1975; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1975; VOL. 19; NO 4; PP. 353-357; BIBL. 5 REF.Article

GESTION DE PAGES PAR APPRENTISSAGE POUR MEMOIRES HIERARCHISEES.FRANK C; ROCHFELD A; TABOURIER Y et al.1975; SEMA-METRA-RR-77; FR.; DA. 1975; PP. 1-210; BIBL. 1 P. 1/2Report

AUTOMATES REALISANT LES ALGORITHMES DE REMPLACEMENT. THEORIE NON PARAMETRIQUEAVEN OI; BOGUSLAVSKIJ LB; KOGAN YA A et al.1975; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1975; NO 5; PP. 129-148; ABS. ANGL.; BIBL. 16 REF.Article

DISPOSITIF DE PAGINATION POUR LES MEMOIRES HOLOGRAPHIQUESELKHOV VA; KLIMOV II; LEVCHENKO IV et al.1982; AVTOMETRIJA (NOVOSIB.); ISSN 0320-7102; SUN; DA. 1982; NO 1; PP. 25-29; BIBL. 5 REF.Article

STOCHASTIC CONTROL OF PAGING IN A TWO-LEVEL COMPUTER MEMORY. = COMMANDE STOCHASTIQUE DE LA PAGINATION DANS UNE MEMOIRE DE CALCULATEUR A DEUX NIVEAUXAVEN DI; KOGAN YA.1975; AUTOMATICA; G.B.; DA. 1975; VOL. 11; NO 3; PP. 309-313; BIBL. 16 REF.Article

CARACTERISTIQUES DES SYSTEMES DE TRAITEMENT PAR LOT DE L'INFORMATION AVEC UNE MEMOIRE PAGINEEMAKHAREV EH I; NOVIKOV GI.1975; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1975; NO 4; PP. 116-126; BIBL. 10 REF.Article

APPLICATION OF THE PAGE SURVIVAL INDEX (PSI) TO VIRTUAL-MEMORY SYSTEME PERFORMANCE.BARD Y.1975; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1975; VOL. 19; NO 3; PP. 212-220; BIBL. 13 REF.Article

ESTIMATION DU TAUX DE TEMPS MORT D'UN CALCULATEUR AVEC UNE MEMOIRE PAGINEEBROJTMAN MD; KIRILLOV VE; PETERSON EH YA et al.1975; AVTOMAT. VYCHISLIT. TEKH., LATV. S.S.R.; S.S.S.R.; DA. 1975; NO 4; PP. 58-61; BIBL. 7 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

VMIN - AN OPTIMAL VARIABLE SPACE PAGE REPLACEMENT ALGORITHM.PRIEVE BG; FABRY RS.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 5; PP. 295-297; BIBL. 9 REF.; (ACM SYMP. OPER. SYST. PRINC. 5; AUSTIN, TEX.; 1975)Conference Paper

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

PAGE LIFE MEASUREMENTSPECHURA MA.1981; PERFORM. EVAL. REV.; ISSN 0163-5999; USA; DA. 1981-1982; VOL. 10; NO 4; PP. 10-12; BIBL. 9 REF.Article

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

DERIVATION OF CONFIDENCE INTERVALS FOR WORK RATE ESTIMATORS IN A CLOSED QUEUING NETWORK.LAVENBERG SS; SHEDLER GS.1975; S.I.A.M.J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 2; PP. 108-124; BIBL. 15 REF.Article

EVALUATION OF MARKOV PROGRAM MODELS IN VIRTUAL MEMORY SYSTEMS.BOGOTT RP; FRANKLIN MA.1975; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1975; VOL. 5; NO 4; PP. 337-346; BIBL. 16 REF.Article

MEMORY ADDRESSING AND PROTECTION.1975; COMPUTER MONOGR.; NETHERL.; DA. 1975; VOL. 5; PP. 52-82Article

THE EDINBURGH MULTI-ACCESS SYSTEM SCHEDULING AND ALLOCATION PROCEDURES IN THE RESIDENT SUPERVISOR.SHELNESS NH; STEPHENS PD; WHITFIELD H et al.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., B; FR.; DA. 1975; VOL. 9; NO 3; PP. 29-45; ABS. FR.; BIBL. 20 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