发布求助
文献互助 智能选刊 最新文献

Proceedings Real-Time Technology and Applications Symposium最新文献

筛选
英文 中文
Applying imprecise algorithms to real-time image and video transmission 将不精确算法应用于实时图像和视频传输
Proceedings Real-Time Technology and Applications Symposium Pub Date : 1995-05-15 DOI: 10.1109/RTTAS.1995.516206
Xiao-ge Huang, A. Cheng
{"title":"Applying imprecise algorithms to real-time image and video transmission","authors":"Xiao-ge Huang, A. Cheng","doi":"10.1109/RTTAS.1995.516206","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516206","url":null,"abstract":"One major requirement for multimedia systems is the efficient transmission of multimedia information over a communication or computer network. Current image/video transmission techniques works well if sufficient processing power and network bandwidth are available, but do not adapt properly to a reduction in one or more of these resources. This paper proposes an image/video transmission technique, based on the imprecise computation model, which yields a balanced tradeoff between the quality of the image/video transmitted and the available time for transmission. Our experiments show that the proposed algorithm has favorable results compared to non-imprecise computation-based algorithms.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116218626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
Design and evaluation of a window-consistent replication service 设计和评估与窗口一致的复制服务
Proceedings Real-Time Technology and Applications Symposium Pub Date : 1995-05-15 DOI: 10.1109/RTTAS.1995.516215
A. Mehra, J. Rexford, F. Jahanian
{"title":"Design and evaluation of a window-consistent replication service","authors":"A. Mehra, J. Rexford, F. Jahanian","doi":"10.1109/RTTAS.1995.516215","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516215","url":null,"abstract":"Real-time applications typically operate under strict timing and dependability constraints. Although traditional data replication protocols provide fault tolerance, real-time guarantees require bounded overhead for managing this redundancy. This paper presents the design and evaluation of a window-consistent primary-backup replication service that provides timely availability of the repository by relaxing the consistency of the replicated data. The service guarantees controlled inconsistency by scheduling update transmissions from the primary to the backup(s); this ensures that client applications interact with a window-consistent repository when a backup must supplant a failed primary. Experiments on our prototype implementation show that the service handles a range of client loads while maintaining bounds on temporal inconsistency.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116449419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Non-preemptive scheduling of messages on controller area network for real-time control applications 面向实时控制应用的控制器局域网上消息的非抢占调度
Proceedings Real-Time Technology and Applications Symposium Pub Date : 1995-05-15 DOI: 10.1109/RTTAS.1995.516221
K. M. Zuberi, K. Shin
{"title":"Non-preemptive scheduling of messages on controller area network for real-time control applications","authors":"K. M. Zuberi, K. Shin","doi":"10.1109/RTTAS.1995.516221","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516221","url":null,"abstract":"Scheduling messages on the controller area network (CAN) corresponds to assigning identifiers (IDs) to messages according to their priorities. If fixed priority scheduling such as deadline monotonic (DM) is used to calculate these priorities, then in general, it will result in low schedulability. Dynamic scheduling schemes such as earliest deadline (ED) can give greater schedulability, but they are not practical for CAN because if the ID is to reflect message deadlines then a long ID must be used. This increases the length of each message to the point that ED is no better than DM. Our solution to this problem is the mixed traffic scheduler (MTS), which is a cross between ED and DM, and provides high schedulability without needing long IDs. Through simulations, we compare the performance of MTS with that of DM and ED* (an imaginary scheduler which works like ED, except it needs only short IDs). We use a realistic workload in our simulations based on messages typically found in computer integrated manufacturing. Our simulations show that MTS performs much better than DM and at the same level as ED*, except under high loads and tight deadlines, when ED* is superior.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126503618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 126
Real-time communication in FieldBus multiaccess networks 现场总线多址网络中的实时通信
Proceedings Real-Time Technology and Applications Symposium Pub Date : 1995-05-15 DOI: 10.1109/RTTAS.1995.516205
C. Han, K. Shin
{"title":"Real-time communication in FieldBus multiaccess networks","authors":"C. Han, K. Shin","doi":"10.1109/RTTAS.1995.516205","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516205","url":null,"abstract":"There has been an increasing need of timely and predictable communication services for embedded real-time systems in automated factories and industrial process controls. Work has been done on real-time communication with deadline guarantees in point-to-point, token bus/token ring/FDDI, and DQDB (Distributed Queue Dual Bus) networks. However, due to the random access nature of the CSMA/CD type multiaccess networks, they are not suitable for applications with stringent timing constraints. We consider real-time communication services with absolute deadline guarantees in multiaccess local area networks equipped with a centralized scheduler, such as the SP-50 FieldBus, an industrial standard protocol for process control and manufacturing applications. Similar to most token-passing networks, in a centralized scheduling multiaccess network, the access to the bus is controlled by a token. Only the station currently holding the token has the exclusive right to use the multiaccess bus. Unlike the token bus, token ring, or FDDI network, the multiaccess network uses a centralized token scheduling scheme and the token need not be allocated to the stations in a cyclic fashion. We show that the pinwheel and the distance-constrained scheduling techniques can be adapted to schedule the token in centralized-scheduling multiaccess networks to guarantee message deadlines.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133194324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Flexible scheduling for adaptable real-time systems 适应实时系统的灵活调度
Proceedings Real-Time Technology and Applications Symposium Pub Date : 1995-05-15 DOI: 10.1109/RTTAS.1995.516220
Robert I. Davis, S. Punnekkat, N. Audsley, A. Burns
{"title":"Flexible scheduling for adaptable real-time systems","authors":"Robert I. Davis, S. Punnekkat, N. Audsley, A. Burns","doi":"10.1109/RTTAS.1995.516220","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516220","url":null,"abstract":"Complex real time systems, such as those envisaged for autonomous vehicle control, are expected to exhibit: adaptive and dynamic behaviour, resilience to software/hardware failures and graceful degradation, under conditions of overload. Two objectives need to be met before such properties can be realised. First, critical services must be guaranteed to provide results of a minimum acceptable quality and reliability by their deadlines. Second, the utility of the system needs to be maximised. We present an approach to meeting the above objectives. This approach combines the benefits of both fixed priority preemptive and best effort scheduling: offline analysis is used to guarantee that critical timing requirements will be met, whilst at run time, a simple adaptive threshold policy arbitrates between competing optional components, enhancing the system utility obtained.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"105 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122634249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 40
The real-time behavior of dynamic memory management in C++ c++中动态内存管理的实时行为
Proceedings Real-Time Technology and Applications Symposium Pub Date : 1995-05-15 DOI: 10.1109/RTTAS.1995.516211
K. Nilsen, Hong Gao
{"title":"The real-time behavior of dynamic memory management in C++","authors":"K. Nilsen, Hong Gao","doi":"10.1109/RTTAS.1995.516211","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516211","url":null,"abstract":"Dynamic memory management is an important aspect of modern software engineering techniques based on object-oriented methodologies. Additionally, dynamic management of memory serves important roles in improving the flexibility and functionality of large software systems. However, developers of current real-time systems avoid the use of dynamic memory because they fear that the worst-case time and space requirements of typical dynamic memory managers are insufficiently bounded. The degree to which these concerns are valid is quantified by detailed measurements of several real-world workloads. A special hardware-assisted real-time garbage collection system has been designed to facilitate reliable use of dynamic memory in hard real-time systems. By analyzing the dynamic memory use of application software, the real-time developer can prove compliance with time and space constraints. Analysis techniques are presented and the real-time performance of the hardware-assisted garbage collection system is compared to that of the traditional allocators.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133609087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Improving the efficiency of supervision by software through state aggregation 通过状态聚合提高软件监管效率
Proceedings Real-Time Technology and Applications Symposium Pub Date : 1995-05-15 DOI: 10.1109/RTTAS.1995.516217
T. Savor, R. Seviora
{"title":"Improving the efficiency of supervision by software through state aggregation","authors":"T. Savor, R. Seviora","doi":"10.1109/RTTAS.1995.516217","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516217","url":null,"abstract":"Software supervision is an approach to the real time detection of failures. A software supervisor is a unit which monitors both the inputs and outputs of a real time system and reports discrepancies between observed and expected behaviors. The major difficulty with software supervision is the running time complexity of the supervisor. A significant source of running time complexity was determined to be the total number of signals at the inputs queues of specification processes for which no ordering information is known. This paper describes an approach to reduce the running time complexity of a software supervisor. The approach makes use of a transformed specification in which several state transitions are grouped into a single transition or aggregate state. This effectively reduces the number of signals at the input queues of processes. The case where the system under supervision is specified in the ITU Specification and Description Language (SDL) is considered. An algorithm to translate SDL processes into aggregate state representations is described. Use of the algorithm is exemplified with the aid of an SDL specification of a small private branch telephone exchange.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124649946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A configurable adjunct for real time systems (CARTS) 实时系统(cart)的可配置附件
Proceedings Real-Time Technology and Applications Symposium Pub Date : 1995-05-15 DOI: 10.1109/RTTAS.1995.516196
R. Mandler
{"title":"A configurable adjunct for real time systems (CARTS)","authors":"R. Mandler","doi":"10.1109/RTTAS.1995.516196","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516196","url":null,"abstract":"CARTS is a set of system services targeted to real time distributed systems and spanning a variety of architectures. CARTS was designed to support rapid application code generation through generic user interfaces, to facilitate incremental system integration and reconfiguration via file-based data, and to provide tailored functionality appropriate to each project utilizing it. The CARTS postal system controls intertask communication within and between processors using optimal transfer methods such as shared memory, backplane I/O, or network I/O. The CARTS clock services supply high resolution time of day and mission clocks synchronized system wide at initialization and maintained through all levels of interface loading and across processor restarts.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127104825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Signalling on ATM testbeds: an example ATM测试台上的信令:一个示例
Proceedings Real-Time Technology and Applications Symposium Pub Date : 1995-05-15 DOI: 10.1109/RTTAS.1995.516198
F. Hidano
{"title":"Signalling on ATM testbeds: an example","authors":"F. Hidano","doi":"10.1109/RTTAS.1995.516198","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516198","url":null,"abstract":"Due to the availability in high-speed links and switches, real-time applications such as videoconferencing have gained the interest of researchers in the fields of multimedia and high-speed networking. Videoconferencing tools such as vic have been developed and tested on some of the ATM testbeds with no support for quality of service guarantees. Mechanisms for providing quality of service guarantees for these applications need to be supported. Extensive experiments are required to validate such mechanisms and it is vital to facilitate testbeds that enable these experiments. An important functionality in such testbeds is signalling support to establish virtual circuits. The direction of signalling is discussed and an example implementation from the XUNET testbed is described.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"373 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115895826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Real-time UNIX application filestores 实时UNIX应用程序文件存储
Proceedings Real-Time Technology and Applications Symposium Pub Date : 1995-05-15 DOI: 10.1109/RTTAS.1995.516194
L. E. Heindel, V. Kasten
{"title":"Real-time UNIX application filestores","authors":"L. E. Heindel, V. Kasten","doi":"10.1109/RTTAS.1995.516194","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516194","url":null,"abstract":"From the inception of real-time computing, there has been concern about the performance of disk I/O, especially as it relates to application filestores such as those running under variants of the UNIX operating system. We present a brief discussion of UNIX filestores and show how one can easily bound the number of physical file I/Os that the UNIX operating system must perform to execute a given application process. Using the established bound for the number of physical disk I/Os, one can develop close analytical approximations of application processes elapsed running time which is of critical importance for real-time applications.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133049842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信