Analysis of block-paging strategiesTETZLAFF, W. H; KIENZLE, M. G; GARAY, J. A et al.IBM journal of research and development. 1989, Vol 33, Num 1, pp 51-59, issn 0018-8646, 9 p.Article

THE EFFECTIVENESS OF A COMPILER ASSISTED LOOK-AHEAD PAGING ALGORITHM VIA SIMULATION.ROOTENBERG J; PYERON JJ JR.1977; INTERNATION: J. SYST. SCI.; G.B.; DA. 1977; VOL. 8; NO 7; PP. 727-738; BIBL. 7 REF.Article

Repagination : an exercise in creative thinkingBEARE, G.Indexer. 1990, Vol 17, Num 2, pp 124-126, issn 0019-4131, 3 p.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

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

A mixed approach to auto-detection of page bodyLIANGCAI GAO; ZHI TANG; RUIHENG QIU et al.Proceedings of SPIE, the International Society for Optical Engineering. 2008, pp 68150T.1-68150T.7, issn 0277-786X, isbn 978-0-8194-6987-8, 1VolConference Paper

Efficient optimal pagination of scrollsLARMORE, L. L; HIRSCHBERG, D. S.Communications of the ACM. 1985, Vol 28, Num 8, pp 854-856, issn 0001-0782Article

MicroVAX 32, a 32 Bit microprocessorSUPNIK, R. M.IEEE journal of solid-state circuits. 1984, Vol 19, Num 5, pp 675-681, issn 0018-9200Article

Some empirical observations on program behavior with applications to program restructuringPEACHEY, J. B; BUNT, R. B; COLBOURN, C. J et al.IEEE transactions on software engineering. 1985, Vol 11, Num 2, pp 188-193, issn 0098-5589Article

Optimal prepaging and font cachingFUCHS, D. R; KNUTH, D. E.ACM transactions on programming languages and systems. 1985, Vol 7, Num 1, pp 62-79, issn 0164-0925Article

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

ADAPTIVE VARIATION OF THE TRANSFER UNIT IN A STORAGE HIERARCHYFRANASZEK PA; BENNETT BT.1978; I.B.M.J. RES. DEVELOP.; USA; DA. 1978; VOL. 22; NO 4; PP. 405-412; BIBL. 7 REF.Article

EXACTITUDE DE MODELES MATHEMATIQUES DE L'UNITE DE PAGINATION D'UN ORDINATEUR.VICARD J.1977; R.A.I.R.O., INFORMAT.; FR.; DA. 1977; VOL. 11; NO 3; PP. 287-299; ABS. ANGL.; BIBL. 13 REF.Article

MITTLERE GUELTIGKEITSDAUER VON SPEICHERZUSTAENDEN ALS VERGLEICHSKRITERIUM FUER ERSETZUNGS-STRATEGIEN IN VIRTUELLEN SPEICHER-SYSTEMEN. = TEMPS DE VIE MOYEN DES ETATS DE LA MEMOIRE SERVANT DE CRITERE DE COMPARAISON POUR LES STRATEGIES DE REMPLACEMENT DANS LES SYSTEMES A MEMOIRE VIRTUELLEWEBER G.1976; ELEKTRON. RECHENANLAGEN; DTSCH.; DA. 1976; VOL. 18; NO 5; PP. 220-223; ABS. ANGL.; BIBL. 5 REF.Article

A virtual memory system for picture processingWADA, T.Communications of the ACM. 1984, Vol 27, Num 5, pp 444-454, issn 0001-0782Article

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

ALGORITHMES DE DETERMINATION DE L'ENSEMBLE DES PAGES (SEGMENTS) ACTIVES D'UN PROGRAMME, BASES SUR LA NOTION DE CYCLE DYNAMIQUEKUTEPOV VP; P'YANKOV VP.1979; PROGRAMMIROVANIE; SUN; DA. 1979; NO 4; PP. 44-52; BIBL. 7 REF.Article

ZUR VERBESSERUNG DER LOKALITAET IM ZUGRIFF AUF FELDER = AMELIORATION DE LA LOCALITE EN REFERENCE DE DONNEESWALDSCHMIDT H.1979; COMPUTING; AUT; DA. 1979; VOL. 22; NO 3; PP. 211-224; ABS. ENG; BIBL. 13 REF.Article

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

SORTIEREN BEI VIRTUELLEM SPEICHER. = TRI A L'AIDE DE MEMOIRES VIRTUELLESWALDSCHMIDT H.1977; COMPUTING; AUSTR.; DA. 1977; VOL. 19; NO 1; PP. 1-14; ABS. ANGL.; BIBL. 3 REF.Article

ANALYSIS OF DESIGN ALTERNATIVES FOR VIRTUAL MEMORY INDEXES.MARUYAMA K; SMITH SE.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 4; PP. 245-254; BIBL. 18 REF.Article

OPTIMAL CONTROL OF DEMAND-PAGING SYSTEMS.LEW A.1976; INFORM. SCI.; U.S.A.; DA. 1976; VOL. 10; NO 4; PP. 319-330; BIBL. 21 REF.Article

A COMBINATORIAL OPTIMIZATION PROBLEM RELATED TO DATA SET ALLOCATION.WONG CK; CHI CHIH YAO A.1976; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., B; FR.; DA. 1976; VOL. 10; NO 5; PP. 83-95; BIBL. 8 REF.Article

MINIMIZATION OF DEMAND PAGING FOR THE LRU STACK MODEL OF PROGRAM BEHAVIORWOOD C; FERNANDEZ EB; LANG T et al.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 2; PP. 99-104; BIBL. 5 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