Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Applying priorities to memory allocation

Publiceringsår: 2003
Språk: Engelska
Sidor: 108-118
Publikation/Tidskrift/Serie: ACM SIGPLAN Notices ( MSP 2002 and ISMM 2002)
Volym: 38
Nummer: 2
Dokumenttyp: Konferensbidrag
Förlag: ACM


A novel approach of applying priorities to memory allocation is presented and it is shown how this can be used to enhance the robustness of real-time applications. The proposed mechanisms can also be used to increase performance of systems with automatic memory management by limiting the amount of garbage collection work. A way of introducing priorities for memory allocation in a Java system without making any changes to the syntax of the language is proposed and this has been implemented in an experimental Java virtual machine and verified in an automatic control application.


  • Computer Science
  • real-time garbage collection
  • memory allocation
  • robustness
  • embedded
  • systems


MSP 2002 and ISMM 2002
  • ISSN: 0362-1340

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen