{"title":"RTO调度的RT-HashQ","authors":"Seung-Min Yang, Sheen Lee, Hyung-Taek Lim, Sung-Heun Oh","doi":"10.1109/ISORC.1998.666776","DOIUrl":null,"url":null,"abstract":"As real-time systems become larger and more complex, attempts to apply the object-oriented paradigm to real-time systems are being made. We introduce a real-time object (RTO) model that is suitable for dynamic real-time environments. We also propose a scheduling algorithm and an implementation of a real-time scheduler for the RTO model. We developed the LLF/MP scheduling algorithm that is good for dynamic real-time environments. A real-time scheduler for the RTO model and LLF/MP scheduling algorithm must guarantee the temporal constraints of both the real-time method and the real-time message, and support an infinite real-time queue efficiently, which LLF/MP needs. To solve these problems, we propose a data structure, RT-HashQ (Real-Time-Hash Queue).","PeriodicalId":186028,"journal":{"name":"Proceedings First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC '98)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"RT-HashQ for RTO scheduling\",\"authors\":\"Seung-Min Yang, Sheen Lee, Hyung-Taek Lim, Sung-Heun Oh\",\"doi\":\"10.1109/ISORC.1998.666776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As real-time systems become larger and more complex, attempts to apply the object-oriented paradigm to real-time systems are being made. We introduce a real-time object (RTO) model that is suitable for dynamic real-time environments. We also propose a scheduling algorithm and an implementation of a real-time scheduler for the RTO model. We developed the LLF/MP scheduling algorithm that is good for dynamic real-time environments. A real-time scheduler for the RTO model and LLF/MP scheduling algorithm must guarantee the temporal constraints of both the real-time method and the real-time message, and support an infinite real-time queue efficiently, which LLF/MP needs. To solve these problems, we propose a data structure, RT-HashQ (Real-Time-Hash Queue).\",\"PeriodicalId\":186028,\"journal\":{\"name\":\"Proceedings First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC '98)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC '98)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISORC.1998.666776\",\"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 First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC '98)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORC.1998.666776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
As real-time systems become larger and more complex, attempts to apply the object-oriented paradigm to real-time systems are being made. We introduce a real-time object (RTO) model that is suitable for dynamic real-time environments. We also propose a scheduling algorithm and an implementation of a real-time scheduler for the RTO model. We developed the LLF/MP scheduling algorithm that is good for dynamic real-time environments. A real-time scheduler for the RTO model and LLF/MP scheduling algorithm must guarantee the temporal constraints of both the real-time method and the real-time message, and support an infinite real-time queue efficiently, which LLF/MP needs. To solve these problems, we propose a data structure, RT-HashQ (Real-Time-Hash Queue).