Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839540
F. Schön, Wolfgang Schröder-Preikschat, O. Spinczyk, Ute Spinczyk
A crucial aspect in the design of (embedded real-time) operating systems concerns interrupt handling. This paper presents the concept of a modularized interrupt-handling subsystem that enables the synchronization of interrupt-driven, non-sequential code without the need to disabling hardware interrupts. The basic idea is to use nonblocking/optimistic concurrency sequences for synchronization inside an operating-system kernel. Originally designed for the PURE embedded operating system, the presented object-oriented implementation is highly portable not only regarding the CPU but also operating systems and yet efficient.
{"title":"On interrupt-transparent synchronization in an embedded object-oriented operating system","authors":"F. Schön, Wolfgang Schröder-Preikschat, O. Spinczyk, Ute Spinczyk","doi":"10.1109/ISORC.2000.839540","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839540","url":null,"abstract":"A crucial aspect in the design of (embedded real-time) operating systems concerns interrupt handling. This paper presents the concept of a modularized interrupt-handling subsystem that enables the synchronization of interrupt-driven, non-sequential code without the need to disabling hardware interrupts. The basic idea is to use nonblocking/optimistic concurrency sequences for synchronization inside an operating-system kernel. Originally designed for the PURE embedded operating system, the presented object-oriented implementation is highly portable not only regarding the CPU but also operating systems and yet efficient.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122690753","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}
Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839544
A. Bondavalli, F. Giandomenico
Real-time is a major characteristic of many systems, increasingly employed today in disparate sectors of our society. To specify and program systems, exhibiting real-time properties, a number of computing paradigms have been adopted, both explicitly defined to specify real-time behaviours and imported from other application areas with the addition of mechanisms to deal with real-time. The paper discusses object oriented real-time system design and tools.
{"title":"A position on design, methods, and tools for object-oriented real-time computing","authors":"A. Bondavalli, F. Giandomenico","doi":"10.1109/ISORC.2000.839544","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839544","url":null,"abstract":"Real-time is a major characteristic of many systems, increasingly employed today in disparate sectors of our society. To specify and program systems, exhibiting real-time properties, a number of computing paradigms have been adopted, both explicitly defined to specify real-time behaviours and imported from other application areas with the addition of mechanisms to deal with real-time. The paper discusses object oriented real-time system design and tools.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121966605","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}
Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839542
J. J. Li, J. R. Horgan
Specification and Description Language (SDL) is a formal object-oriented language for modelling real-time interactive systems. It is an International Telecommunication Union (ITU) standard. A software architecture is the structure of a program including a set of inter-communication components. These components are often independently executable super objects. We use the architecture design to answer questions such as how the super objects fit together and how to reuse them. We investigate the feasibility and benefits of using SDL to represent the dynamic aspect of the software architectures. It includes a methodology and an accompanying tool, Workflow-to-SDL-Transformation (W2S), for deriving software architectures in SDL from an originally informal use case flow definition. The focus of the research is in the telecom domain, many of which are real-time interactive systems. We applied our method to a partial telecom system. The experimental results are collected and presented. Our result shows the feasibility and benefits of representing the dynamic software architecture in SDL.
{"title":"Using SDL to model an object-oriented real-time software architectural design","authors":"J. J. Li, J. R. Horgan","doi":"10.1109/ISORC.2000.839542","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839542","url":null,"abstract":"Specification and Description Language (SDL) is a formal object-oriented language for modelling real-time interactive systems. It is an International Telecommunication Union (ITU) standard. A software architecture is the structure of a program including a set of inter-communication components. These components are often independently executable super objects. We use the architecture design to answer questions such as how the super objects fit together and how to reuse them. We investigate the feasibility and benefits of using SDL to represent the dynamic aspect of the software architectures. It includes a methodology and an accompanying tool, Workflow-to-SDL-Transformation (W2S), for deriving software architectures in SDL from an originally informal use case flow definition. The focus of the research is in the telecom domain, many of which are real-time interactive systems. We applied our method to a partial telecom system. The experimental results are collected and presented. Our result shows the feasibility and benefits of representing the dynamic software architecture in SDL.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124782989","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}
Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839529
L. Becker, C. Pereira, O. P. Dias, I. Teixeira, João Paulo Teixeira
The paper presents a novel approach to the automatic identification of objects/classes from a system specification. The methodology is aimed at the development of distributed real time systems (DRTS), especially those conceived for industrial automation applications. UML is used as the modeling language in conjunction with an extended version of traditional DFD (E-DFD), that conveys information on flow type (data or control) and on process complexity and timing constraints. E-DFDs are mapped into a graph and a tool is used to carry out an automatic graph partition, which allows the identification of a set of objects that constitute, from the design and test points of view, the 'best-fitted' architecture. To validate the proposed methodology, a case study is presented and analyzed, comparing two design strategies.
{"title":"MOSYS: a methodology for automatic object identification from system specification","authors":"L. Becker, C. Pereira, O. P. Dias, I. Teixeira, João Paulo Teixeira","doi":"10.1109/ISORC.2000.839529","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839529","url":null,"abstract":"The paper presents a novel approach to the automatic identification of objects/classes from a system specification. The methodology is aimed at the development of distributed real time systems (DRTS), especially those conceived for industrial automation applications. UML is used as the modeling language in conjunction with an extended version of traditional DFD (E-DFD), that conveys information on flow type (data or control) and on process complexity and timing constraints. E-DFDs are mapped into a graph and a tool is used to carry out an automatic graph partition, which allows the identification of a set of objects that constitute, from the design and test points of view, the 'best-fitted' architecture. To validate the proposed methodology, a case study is presented and analyzed, comparing two design strategies.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122254204","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}
Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839536
L. Pautet, S. Tardieu
This paper describes how GLADE, our implementation of the Ada 95 Distributed Systems Annex, can be used to build large object-oriented real-time distributed systems. In addition to the powerful distribution features included in the Ada 95 language itself, we provide extensions to help the programmer build robust and failsafe distributed applications.
{"title":"GLADE: a framework for building large object-oriented real-time distributed systems","authors":"L. Pautet, S. Tardieu","doi":"10.1109/ISORC.2000.839536","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839536","url":null,"abstract":"This paper describes how GLADE, our implementation of the Ada 95 Distributed Systems Annex, can be used to build large object-oriented real-time distributed systems. In addition to the powerful distribution features included in the Ada 95 language itself, we provide extensions to help the programmer build robust and failsafe distributed applications.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"10 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114031305","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}
Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839526
M. Ceruti, S. Joe McCarthy
The paper documents progress to date on a research project, the goal of which is wartime event prediction. It describes the operational concept, the data mining environment, and data mining techniques that use Bayesian networks for classification. Key steps in the research plan are as follows: (1) implement machine learning; (2) test the trained networks; and (3) use the technique to support a battlefield commander by predicting enemy attacks. Data for training and testing the technique can be extracted from the object oriented database that supports the Integrated Marine Multi-Agent Command and Control System (IMMACCS). These data were derived from message traffic generated during US Marine Corps exercises. The class structure in the IMMACCS data model is especially well suited to support attack classification.
{"title":"Establishing a data-mining environment for wartime event prediction with an object-oriented command and control database","authors":"M. Ceruti, S. Joe McCarthy","doi":"10.1109/ISORC.2000.839526","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839526","url":null,"abstract":"The paper documents progress to date on a research project, the goal of which is wartime event prediction. It describes the operational concept, the data mining environment, and data mining techniques that use Bayesian networks for classification. Key steps in the research plan are as follows: (1) implement machine learning; (2) test the trained networks; and (3) use the technique to support a battlefield commander by predicting enemy attacks. Data for training and testing the technique can be extracted from the object oriented database that supports the Integrated Marine Multi-Agent Command and Control System (IMMACCS). These data were derived from message traffic generated during US Marine Corps exercises. The class structure in the IMMACCS data model is especially well suited to support attack classification.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115220692","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}
Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839516
Yunming Wang, J. Talpin, A. Benveniste, P. Guernic
The synchronous model of concurrency has demonstrated its practicality for the design of circuits, embedded systems, reactive and distributed systems. This model allows to design systems around an idealized notion of deterministic concurrency, which is much easier to deal with than classical, nondeterministic, asynchronous concurrency. Compiling, optimizing, and verifying programs are done using powerful techniques. We take advantage of this rich background by presenting a translation of UML state-machines into a pivot synchronous calculus, based on mathematical notions of pre-orders, in the aim of providing an integrated development cycle for the reliable deployment of synchronous system specifications over asynchronous networks. In this paper we first present the structure of UML state-machines. Compared with earlier studies on that matter the structure under consideration supports, e.g., composite transition and history. Then, we give a brief presentation of the pivot formalism, BDL, which is used to finally give a formal semantics of UML state-machines in terms of pre-ordered transition systems.
{"title":"A semantics of UML state-machines using synchronous pre-order transition systems","authors":"Yunming Wang, J. Talpin, A. Benveniste, P. Guernic","doi":"10.1109/ISORC.2000.839516","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839516","url":null,"abstract":"The synchronous model of concurrency has demonstrated its practicality for the design of circuits, embedded systems, reactive and distributed systems. This model allows to design systems around an idealized notion of deterministic concurrency, which is much easier to deal with than classical, nondeterministic, asynchronous concurrency. Compiling, optimizing, and verifying programs are done using powerful techniques. We take advantage of this rich background by presenting a translation of UML state-machines into a pivot synchronous calculus, based on mathematical notions of pre-orders, in the aim of providing an integrated development cycle for the reliable deployment of synchronous system specifications over asynchronous networks. In this paper we first present the structure of UML state-machines. Compared with earlier studies on that matter the structure under consideration supports, e.g., composite transition and history. Then, we give a brief presentation of the pivot formalism, BDL, which is used to finally give a formal semantics of UML state-machines in terms of pre-ordered transition systems.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114465084","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}
Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839554
Khaja Qutubudin, D. Pease
Proposes a distributed computing framework for the real-time management of a large number of robots in an industrial setting. The primary design objective of this framework is to allow a centralized heterogeneous multiprocessor controller to perform real-time scheduling and evaluation of Newton-Euler equations for manipulating the robot motion. The real-time scheduling of tasks in such an environment is shown to be an NP-hard problem, for which we propose a deadline-based heuristic. A detailed simulation reveals that the proposed heuristic can achieve near-optimal performance.
{"title":"A real-time heterogeneous distributed computing environment for multi-robot system","authors":"Khaja Qutubudin, D. Pease","doi":"10.1109/ISORC.2000.839554","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839554","url":null,"abstract":"Proposes a distributed computing framework for the real-time management of a large number of robots in an industrial setting. The primary design objective of this framework is to allow a centralized heterogeneous multiprocessor controller to perform real-time scheduling and evaluation of Newton-Euler equations for manipulating the robot motion. The real-time scheduling of tasks in such an environment is shown to be an NP-hard problem, for which we propose a deadline-based heuristic. A detailed simulation reveals that the proposed heuristic can achieve near-optimal performance.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114994537","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}
Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839519
F. Sandrini, F. Giandomenico, A. Bondavalli, E. Nett
This paper deals with tolerance to timing faults in time-constrained systems. TAFT (Time Aware Fault-Tolerant) is a recently devised approach which applies tolerance to timing violations. According to TAFT, a task is structured in a pair, to guarantee that deadlines are met (although possibly offering a degraded service) without requiring the knowledge of task attributes difficult to estimate in practice. Wide margin of actions is left by the TAFT approach in scheduling the task pairs, leading to disparate performances; up to now, poor attention has been devoted to analyse this aspect. The goal of this work is to investigate on the most appropriate scheduling policies to adopt in a system structured in the TAFT fashion, in accordance with system conditions and application requirements. To this end, all experimental evaluation will be conducted based on a variety of scheduling policies, to derive useful indications for the system designer about the most rewarding policies to apply.
{"title":"Scheduling solutions for supporting dependable real-time applications","authors":"F. Sandrini, F. Giandomenico, A. Bondavalli, E. Nett","doi":"10.1109/ISORC.2000.839519","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839519","url":null,"abstract":"This paper deals with tolerance to timing faults in time-constrained systems. TAFT (Time Aware Fault-Tolerant) is a recently devised approach which applies tolerance to timing violations. According to TAFT, a task is structured in a pair, to guarantee that deadlines are met (although possibly offering a degraded service) without requiring the knowledge of task attributes difficult to estimate in practice. Wide margin of actions is left by the TAFT approach in scheduling the task pairs, leading to disparate performances; up to now, poor attention has been devoted to analyse this aspect. The goal of this work is to investigate on the most appropriate scheduling policies to adopt in a system structured in the TAFT fashion, in accordance with system conditions and application requirements. To this end, all experimental evaluation will be conducted based on a variety of scheduling policies, to derive useful indications for the system designer about the most rewarding policies to apply.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130174667","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}
Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839558
Kwang-Rok Kim
As the demands for real time distributed systems increase, the need for programming tools useful in development of such application systems is becoming increasingly acute. An issue that the research community has long recognized as an important technological challenge but has not shown much progress in meeting the challenge is to guarantee response times of real time distributed systems. Two basic problems must be solved to effectively meet this challenge: (1) to establish the distributed real time program structure and the system infrastructure structure, i.e., the structure of the operating system (OS) and the communication infrastructure, that enable systematic analysis of the worst case time behavior of the application systems; and (2) to establish a tool which performs automated analysis of the worst case time behavior while leaving only minimal work to the designers. The problem area (1) has been recognized as a research area for a long time, but only in recent years has the skeleton of a usable technical foundation started emerging. In other words, there has long been a lack of fully general and yet easily analyzable distributed real time program structures and also a lack of useful OS timing models. However, on the basis of the skeleton emerged, rapid progress is expected in the future toward establishment of a full technical foundation. Therefore, the time seems ripe for launching new larger scale attacks on problem (2) on the basis of those recent developments in handling problem (1).
{"title":"Analysis of guaranteed service times of distributed real-time objects","authors":"Kwang-Rok Kim","doi":"10.1109/ISORC.2000.839558","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839558","url":null,"abstract":"As the demands for real time distributed systems increase, the need for programming tools useful in development of such application systems is becoming increasingly acute. An issue that the research community has long recognized as an important technological challenge but has not shown much progress in meeting the challenge is to guarantee response times of real time distributed systems. Two basic problems must be solved to effectively meet this challenge: (1) to establish the distributed real time program structure and the system infrastructure structure, i.e., the structure of the operating system (OS) and the communication infrastructure, that enable systematic analysis of the worst case time behavior of the application systems; and (2) to establish a tool which performs automated analysis of the worst case time behavior while leaving only minimal work to the designers. The problem area (1) has been recognized as a research area for a long time, but only in recent years has the skeleton of a usable technical foundation started emerging. In other words, there has long been a lack of fully general and yet easily analyzable distributed real time program structures and also a lack of useful OS timing models. However, on the basis of the skeleton emerged, rapid progress is expected in the future toward establishment of a full technical foundation. Therefore, the time seems ripe for launching new larger scale attacks on problem (2) on the basis of those recent developments in handling problem (1).","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131321090","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：