1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems最新文献

筛选
英文 中文
A 2-phase N-modular redundancy algorithm 两相n模冗余算法
I. Yen, Hitesh Kapoor
{"title":"A 2-phase N-modular redundancy algorithm","authors":"I. Yen, Hitesh Kapoor","doi":"10.1109/WORDS.1999.806582","DOIUrl":"https://doi.org/10.1109/WORDS.1999.806582","url":null,"abstract":"N-modular redundancy (NMR) approach has been widely used to uniformly tolerate many types of failures. Various NMR implementations include FTMP, SIFT, C.vmp, MAFT, FTP, and Delta-4. Some of these only require loose synchronization and, hence, can be applied to general-purpose distributed systems. However, loosely synchronized systems generally incur a higher overhead. Thus, many of these approaches sacrifice parallelism to achieve a better performance. As computers are used increasingly in complex, critical systems, providing parallel processing is inevitable. We consider a system model that multiple processor groups execute tasks in parallel and concurrently access a logically shared address space (shared storage). We discuss a two-phase NMR (2P-NMR) algorithm that incurs relatively low overhead for shared storage accesses. An executor-verifier approach is used in 2P-NMR to reduce the communication cost and the two phase scheme is used to assure that the single executor does not corrupt the system state. The 2P-NMR approach is also adaptive. It achieves peak performance during failure free periods and gracefully degrades to regular NMR protocol when failures occur.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123453403","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
Task graphs for mobile code-an introduction to ITGS 移动代码的任务图- ITGS的介绍
A. Silberman, A. Stoyen
{"title":"Task graphs for mobile code-an introduction to ITGS","authors":"A. Silberman, A. Stoyen","doi":"10.1109/WORDS.1999.806595","DOIUrl":"https://doi.org/10.1109/WORDS.1999.806595","url":null,"abstract":"We present ITGS, the Integrated Task Graph System. ITGS is a combined specification and analysis system for the design of complex real-time system, in particular those involving mobile code. ITGS data structures and analysis algorithms will be used throughout a systems design cycle. In addition, ITGS will either contain or interface with CASE tools and a run-time system or systems in order to provide \"cradle-to-grave\" support based upon the task-graph model.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132540397","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
Dynamic modeling of replicated objects for dependable soft real-time distributed object systems 可靠软实时分布式对象系统中复制对象的动态建模
V. Kalogeraki, L. Moser, P. Melliar-Smith
{"title":"Dynamic modeling of replicated objects for dependable soft real-time distributed object systems","authors":"V. Kalogeraki, L. Moser, P. Melliar-Smith","doi":"10.1109/WORDS.1999.806561","DOIUrl":"https://doi.org/10.1109/WORDS.1999.806561","url":null,"abstract":"Soft real time distributed object systems that must be dependable typically replicate application objects on different processors within the distributed system. The paper presents an algorithm for determining the degree of replication of each application object, that aims to maximize the system utility while respecting the resource constraints. The system utility captures the relative importance of the individual objects for the application tasks and the relative rewards of executing the application tasks. The algorithm determines an initial replication degree for each application object and adjusts the replication degree dynamically at run time.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121895692","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}
引用次数: 10
A rate-based message scheduling paradigm 基于速率的消息调度范例
Hung-Ying Tyan, J. Hou
{"title":"A rate-based message scheduling paradigm","authors":"Hung-Ying Tyan, J. Hou","doi":"10.1109/WORDS.1999.806584","DOIUrl":"https://doi.org/10.1109/WORDS.1999.806584","url":null,"abstract":"We propose a generic rate-based scheduling paradigm that can serve as a vehicle either for implementing existing well-known rate-based message scheduling algorithms, or for designing new rate-based message scheduling algorithms. The proposed scheduling paradigm is general enough to encompass a wide spectrum of rate-based scheduling algorithms and is flexible enough to allow realization of several desirable features, e.g., rate enforcement, capability of handling overbooking, and capability of providing rate parameters for traffic monitoring. Its modular design also facilitates realization of multiple scheduling algorithms in an uniform framework. Different levels of QoS can be provided to applications by invoking appropriate message schedulers implemented in the same framework. We demonstrate the use of the proposed scheduling paradigm by implementing the following two well-known families of message scheduling algorithms: (1) Virtual-Clock and its variations Self-Clocked Pair Queuing and Leap Forward Virtual Clock, and (2) Generalized Processor Sharing (or Weighted Fair Queuing) and its realistic implementations Packet-by-Packet Generalized Processor Sharing and Worst-case Fair Weighted Fair Queuing. We also design a simple message scheduling algorithm, called FIFO-r, using the paradigm, and derive analytically both the actual service rate and the end-to-end delay under FIFO-r.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129394145","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}
引用次数: 9
Dependability of on-line optimization techniques in real-time applications 在线优化技术在实时应用中的可靠性
B. Hamidzadeh, S. Shekhar
{"title":"Dependability of on-line optimization techniques in real-time applications","authors":"B. Hamidzadeh, S. Shekhar","doi":"10.1109/WORDS.1999.806576","DOIUrl":"https://doi.org/10.1109/WORDS.1999.806576","url":null,"abstract":"Real-time problem solvers require dependable, real-time search algorithms to meet task deadlines and to predict deadline violations. Presently it is difficult for existing real-time search algorithms to search and execute the solution by the deadline and to make deadline violation prediction. We introduce a real-time search algorithm called Self-Adjusting Real-Time Search (SARTS). Given a timing constraint, SARTS adjusts itself based on the remaining time to deadline and allocates the planning time. As the timing constraints are relaxed, it will continue to improve its solutions progressively. The algorithm is able to predict deadline violations. Theoretical analyses and experimental results reveal that, compared to the existing techniques, SARTS demonstrates a higher degree of predictability and a higher deadline compliance ability.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122034987","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
Measuring OS support for real-time CORBA ORBs 测量操作系统对实时CORBA orb的支持
D. Levine, Sergio Flores-Gaitan, C. Gill, D. Schmidt
{"title":"Measuring OS support for real-time CORBA ORBs","authors":"D. Levine, Sergio Flores-Gaitan, C. Gill, D. Schmidt","doi":"10.1109/WORDS.1999.806555","DOIUrl":"https://doi.org/10.1109/WORDS.1999.806555","url":null,"abstract":"The paper compares and evaluates the suitability of real time operating systems, VxWorks and LynxOS, and general purpose operating systems with real time extensions, Windows NT, Solaris, and Linux, for real time ORB middleware. While holding the hardware and ORB constant, we vary these operating systems and measure platform-specific variations in context switching overhead and priority inversions. Our findings illustrate that general purpose operating systems like Windows NT, Solaris, and Linux are not yet suited to meet the demands of applications with stringent QoS requirements. Although Linux provides good raw performance, its high jitter makes it unsuitable for real time applications. Both LynxOS and VxWorks do enable predictable and efficient ORB performance, however, thereby making them suitable as OS platforms for real time CORBA applications. In general, our results underscore the need for a measure-driven methodology to pinpoint sources of overhead and priority inversion in real time ORB endsystems.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126659341","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
Distributed data parallelisms: specified in Descartes and programmed in SequenceL and Java 分布式数据并行:在笛卡尔中指定,并在SequenceL和Java中编程
J. E. Urban, D. Cooke
{"title":"Distributed data parallelisms: specified in Descartes and programmed in SequenceL and Java","authors":"J. E. Urban, D. Cooke","doi":"10.1109/WORDS.1999.806568","DOIUrl":"https://doi.org/10.1109/WORDS.1999.806568","url":null,"abstract":"This paper presents an overview of language approaches for the automation of distributed data parallel problem solutions. These data parallel problems are of interest to the oil industry and U.S. Federal Agencies involved in the analysis of various kinds of telemetry data. Special emphasis is placed upon major language issues facing the development of the information power grid. The paper presents an example of the type of parallelism desired in the grid. The problem is specified in Descartes. A concurrent Java solution is then presented. The Java solution contains artifacts of the design of parallel solutions. The same problem is then recast in the high level language SequenceL, in which parallelisms are implied. The SequenceL approach seems to be a good candidate for a grid oriented language, in that the abstraction relieves the problem solver of much of the burden normally required in development of parallel problem solutions.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133351087","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
Workshop summary discussions WORDS 99 研讨会总结讨论
B. Thuraisingham
{"title":"Workshop summary discussions WORDS 99","authors":"B. Thuraisingham","doi":"10.1109/WORDS.1999.806603","DOIUrl":"https://doi.org/10.1109/WORDS.1999.806603","url":null,"abstract":"This note describes the summary of discussions that took place at the end of the workshop during WORDS 99. The focus was on two aspects: the focus of WORDS and the topics of interest to the group. We elaborate on these two aspects here as well as discuss some conclusions.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134397350","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
Two CORBA services enabling TMO network programming 支持TMO网络编程的两个CORBA服务
K. Kim, E. Shokri
{"title":"Two CORBA services enabling TMO network programming","authors":"K. Kim, E. Shokri","doi":"10.1109/WORDS.1999.806557","DOIUrl":"https://doi.org/10.1109/WORDS.1999.806557","url":null,"abstract":"In facilitating efficient construction of real time distributed computing applications composed of CORBA-compliant components, there are practical advantages in keeping the core component of the CORBA standards, i.e., ORB and interface definition language (IDL), unchanged or minimally changed. This means to bring new mechanisms and capabilities for real time computing support in the form of CORBA services. The paper discusses how this \"minimal-extension\" strategy can be realized. We focus on the design and implementation of a middleware providing execution support for the time-triggered message-triggered object (TMO) structured CORBA applications. The TMO structuring scheme is a syntactically simple and natural but semantically powerful extension of the conventional object structuring approaches. The strategy discussed is to provide the additional capabilities for executing and connecting TMO-structured CORBA-compliant components via two CORBA services: TMO Execution Support (TMOES) and Cooperating Network Configuration Management (CNCM). Both services can be implemented in the form of distributed computing middleware consisting of CORBA-compliant objects.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130101512","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
System engineering encapsulation of reliability techniques 可靠性技术的系统工程封装
Yusen Lin, S. Bhattacharya
{"title":"System engineering encapsulation of reliability techniques","authors":"Yusen Lin, S. Bhattacharya","doi":"10.1109/WORDS.1999.806572","DOIUrl":"https://doi.org/10.1109/WORDS.1999.806572","url":null,"abstract":"Development of an end-to-end software system requires comprehensive reliability-driven treatment. Therefore, all phases of the system engineering life-cycle require adequate treatment from the reliability perspective. Research in software engineering also indicates that early removal of faults is critical to the success of a reliable software system. A combined treatment of reliability engineering and software life-cycle can provide the capability of reliability estimation to designers to help them clarify, analyze and verify the reliability requirement in the early phases of the life-cycle. The broad goal of our research is to provide a computer aided reliability engineering (CARE) tool that can be used across the software development life-cycle. We present a reliability based software development process and an end-to-end reliability estimation of a multi-module software system. The end-to-end reliability estimation analyzes the reliability parameters of each module (or components) as well as the data and control flows among them to provide accurate reliability parameters of the software system. The reliability information can be used in high level design phases as well as in testing. We propose a multi-module based reliability estimation approach that, by using a resolution function, can model the fault propagation amongst the modules and links. This approach includes both data and control flow structure of the program, as well as provisions for looping structure in the program. Implementation issues of this approach to the CARE tool is discussed.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134499622","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学术官方微信