{"title":"Development of the warfighting architecture requirements (WAR) tool","authors":"G. Hurlburt","doi":"10.1109/WORDS.2005.27","DOIUrl":"https://doi.org/10.1109/WORDS.2005.27","url":null,"abstract":"The warfighting architecture requirements (WAR) tool extends the Department of Defense Architectural Framework (DODAF) to fill warfighting voids. It builds warfighting scenarios and documents joint capabilities integration and development system (JCIDS) elements. WAR uses DoD task lists to build scenarios attributed by doctrine, organization, training, material, leadership, personnel and facilities (DOTMLPF). These data feed a growing ontology and are managed through an object oriented multiple inheritance structure. The WAR tool reach-back capability draws from existing distributed data sources. The task oriented WAR scenarios can be further defined in terms of timing, cost, function and constraints. Scenario data synchronize the DODAF required operational, system, and technical views. These data may be easily translated to modeling and simulation (M&S) and lend themselves to thin thread analysis across multiple scenarios. The highly scaleable, thin-client, Web-based WAR tool is compliant with emerging DOD net centric enterprise services (NCES) as it contains semantic-web service elements.","PeriodicalId":335355,"journal":{"name":"10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126113974","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}
{"title":"Dynamic reconfiguration of component-based real-time software","authors":"A. Rasche, A. Polze","doi":"10.1109/WORDS.2005.31","DOIUrl":"https://doi.org/10.1109/WORDS.2005.31","url":null,"abstract":"Increasing capabilities of modern microcontrollers greatly increase their applicability to more and more complex scenarios. However, unstable and ever-changing environmental settings require embedded systems permanently to adapt to new situations. Dynamic reconfiguration provides a powerful mechanism to execute such adaptation strategies. The implementation of dynamic reconfiguration is still challenging for embedded real-time control software. Within earlier work we have presented our framework Adapt.NET for runtime adaption of component-based applications, including a runtime infrastructure for dynamic reconfiguration and monitoring, targeted for mobile and desktop environments. New experiments in our Web-based remote laboratory - the distributed control lab - require the reconfiguration to complete in bounded time. In the remote lab we use dynamic reconfiguration to adapt experiment control to failures in user control components. Within this paper, we analyze the timing behavior of the implemented dynamic reconfiguration algorithm in order to allow for predictable execution times. We describe how complex component-based real-time applications can be adapted to changing environmental conditions, continuously meeting all tasks deadlines during dynamic reconfiguration.","PeriodicalId":335355,"journal":{"name":"10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114581240","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}
{"title":"On constructing overlay networks to support distributed real-time virtual environment applications","authors":"V. Kalogeraki, Fang-Yu Chen","doi":"10.1109/WORDS.2005.45","DOIUrl":"https://doi.org/10.1109/WORDS.2005.45","url":null,"abstract":"Overlay networks provide an attractive solution to distributed real-time virtual applications because of their unique features of scalability, decentralization and cost effectiveness. However, overlay support for distributed real-time virtual applications remains a challenge because of two reasons: 1) Frequent update messages traveling through multiple hops can increase the network traffic and cause long communication and processing delays; and 2) Variable latencies experienced by different participants can violate their consistency requirements and affect the performance of the application. In this paper, we propose techniques that work at two levels to address this problem. First the participants are grouped according to their virtual distance to satisfy their consistency requirements. Second, filters that combine application-level knowledge are utilized at boundary nodes to eliminate unnecessary message propagations. Our approach enables nodes to trade-off processing overhead for consistency precision, while reducing the message overhead in the overlay network.","PeriodicalId":335355,"journal":{"name":"10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125600937","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}
{"title":"Virtual networks in an integrated time-triggered architecture","authors":"R. Obermaisser, P. Peti, H. Kopetz","doi":"10.1109/WORDS.2005.55","DOIUrl":"https://doi.org/10.1109/WORDS.2005.55","url":null,"abstract":"Depending on the physical structuring of large distributed safety-critical real-time systems, one can distinguish federated and integrated system architectures. This paper investigates the communication services of an integrated system architecture, which combines the complexity management advantages of federated systems with the functional integration and hardware benefits of an integrated approach. A major challenge is the need to accommodate the communication services to the different types of integrated application subsystems that range from ultra-dependable control applications (e.g., an x-by-wire system) to non safety-critical applications such as multimedia or comfort systems. In particular, the encapsulation of the communication activities of different application subsystems is required not only to prevent error propagation from non safety-critical application subsystems to higher levels of criticality, but also to facilitate complexity management and permit independent development activities. This paper introduces virtual networks as the encapsulated communication infrastructure of an application subsystem in the integrated DECOS architecture. Virtual networks are constructed as overlay networks on top of the time-triggered communication system of a base architecture. Each virtual network runs a corresponding communication protocol that is determined either by a legacy platform or selected to meet the requirements of the application subsystem. Encapsulation mechanisms ensure that the temporal properties of each virtual network are known a priori and independent from the communication activities in other virtual networks. By assigning to each application subsystem a dedicated virtual network and by ensuring that the virtual network abstractions hold also in the case of faults, the integrated architecture supports the benefits of a federated system, such as fault isolation, complexity management, independent development, and intellectual property protection. In addition, virtual networks promise massive cost savings through the reduction of physical networks and reliability improvements with respect to wiring and connectors.","PeriodicalId":335355,"journal":{"name":"10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130843643","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}
Yunmook Nah, Joonwook Lee, Woon Joo Lee, Ho Lee, Moon-hae Kim, Ki-Joon Han
{"title":"Distributed scalable location data management system based on the GALIS architecture","authors":"Yunmook Nah, Joonwook Lee, Woon Joo Lee, Ho Lee, Moon-hae Kim, Ki-Joon Han","doi":"10.1109/WORDS.2005.29","DOIUrl":"https://doi.org/10.1109/WORDS.2005.29","url":null,"abstract":"A challenging task in the LBS system engineering is to implement a highly scalable system architecture which can manage moderate-size configurations handling thousands of moving items as well as upper-end configurations handling millions of moving items. The architecture named the GALIS is a cluster-based distributed computing system architecture that consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone. In this paper, we explain a prototype location data management system structuring major components of GALIS by employing the TMO programming scheme, including the execution engine middleware developed to support real-time distributed object programming and real-time distributed computing system design. We present how to generate realistic location sensing reports and how to process such location reports and location-related queries. Some experimental results showing performance factors regarding distributed query processing are also explained.","PeriodicalId":335355,"journal":{"name":"10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125367191","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}
{"title":"Delay analysis for statistical real-time channels in mobile ad hoc networks","authors":"Min-Gu Lee, Sunggu Lee","doi":"10.1109/WORDS.2005.23","DOIUrl":"https://doi.org/10.1109/WORDS.2005.23","url":null,"abstract":"Wireless devices that communicate using the IEEE 802.11 protocol can be used to create mobile ad-hoc networks (MANETs). Many interesting applications using MANETs are realizable if real-time channels can be supported on such networks. However, frames are commonly dropped (and thus must be retransmitted) in wireless networks due to interference from other wireless devices and transmission range problems. To provide real-time communication in such networks, statistical real-time channels can be used. This paper proposes an analysis of the end-to-end network delay for two nodes in a MANET using the IEEE 802.11 DCF mode. This delay analysis can serve as the basis for the creation of statistical real-time channels in IEEE 802.11 MANETs.","PeriodicalId":335355,"journal":{"name":"10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126213500","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}
K. Kim, Emmanuel Henrich, C. Im, Moon-Cheol Kim, Sung-Jin Kim, Yuqing Li, Sheng Liu, S. Yoo, L. Zheng, Qian Zhou
{"title":"Distributed computing based streaming and play of music ensemble realized through TMO programming","authors":"K. Kim, Emmanuel Henrich, C. Im, Moon-Cheol Kim, Sung-Jin Kim, Yuqing Li, Sheng Liu, S. Yoo, L. Zheng, Qian Zhou","doi":"10.1109/WORDS.2005.28","DOIUrl":"https://doi.org/10.1109/WORDS.2005.28","url":null,"abstract":"We present a new class of multimedia applications where the exploitation of the principle of global-time-based coordination of distributed actions (TCoDA) is compelling. In these applications, multiple small-footprint PCs, each equipped with its own speakers, act as instrument players or singers forming an ensemble. Each player PC obtains its piece of the musical audio data over an Ethernet network from a central server containing all necessary audio files. An important requirement is thus to make multiple specialized players, e.g., violin player, cello player, piano player, etc., perform globally synchronous play of their responsible pieces of the music. Moreover, to enable fast start of the requested music play, the musical data are streamed from the server to each player in a pipelined fashion so that while each player is playing one part of the music, the next part may be arriving over the network. Efficient implementation techniques based on the TMO programming scheme are then presented. This digital music ensemble application turns out to be an interesting cost-effective means of evaluating the QoS of the middleware supporting TCoDA. A prototype implementation of a digital music ensemble system was relatively easily realized by use of the TMO programming scheme.","PeriodicalId":335355,"journal":{"name":"10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126018885","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}
Jiangyin Zhang, L. DiPippo, V. Wolfe, Kevin Bryan, Matthew Murphy
{"title":"A real-time distributed scheduling service for middleware systems","authors":"Jiangyin Zhang, L. DiPippo, V. Wolfe, Kevin Bryan, Matthew Murphy","doi":"10.1109/WORDS.2005.10","DOIUrl":"https://doi.org/10.1109/WORDS.2005.10","url":null,"abstract":"The latest version of real-time CORBA defines a distributable thread primitive to support real-time computing in a dynamic distributed environment. However, this standard does not provide support for making and enforcing global decisions. This paper describes the framework for a distributed scheduling service (DSS) that provides globally sound decision-making and scheduling enforcement to real-time distributed systems. The paper describes the design and implementation of the framework, as well as preliminary performance results.","PeriodicalId":335355,"journal":{"name":"10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129648155","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}
{"title":"Concurrency control on distributed objects using role ordering (RO) scheduler","authors":"T. Enokido, M. Takizawa","doi":"10.1109/WORDS.2005.22","DOIUrl":"https://doi.org/10.1109/WORDS.2005.22","url":null,"abstract":"A concept of role is significant to design and implement a secure information system. A role concept shows a job function in an enterprise. A role-based access control (RBAC) model is used to make a system secure. In addition to keeping systems secure, objects have to be consistent in presence of multiple transactions. Traditional locking protocols and timestamp ordering schedulers are based on principles \"first-comer-winner\" and \"timestamp order\" to make multiple conflicting transactions serializable, respectively. In this paper, we discuss concurrency control algorithms based on the significancy of roles assigned to transactions. We first define a significantly dominant relation on roles. We discuss a role ordering (RO) scheduler so that multiple conflicting transactions are serializable in a significant dominant relation of roles. We evaluate the RO scheduler compared with the two-phase locking (2PL) protocol.","PeriodicalId":335355,"journal":{"name":"10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122694909","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}
Chen-Ting Chuang, Chin-Fu Kuo, Tei-Wei Kuo, Ai-Chun Pang
{"title":"A multi-granularity energy profiling approach and a quantitative study of a Web browser","authors":"Chen-Ting Chuang, Chin-Fu Kuo, Tei-Wei Kuo, Ai-Chun Pang","doi":"10.1109/WORDS.2005.9","DOIUrl":"https://doi.org/10.1109/WORDS.2005.9","url":null,"abstract":"While energy-efficiency considerations become a critical issue in embedded-system designs, little work is done for energy-profiling at different granularity levels. This paper aims at the proposing of a hybrid hardware-software-based profiling solution with different levels of abstraction. Compared to the existing work, the proposed solution could provide richer information on energy profiling with the help of execution-path tracking and exclusion of selected functions/classes/modules. We address technical issues in the implementation of the proposed profiling solution. A quantitative energy-profiling study over a well-known Web browser based on an object-oriented design, Konqueror, is then presented to provide a feasibility study of the proposed solution and insights in the design of an energy-efficient Web browser.","PeriodicalId":335355,"journal":{"name":"10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126560105","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}