Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Garbage Collection")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 224

  • Page / 9
Export

Selection :

  • and

Mostly concurrent garbage collection revisitedBARABASH, Katherine; OSSIA, Yoav; PETRANK, Erez et al.ACM SIGPLAN notices. 2003, Vol 38, Num 11, pp 255-268, issn 1523-2867, 14 p.Conference Paper

An on-the-fly mark and sweep garbage collector based on sliding viewsAZATCHI, Hezi; LEVANONI, Yossi; PAZ, Harel et al.ACM SIGPLAN notices. 2003, Vol 38, Num 11, pp 269-281, issn 1523-2867, 13 p.Conference Paper

Connectivity-based garbage collectionHIRZEL, Martin; DIWAN, Amer; HERTZ, Matthew et al.ACM SIGPLAN notices. 2003, Vol 38, Num 11, pp 359-373, issn 1523-2867, 15 p.Conference Paper

Heap compression for memory-constrained Java environmentsCHEN, G; KANDEMIR, M; VIJAYKRISHNAN, N et al.ACM SIGPLAN notices. 2003, Vol 38, Num 11, pp 282-301, issn 1523-2867, 20 p.Conference Paper

Deriving escape analysis by abstract interpretationHILL, Patricia M; SPOTO, Fausto.Higher-order and symbolic computation. 2006, Vol 19, Num 4, pp 415-463, issn 1388-3690, 49 p.Article

Thread-local heaps for JavaDOMANI, Tamar; GOLDSHTEIN, Gal; KOLODNER, Elliot K et al.ACM SIGPLAN notices. 2003, Vol 38, Num 2, pp 183-194, issn 1523-2867, 12 p., SUPConference Paper

Reducing pause time of conservative collectorsENDO, Toshio; TAURA, Keniiro.ACM SIGPLAN notices. 2003, Vol 38, Num 2, pp 119-131, issn 1523-2867, 13 p., SUPConference Paper

Adaptive garbage collection and experiments for implementationTANAKA, E; TANAKA, Y; NAKANISHI, M et al.Systems and computers in Japan. 1995, Vol 26, Num 12, pp 8-16, issn 0882-1666Article

Garbage collection in a distributed object-oriented systemGUPTA, A; FUCHS, W. K.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 2, pp 257-265, issn 1041-4347Article

Reducing object storage requirements in a multi-user environment = Besoins de réduction du stockage d'objet dans un environnement multi-utilisateurBOYSEN, P; SHAH, P.Software, practice & experience. 1993, Vol 23, Num 3, pp 235-241, issn 0038-0644Article

BIT : A very compact scheme system for microcontrollersDUBE, Danny; FEELEY, Marc.Higher-order and symbolic computation. 2005, Vol 18, Num 3-4, pp 271-298, issn 1388-3690, 28 p.Article

Generational cyclic reference countingLINS, R. D.Information processing letters. 1993, Vol 46, Num 1, pp 19-20, issn 0020-0190Article

Garbage collection can be faster than stack allocationAPPEL, A. W.Information processing letters. 1987, Vol 25, Num 4, pp 275-279, issn 0020-0190Article

Stop-and-copy and one-bit reference countingWISE, D. S.Information processing letters. 1993, Vol 46, Num 5, pp 243-249, issn 0020-0190Article

The Transactional Memory / Garbage Collection AnalogyGROSSMAN, Dan.ACM SIGPLAN notices. 2007, Vol 42, Num 10, pp 695-706, issn 1523-2867, 12 p.Conference Paper

The compressor : Concurrent, incremental, and parallel compactionKERMANY, Haim; PETRANK, Erez.ACM SIGPLAN notices. 2006, Vol 41, Num 6, pp 354-363, issn 1523-2867, 10 p.Conference Paper

An efficient parallel heap compaction algorithmABUAIADH, Diab; OSSIA, Yoav; PETRANKT, Erez et al.ACM SIGPLAN notices. 2004, Vol 39, Num 10, pp 224-236, issn 1523-2867, 13 p.Conference Paper

Orthogonal persistance in a heterogenous distributed object-oriented environmentSOUSA, P; ZUQUETE, A; NEVES, N et al.Computer journal (Print). 1994, Vol 37, Num 6, pp 531-541, issn 0010-4620Article

A NEW FAST AND SAFE MARKING ALGORITHMKUROKAWA T.1981; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1981; VOL. 11; NO 7; PP. 671-682; BIBL. 9 REF.Article

AN EXERCISE IN PROVING PARALLEL PROGRAMS CORRECT.GRIES D.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 12; PP. 921-930; BIBL. 7 REF.Article

Complete distributed garbage collection: an experience with RotorVEIGA, L; FERREIRA, P.IEE Proceedings - Software (Print). 2003, Vol 150, Num 5, pp 283-290, issn 1462-5970, 8 p.Conference Paper

Garbage collection of strings and linked data structures in real timeNILSEN, K.Software, practice & experience. 1988, Vol 18, Num 7, pp 613-640, issn 0038-0644Article

Swap time-aware garbage collection policy for NAND flash-based swap systemLIN, M. W; CHEN, S. Y.Electronics letters. 2013, Vol 49, Num 24, pp 1525-1526, issn 0013-5194, 2 p.Article

Customizable garbage collectorsJOKINEN, M. O.Information processing letters. 1989, Vol 30, Num 3, pp 115-118, issn 0020-0190Article

A hybrid multiple processor garbage collection algorithmNEWMAN, I. A; STALLARD, R. P; WOODWARD, M. C et al.Computer journal (Print). 1987, Vol 30, Num 2, pp 119-127, issn 0010-4620Article

  • Page / 9