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

Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)最新文献

筛选
英文 中文
Load adjustment and filtering based on process criticality 基于过程临界的负载调整和过滤
Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236) Pub Date : 1998-10-27 DOI: 10.1109/RTCSA.1998.726334
Tei-Wei Kuo, Shie-Kai Ni, Giun-Haur Huang
{"title":"Load adjustment and filtering based on process criticality","authors":"Tei-Wei Kuo, Shie-Kai Ni, Giun-Haur Huang","doi":"10.1109/RTCSA.1998.726334","DOIUrl":"https://doi.org/10.1109/RTCSA.1998.726334","url":null,"abstract":"This paper generalizes the load scaling techniques proposed in (Kuo and Mok, 1991) for fixed-priority real-time applications. A framework is proposed to adjust the system workload by relating the criticality and flexibility of a process to the resource allocation problem. A load adjustment procedure based on the approximation algorithm (Ni et al., 1997) is proposed to maximize the system profit in an on-line fashion. When the list of allowable configurations is implicitly given by scalable periodic processes, the corresponding load filtering problem is shown to be NP-complete. We also prove the upper bound of the system profit and provide a mechanism to balance the schedulability and the maximum profit of the system.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"10 26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132286442","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
Continuous media filesystem services on a real-time JAVA server 实时JAVA服务器上的连续媒体文件系统服务
Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236) Pub Date : 1998-10-27 DOI: 10.1109/RTCSA.1998.726424
A. Molano, A. Miyoshi, H. Tokuda, R. Rajkumar
{"title":"Continuous media filesystem services on a real-time JAVA server","authors":"A. Molano, A. Miyoshi, H. Tokuda, R. Rajkumar","doi":"10.1109/RTCSA.1998.726424","DOIUrl":"https://doi.org/10.1109/RTCSA.1998.726424","url":null,"abstract":"We investigate filesystem support for continuous media on the Java language. We describe a prototype implementation on a Real-Time Java Server, developed as an application level server on the Real-Time Mach microkernel environment. The Java virtual machine has been extended to support filesystem bandwidth reservation facilities existing on Real-Time Mach. Such facilities allow continuous media applications to specify their disk bandwidth usage requirements by creating a disk bandwidth reservation. The operating system, upon acceptance of the requests, internally enforces and guarantees such a share of the disk bandwidth for every active reservation. We present a performance evaluation, including both a synthetic application and real multimedia application based on a QuickTime video player which make use of real time Java threads and filesystem bandwidth reservation facilities. Our experiments conclude that the proposed filesystem extensions to the Java language are suitable for continuous media application requirements.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124852541","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}
引用次数: 1
Analysis of real-time backplane bus network based on write posting 基于写发布的实时背板母线网分析
Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236) Pub Date : 1998-10-27 DOI: 10.1109/RTCSA.1998.726413
Minyoung Sung, Taehyoun Kim, N. Chang, Heonshik Shin
{"title":"Analysis of real-time backplane bus network based on write posting","authors":"Minyoung Sung, Taehyoun Kim, N. Chang, Heonshik Shin","doi":"10.1109/RTCSA.1998.726413","DOIUrl":"https://doi.org/10.1109/RTCSA.1998.726413","url":null,"abstract":"The backplane bus network protocol is a mechanism to facilitate the standard networking on the backplane bus. Usually a link-level network protocol is designed and implemented to provide the bus networking. In this paper we introduce a scheduling analysis for real-time communication in the backplane network. Unlike traditional communication analysis, we must consider the write posting, a feature of the bus interface which improves the overall schedulability dramatically. For an exact real-time analysis, a methodology is also developed to model the timing behavior of the bus.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114919093","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}
引用次数: 1
An architecture for a QOS-based mobile agent system 基于qos的移动代理系统体系结构
Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236) Pub Date : 1998-10-27 DOI: 10.1109/RTCSA.1998.726410
M. Kone, T. Nakajima
{"title":"An architecture for a QOS-based mobile agent system","authors":"M. Kone, T. Nakajima","doi":"10.1109/RTCSA.1998.726410","DOIUrl":"https://doi.org/10.1109/RTCSA.1998.726410","url":null,"abstract":"Improving quality of service (QoS) has always been a challenging task. On one hand a user or an application makes subjective QoS requests; on the other hand, a number of host machines are ready to provide resources to satisfy these requests. The architecture we propose in the paper helps build an efficient link between a user and the resource providers. This architecture implements the mobile agent technology and the concept behind the logical disk interface introduced by M. Wiebren de Jonge et al. (1993) by clearly separating QoS negotiation and resource management. Here, the mobile agent system takes care of the QoS negotiation process and the virtual host manages-allocates, reserves and deallocates-needed resources. Mobile agents help reduce network traffic through remote programming and virtual hosts handle environmental changes transparently.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132572636","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}
引用次数: 4
Dynamic transaction scheduling and reallocation in overloaded real-time database systems 超载实时数据库系统中的动态事务调度与再分配
Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236) Pub Date : 1998-10-27 DOI: 10.1109/RTCSA.1998.726430
J. Hansson, S. Son, J. Stankovic, S. F. Andler
{"title":"Dynamic transaction scheduling and reallocation in overloaded real-time database systems","authors":"J. Hansson, S. Son, J. Stankovic, S. F. Andler","doi":"10.1109/RTCSA.1998.726430","DOIUrl":"https://doi.org/10.1109/RTCSA.1998.726430","url":null,"abstract":"We introduce a novel scheduling architecture with a new algorithm for dynamically resolving transient overloads, that is executed when a new transaction cannot be admitted to the system due to scarce resources. The resolver algorithm generates a cost effective overload resolution plan which, in order to admit the new transaction, finds the required time by de-allocating time among the previously admitted but not yet completed transactions. Considering the cost efficiency of executing the plan and the importance of the new transaction a decision is made whether to execute the plan and admit the new transaction, or to reject it. We consider a multi-class transaction workload consisting of hard critical and firm transactions, where critical transactions have contingency transactions that can be invoked during overloads. We present a performance analysis showing to what degree the overload resolver enforces predictability and ensures the timeliness of critical transactions when handling extreme overload scenarios in real-time database systems.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128620419","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}
引用次数: 23
Hierarchical design method for real-time distributed systems 实时分布式系统的分层设计方法
Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236) Pub Date : 1998-10-27 DOI: 10.1109/RTCSA.1998.726416
S. Yamane
{"title":"Hierarchical design method for real-time distributed systems","authors":"S. Yamane","doi":"10.1109/RTCSA.1998.726416","DOIUrl":"https://doi.org/10.1109/RTCSA.1998.726416","url":null,"abstract":"Distributed systems are very large and complex and timing constraints are important for some communication delay. Moreover, as each process is evolutional, it needs to behave however the environment behaves. The author proposes a design method. He defines open timed automata and receptiveness, verification methods of the receptiveness and consistency check, and the Assume-Guarantee style verification method.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124051533","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
A delay-constrained least-cost path routing protocol and the synthesis method 一种时延约束的最小代价路径路由协议及其综合方法
Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236) Pub Date : 1998-10-27 DOI: 10.1109/RTCSA.1998.726352
K. Ishida, K. Amano, Naoki Kannari
{"title":"A delay-constrained least-cost path routing protocol and the synthesis method","authors":"K. Ishida, K. Amano, Naoki Kannari","doi":"10.1109/RTCSA.1998.726352","DOIUrl":"https://doi.org/10.1109/RTCSA.1998.726352","url":null,"abstract":"Real-time communication services will be one of the most promising future applications in both the B-ISDN and Internet. In addition, real-time traffic usually utilizes a significant amount of resources while traversing the network. Thus there is the need for routing mechanisms which are able to satisfy requirements of both real-time traffic and efficient management of network resources. Firstly we discuss an issue of routing of real-time traffic subject to each end-to-end delay constraint and a path cost. Then, we describe a key concept which is taken into consideration of the requirements simultaneously. Based on the requirements, a delay constrained least-cost path problem is formulated. Since the problem is NP-hard, a heuristic method is proposed to solve the problem. The heuristic method can always find a delay-constrained path between a source node and a destination node, if there is such a path. Based on the heuristic method, an outline of the synthesis method for the delay-constrained least-cost path routing protocol is also presented.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114502177","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}
引用次数: 19
Wait-free snapshots in real-time systems: algorithms and performance 实时系统中的无等待快照:算法和性能
Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236) Pub Date : 1998-10-27 DOI: 10.1109/RTCSA.1998.726426
Andreas Ermedahl, H. Hansson, M. Papatriantafilou, P. Tsigas
{"title":"Wait-free snapshots in real-time systems: algorithms and performance","authors":"Andreas Ermedahl, H. Hansson, M. Papatriantafilou, P. Tsigas","doi":"10.1109/RTCSA.1998.726426","DOIUrl":"https://doi.org/10.1109/RTCSA.1998.726426","url":null,"abstract":"Snap-shot mechanisms are used to read a globally consistent set of variable values. Methods based on locking are penalized by blocking, which typically leads to difficulties in guaranteeing deadlines of high priority tasks. A method which combines the predictability of locking-based methods with the low interference (no blocking) of lock-free methods is desirable. In this paper we present one such method, based and the concept of wait-freeness. A wait-free method is a lock-free method which is guaranteed to correctly complete in a bounded number of steps. The price to pay for this predictability in the timing domain is the need for more than one copy of the shared objects. We evaluate our method analytically by formulating and comparing schedulability equations for snapshots in systems using lock-based lock-free and our wait-free method. We also outline ideas to study the effects of using the different snapshot methods in distributed (CAN-based) systems.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"179 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120968312","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}
引用次数: 12
Rate-based QoS control of multiple flows over a real-time OS 基于速率的实时操作系统多流QoS控制
Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236) Pub Date : 1998-10-27 DOI: 10.1109/RTCSA.1998.726355
Y. Tobe, Y. Tamura, H. Tokuda
{"title":"Rate-based QoS control of multiple flows over a real-time OS","authors":"Y. Tobe, Y. Tamura, H. Tokuda","doi":"10.1109/RTCSA.1998.726355","DOIUrl":"https://doi.org/10.1109/RTCSA.1998.726355","url":null,"abstract":"When multiple flows including continuous media streams are simultaneously sent from a computer, allocation, and management of both processor capacity and network bandwidth need to be considered. We propose a framework of Quality of Service (QoS) management inside a sending host that controls execution of sending threads in consideration of utilization of processor capacity and network bandwidth. To distinguish from flows which require only best effort service, we call a flow which requires a specific rate of service \"reserved flow\". To guarantee QoS of such reserved flow both in processor- and network-intensive cases in a sending host, processor capacity reserve is allocated such that the rate of each reserved flow is attained and non conforming data are policed before they are transmitted. Processor Capacity Manager and the network device driver exchange information in a cooperative manner to support the rate adaptive allocation of processor capacity reserve. We describe design and implementation of our framework on RT-Mach. The results of performance evaluations demonstrate that our scheme performs well for full-duplex Ethernet.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134011591","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}
引用次数: 1
SM: real-time multicast protocols for simultaneous message delivery SM:用于同步消息传递的实时多播协议
Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236) Pub Date : 1998-10-27 DOI: 10.1109/RTCSA.1998.726353
J. Pulido, Kwei-Jay Lin
{"title":"SM: real-time multicast protocols for simultaneous message delivery","authors":"J. Pulido, Kwei-Jay Lin","doi":"10.1109/RTCSA.1998.726353","DOIUrl":"https://doi.org/10.1109/RTCSA.1998.726353","url":null,"abstract":"Traditionally, a multicast message is sent once by a sender. All receivers will receive the same message but may receive it at different times. This may result in unfair advantage for some receivers. Simultaneous Multicast (SM) applications require that all receivers receive the same message at the same time. SM protocols therefore need to meet a strict deadline to ensure that each receiver will receive a message at the same time, regardless of the network conditions, heterogeneity of the environment and differences between the local clocks in the receivers. Such a real time SM protocol is proposed so that the coordinated deadline can be met by controlling the reserved bandwidth and without the overhead of clock synchronization. A sensing protocol is also proposed to continuously search for better levels of quality and to avoid the overhead of an external feedback protocol. The protocols are bandwidth conscious, enforce fairness and provide scalability.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114970061","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}
引用次数: 7
首页 上一页 下一页 尾页
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学术官方微信