{"title":"生成的顺序保留实时垃圾收集","authors":"Hiroshi Koide","doi":"10.1109/RTCSA.1995.528767","DOIUrl":null,"url":null,"abstract":"This paper proposes a new real-time garbage collection that always preserves the order of object creation. Some programming languages and application programs need to preserve the generated order of objects. The proposed method is the first type of the garbage collection that can be used to make them run in real-time. Since the generated order preserving scavenging garbage collection is partly employed, the complexity of the proposed method is not related to the heap size. The requirements for the real-time processing is also presented.","PeriodicalId":111365,"journal":{"name":"Proceedings Second International Workshop on Real-Time Computing Systems and Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The generated order preserving real-time garbage collection\",\"authors\":\"Hiroshi Koide\",\"doi\":\"10.1109/RTCSA.1995.528767\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new real-time garbage collection that always preserves the order of object creation. Some programming languages and application programs need to preserve the generated order of objects. The proposed method is the first type of the garbage collection that can be used to make them run in real-time. Since the generated order preserving scavenging garbage collection is partly employed, the complexity of the proposed method is not related to the heap size. The requirements for the real-time processing is also presented.\",\"PeriodicalId\":111365,\"journal\":{\"name\":\"Proceedings Second International Workshop on Real-Time Computing Systems and Applications\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Second International Workshop on Real-Time Computing Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTCSA.1995.528767\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Second International Workshop on Real-Time Computing Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTCSA.1995.528767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The generated order preserving real-time garbage collection
This paper proposes a new real-time garbage collection that always preserves the order of object creation. Some programming languages and application programs need to preserve the generated order of objects. The proposed method is the first type of the garbage collection that can be used to make them run in real-time. Since the generated order preserving scavenging garbage collection is partly employed, the complexity of the proposed method is not related to the heap size. The requirements for the real-time processing is also presented.