Antony L. Hosking
J. Eliot B. Moss
Darko Stefanovic
- 1 A. Appel. Simple generational garbage collection and fast allocation. Software: Practice and Experience, 19(2): 171-183, Feb. 1989. Google Scholar
Digital Library
- 2 C.J. Cheney. A nonrecursive list compacting algorithm. Commun. ACM, 13(11):677-678, Nov. 1970. Google ScholarDigital Library
- 3 A. Goldberg and D. Robson. Smalltalk-80: The Language and its Implementation. Addison-Wesley, 1983. Google ScholarDigital Library
- 4 R. L. Hudson, J. E. B. Moss, A. Diwan, and C. F. Weight. A language-independent garbage collector toolkit. CoINs Technical Report 91-47, University of Massachusetts, Amherst, Sept. 1991. Submitted for publication. Google ScholarDigital Library
- 5 D. W. Jones. An empirical comparison of priority-queue and event-set implementations. Commun. ACM, 29(4):300-311, Apr. 1986. Google ScholarDigital Library
- 6 K. McCall. The Smalltalk-80 benchmarks. In G. Krasner, editor, Smalltalk-80: Bits of History, Words of Advice, chapter 9, pages 153-173. Addison-Wesley, 1983.Google Scholar
- 7 J.E.B. Moss. Managing stack frames in Smalltalk. In Proceedings of the ACM SIGPLAN '86 Symposium on Interpreters and Interprez;~,,e Techniques, pages 229-240, St. Paul Minnesota, July 1987. ACM SIGPLAN Not. 22, 7 (July 1987). Google ScholarDigital Library
- 8 R. A. Shaw. Improving garbage collector performance in virtual memory. Technical Report CSL-TR-87-323, Stanford University, Mar. 1987.Google Scholar
- 9 R.A. Shaw. Empirical Analysis of a LISP System. Phi) thesis, Stanford University, Feb. 1988. Available as Technical Report CSL-TR-88-351. Google ScholarDigital Library
- 10 D.D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. In Proceedings of the ACM SIGACT Symposium on Theoty, pages 235-245, Boston, Massachusetts, Apr. 1983. Google ScholarDigital Library
- 11 D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. J. ACM, 32(3), July 1985. Google ScholarDigital Library
- 12 P. G. Sobalvarro. A lifetime-based garbage collector for LISP systems on general-purpose computers, 1988. B.S. Thesis, Dept. of EECS, Massachusetts Institute of Technology, Cambridge.Google Scholar
- 13 D. Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pages 157-167, Piltsburgh, Pennsylvania, Apr. 1984. A CM SIGPLAN Not. 19, 5 (May 1984). Google ScholarDigital Library
- 14 D. Ungar and E Jackson. Tenuring policies for generation-based storage reclamation. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 1-17, San Diego, California, Sept. 1988. ACM SIGPLAN Not. 23, 11 (Nov. 1988). Google ScholarDigital Library
- 15 D. M. Ungar. The Design and Evaluation of a High Performance Smalltalk System. ACM Distinguished Dissertations. The MIT Press, Cambridge, MA, 1987. Ph.D. Dissertation, University of California at Berkeley, Febru,'u-y 1986. Google ScholarDigital Library
- 16 P. R. Wilson, M. S. Lam, and T. G. Moher. Effective "static-graph" reorganization to improve locality in garbage-collected systems. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 177-191, Toronto, Canada, June 1991. ACM SIGPLAN Not. 26, 6 (june 1991). Google ScholarDigital Library
- 17 P. R. Wilson and T. G. Moher. Design of the Opportunistic Garbage Collector. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 23-35, New Orleans, Louisiana, Oct. 1989. ACM SIGPLAN Not. 24, 10 (Oct. 1989). Google ScholarDigital Library
- 18 B. Zorn. Barrier methods for garbage collection. Technical Report CU-CS-494-90, University of Colorado at Boulder, Nov. 1990.Google Scholar
Index Terms
- A comparative performance evaluation of write barrier implementation
Recommendations
A multiple-file write scheme for improving write performance of small files in Fast File System
Fast File System (FFS) stores files to disk in separate disk writes, each of which incurs a disk positioning (seek + rotation) limiting the write performance for small files. We propose a new scheme called co-writing to accelerate small file writes in ...
Performance evaluation of Westwood+ TCP congestion control
Internet performance symposium (IPS 2002)Westwood+ TCP is a sender-side only modification of the classic Tahoe/Reno TCP that has been recently proposed to improve fairness and efficiency of TCP. The key idea of Westwood+ TCP is to perform an end-to-end estimate of the bandwidth available for a ...
Adaptive smooth multicast protocol for multimedia transmission: Implementation details and performance evaluation
In this paper we propose a new single-rate multicast congestion control scheme named Adaptive Smooth Multicast Protocol (ASMP), for multimedia transmission over best-effort networks. The smoothness lays in the calculation and adaptation of the ...
Comments