垃圾收集对象的空间和时间效率哈希

Theory Pract. Object Syst. Pub Date : 1999-04-01 DOI:10.1002/(SICI)1096-9942(1999)5:2<119::AID-TAPO5>3.3.CO;2-H

Ole Agesen

{"title":"垃圾收集对象的空间和时间效率哈希","authors":"Ole Agesen","doi":"10.1002/(SICI)1096-9942(1999)5:2<119::AID-TAPO5>3.3.CO;2-H","DOIUrl":null,"url":null,"abstract":"The hashCode() method found in the JavaTM programming language, and similar methods in other languages, map an arbitrary object to an integer value that is constant for the lifetime of the object. We review existing implementations of the hash operation, specifying the kinds of memory systems for which they work. Then we propose a new implementation of hashing for the hardest case: memory systems with compaction and direct pointers. Our proposal uses just two bits of space per object for the (majority of) objects that are never hashed. © 1999 John Wiley & Sons, Inc.","PeriodicalId":293061,"journal":{"name":"Theory Pract. Object Syst.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Space and Time-Efficient Hashing of Garbage-Collected Objects\",\"authors\":\"Ole Agesen\",\"doi\":\"10.1002/(SICI)1096-9942(1999)5:2<119::AID-TAPO5>3.3.CO;2-H\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The hashCode() method found in the JavaTM programming language, and similar methods in other languages, map an arbitrary object to an integer value that is constant for the lifetime of the object. We review existing implementations of the hash operation, specifying the kinds of memory systems for which they work. Then we propose a new implementation of hashing for the hardest case: memory systems with compaction and direct pointers. Our proposal uses just two bits of space per object for the (majority of) objects that are never hashed. © 1999 John Wiley & Sons, Inc.\",\"PeriodicalId\":293061,\"journal\":{\"name\":\"Theory Pract. Object Syst.\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theory Pract. Object Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1096-9942(1999)5:2<119::AID-TAPO5>3.3.CO;2-H\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory Pract. Object Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1096-9942(1999)5:2<119::AID-TAPO5>3.3.CO;2-H","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Space and Time-Efficient Hashing of Garbage-Collected Objects

The hashCode() method found in the JavaTM programming language, and similar methods in other languages, map an arbitrary object to an integer value that is constant for the lifetime of the object. We review existing implementations of the hash operation, specifying the kinds of memory systems for which they work. Then we propose a new implementation of hashing for the hardest case: memory systems with compaction and direct pointers. Our proposal uses just two bits of space per object for the (majority of) objects that are never hashed. © 1999 John Wiley & Sons, Inc.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theory Pract. Object Syst.

自引率

0.00%

发文量