ACM Home Page
Please provide us with feedback. Feedback
Memory accounting without partitions
Full text PdfPdf (200 KB)
Source International Symposium on Memory Management archive
Proceedings of the 4th international symposium on Memory management table of contents
Vancouver, BC, Canada
SESSION: Diverse topics table of contents
Pages: 120 - 130  
Year of Publication: 2004
ISBN:1-58113-945-4
Authors
Adam Wick  University of Utah, Salt Lake City, UT
Matthew Flatt  University of Utah, Salt Lake City, UT
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 24,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1029873.1029888
What is a DOI?

ABSTRACT

Operating systems account for memory consumption and allow for termination at the level of individual processes. As a result, if one process consumes too much memory, it can be terminated without damaging the rest of the system. This same capability can be useful within a single application that encompasses subtasks. An individual task may go wrong either because the task's code is untrusted or because the task's input is untrusted. Conventional accounting mechanisms, however, needlessly complicate communication among tasks by partitioning their object spaces. In this paper, we show how to provide applications with per-task memory accounting without per-task object partitions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
G. Back, W. C. Hsieh, and J. Lepreau. Processes in KaffeOS: Isolation, resource management, and sharing in Java. In Proceedings of the 4th Symposium on Operating Systems Design and Implementation, San Diego, CA, Oct. 2000. USENIX.
 
3
G. Back, P. Tullmann, L. Stoller, W. C. Hsieh, and J. Lepreau. Java operating systems: Design and implementation. In Proceedings of the USENIX 2000 Technical Conference, pages 197--210, San Diego, CA, June 2000.
 
4
5
6
7
8
 
9
M. Flatt. PLT MzScheme: Language manual. Technical Report TR97-280, Rice University, 1997. http://download.plt-scheme.org/doc/.
10
 
11
E. Meijer and J. Gough. Technical overview of the common language runtime.
 
12
 
13
Soper, P., specification lead. JSR 121: Application isolation API specification, 2003. http://www.jcp.org/.
 
14
A. Wick, M. Flatt, and W. Hsieh. Reachability-based memory accounting. In 2002 Scheme Workshop, Pittsburgh, Pennsylvania, October 2002.
 
15


Collaborative Colleagues:
Adam Wick: colleagues
Matthew Flatt: colleagues