Pub Date : 2003-05-14DOI: 10.1109/ISORC.2003.1199248
S. Hieda, Y. Saida, H. Chishima, Naoki Sato, Y. Nakamoto
SMIL is a markup language which enables us to describe multimedia contents. This paper proposes a design model of SMIL browser functionality for mobile terminals whose resources are limited. We introduce SMIL Component, which is based on attachable software architecture to a pre-installed generic web browser. This leads to reduce memory size that SMIL Component consumes and bring high adaptability of SMIL Component for various web browsers. We implement SMIL Component and evaluate RAM sizes and presentation delays. As a result, we found out that SMIL Component can be useful for MMS presentations on mobile terminals.
{"title":"Design of SMIL browser functionality in mobile terminals","authors":"S. Hieda, Y. Saida, H. Chishima, Naoki Sato, Y. Nakamoto","doi":"10.1109/ISORC.2003.1199248","DOIUrl":"https://doi.org/10.1109/ISORC.2003.1199248","url":null,"abstract":"SMIL is a markup language which enables us to describe multimedia contents. This paper proposes a design model of SMIL browser functionality for mobile terminals whose resources are limited. We introduce SMIL Component, which is based on attachable software architecture to a pre-installed generic web browser. This leads to reduce memory size that SMIL Component consumes and bring high adaptability of SMIL Component for various web browsers. We implement SMIL Component and evaluate RAM sizes and presentation delays. As a result, we found out that SMIL Component can be useful for MMS presentations on mobile terminals.","PeriodicalId":204411,"journal":{"name":"Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124892199","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 : 2003-05-14DOI: 10.1109/ISORC.2003.1199257
W. E. Wong, J. J. Li
Object-oriented/sup 1/ languages support many modern programming paradigms such as information hiding, inheritance, polymorphism, and dynamic binding. As a result, software systems implemented in OO languages are more reusable and reliable than those in non-OO. Many legacy software systems were created before OO programming became popular and needed to be redesigned and updated to OO programs. The process of abstracting OO designs from the procedural source code was often done manually or with limited assistance from program structural diagrams. Most reengineering focuses on the functionality of the original program, and the OO redesign often results in a completely new design based on the designers' understanding of the original program. Such an approach is not sufficient, for it not only takes time and effort for designers to become familiar with the original program, but the approach itself is also mistake-prone due to the human involvement. This paper presents a computer-aided semi-automatic method that abstracts OO designs from the original procedural source code. More specifically, it is a method for OO redesign based on program structural diagrams, visualization, and execution slice. We conducted a case study by applying this method to an inventory management software system. Results indicate that our method can effectively and efficiently abstract an appropriate OO design out of the original C code as well as re-generate part of the system in C++ code based on this new OO design.
{"title":"Redesigning legacy systems into the object-oriented paradigm","authors":"W. E. Wong, J. J. Li","doi":"10.1109/ISORC.2003.1199257","DOIUrl":"https://doi.org/10.1109/ISORC.2003.1199257","url":null,"abstract":"Object-oriented/sup 1/ languages support many modern programming paradigms such as information hiding, inheritance, polymorphism, and dynamic binding. As a result, software systems implemented in OO languages are more reusable and reliable than those in non-OO. Many legacy software systems were created before OO programming became popular and needed to be redesigned and updated to OO programs. The process of abstracting OO designs from the procedural source code was often done manually or with limited assistance from program structural diagrams. Most reengineering focuses on the functionality of the original program, and the OO redesign often results in a completely new design based on the designers' understanding of the original program. Such an approach is not sufficient, for it not only takes time and effort for designers to become familiar with the original program, but the approach itself is also mistake-prone due to the human involvement. This paper presents a computer-aided semi-automatic method that abstracts OO designs from the original procedural source code. More specifically, it is a method for OO redesign based on program structural diagrams, visualization, and execution slice. We conducted a case study by applying this method to an inventory management software system. Results indicate that our method can effectively and efficiently abstract an appropriate OO design out of the original C code as well as re-generate part of the system in C++ code based on this new OO design.","PeriodicalId":204411,"journal":{"name":"Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129812803","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 : 2003-05-14DOI: 10.1109/ISORC.2003.1199263
Dania A. El-Kebbe
A predictable real-time control scheme for manufacturing systems underlying real-time constraints is proposed. The preemptive scheduling of systems consisting of hybrid (periodic and aperiodic) tasks on a platform comprised of several uniform multiprocessors is considered. Based on resource augmentation techniques, the Total Bandwidth Server on uniform multiprocessors, is developed The predictability and the performance of the system are proved through schedulability analysis techniques and simulation studies respectively.
{"title":"Hybrid real-time task scheduling upon multiprocessor platforms using server techniques","authors":"Dania A. El-Kebbe","doi":"10.1109/ISORC.2003.1199263","DOIUrl":"https://doi.org/10.1109/ISORC.2003.1199263","url":null,"abstract":"A predictable real-time control scheme for manufacturing systems underlying real-time constraints is proposed. The preemptive scheduling of systems consisting of hybrid (periodic and aperiodic) tasks on a platform comprised of several uniform multiprocessors is considered. Based on resource augmentation techniques, the Total Bandwidth Server on uniform multiprocessors, is developed The predictability and the performance of the system are proved through schedulability analysis techniques and simulation studies respectively.","PeriodicalId":204411,"journal":{"name":"Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124380798","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 : 2003-05-14DOI: 10.1109/ISORC.2003.1199251
A. Rasche, A. Polze
Dynamic reconfiguration provides of powerful mechanism to adapt component-based distributed applications to changing environmental conditions. We have designed and implemented a framework for dynamic component reconfiguration on the basis of the Microsoft .NET environment. Within this paper we present an experimental evaluation of our infrastructure for dynamic reconfiguration of component-based applications. Our framework supports the description of application configurations and profiles and allows for selection of a particular configuration and object/component instantiation based on measured environmental conditions. In response to changes in the environment, our framework will dynamically load new configurations, thus implementing dynamic reconfiguration of an application. Configuration code for components and applications has to interact with many functional modules and therefore is often scattered around the whole application. We use aspect-oriented programming techniques to handle configuration aspects separately from functional code. The timing behavior of dynamic reconfiguration depends heavily on properties of the underlying programming environment and the operating system. We have studied to which extend and with which performance impact the Microsoft .NET Platform/sup 1/ supports dynamic reconfiguration. The paper thoroughly discusses our experimental results.
{"title":"Configuration and dynamic reconfiguration of component-based applications with Microsoft .NET","authors":"A. Rasche, A. Polze","doi":"10.1109/ISORC.2003.1199251","DOIUrl":"https://doi.org/10.1109/ISORC.2003.1199251","url":null,"abstract":"Dynamic reconfiguration provides of powerful mechanism to adapt component-based distributed applications to changing environmental conditions. We have designed and implemented a framework for dynamic component reconfiguration on the basis of the Microsoft .NET environment. Within this paper we present an experimental evaluation of our infrastructure for dynamic reconfiguration of component-based applications. Our framework supports the description of application configurations and profiles and allows for selection of a particular configuration and object/component instantiation based on measured environmental conditions. In response to changes in the environment, our framework will dynamically load new configurations, thus implementing dynamic reconfiguration of an application. Configuration code for components and applications has to interact with many functional modules and therefore is often scattered around the whole application. We use aspect-oriented programming techniques to handle configuration aspects separately from functional code. The timing behavior of dynamic reconfiguration depends heavily on properties of the underlying programming environment and the operating system. We have studied to which extend and with which performance impact the Microsoft .NET Platform/sup 1/ supports dynamic reconfiguration. The paper thoroughly discusses our experimental results.","PeriodicalId":204411,"journal":{"name":"Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132504615","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 : 2003-05-14DOI: 10.1109/ISORC.2003.1199252
S. Yau, F. Karim
Devices in ubiquitous computing environments are usually embedded, wearable, and handheld, have resource constraints, and are all connected to each other through wireless connections and other computers possibly through fixed network infrastructures, such as the Internet. These devices may form numerous webs of short-range and often low-power mobile ad hoc networks to exchange information. Distributed object computing (DOC) middleware technologies have been successful in promoting high quality and reusable distributed software for enterprise-oriented environments. In order to reap the same benefit in ubiquitous computing environments, it is important to note that the natural interactions among distributed objects in ubiquitous computing environments are quite different due to various factors, such as bandwidth constraints, unpredictable device mobility, network topology change, and context-sensitivity (or situation-awareness) of application objects. Hence, the interactions among distributed objects tend to be more spontaneous and short-lived rather than predictable and long-term. In this paper, a middleware protocol, RKF, to facilitate distributed object-based application software to interact in an ad hoc fashion in ubiquitous computing environments is presented. RKF addresses both spontaneous object discovery and context-sensitive object data exchange. Our experimental results, based on RKF's implementation and evaluation inside the object request broker of our RCSM middleware test bed, indicate that it is lightweight, has good performance, and can be easily used in PDA-like devices.
{"title":"A lightweight middleware protocol for ad hoc distributed object computing in ubiquitous computing environments","authors":"S. Yau, F. Karim","doi":"10.1109/ISORC.2003.1199252","DOIUrl":"https://doi.org/10.1109/ISORC.2003.1199252","url":null,"abstract":"Devices in ubiquitous computing environments are usually embedded, wearable, and handheld, have resource constraints, and are all connected to each other through wireless connections and other computers possibly through fixed network infrastructures, such as the Internet. These devices may form numerous webs of short-range and often low-power mobile ad hoc networks to exchange information. Distributed object computing (DOC) middleware technologies have been successful in promoting high quality and reusable distributed software for enterprise-oriented environments. In order to reap the same benefit in ubiquitous computing environments, it is important to note that the natural interactions among distributed objects in ubiquitous computing environments are quite different due to various factors, such as bandwidth constraints, unpredictable device mobility, network topology change, and context-sensitivity (or situation-awareness) of application objects. Hence, the interactions among distributed objects tend to be more spontaneous and short-lived rather than predictable and long-term. In this paper, a middleware protocol, RKF, to facilitate distributed object-based application software to interact in an ad hoc fashion in ubiquitous computing environments is presented. RKF addresses both spontaneous object discovery and context-sensitive object data exchange. Our experimental results, based on RKF's implementation and evaluation inside the object request broker of our RCSM middleware test bed, indicate that it is lightweight, has good performance, and can be easily used in PDA-like devices.","PeriodicalId":204411,"journal":{"name":"Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131798214","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 : 2003-05-14DOI: 10.1109/ISORC.2003.1199231
Kwang-rok Kim
Structuring real-time concurrent programs in the form of groups of fixed-priority processes is an old art which is appropriate for only a small fraction of modem real-time distributed computing application systems. However, it is still practiced on the basis of an insufficient technical foundation. One of the basic issues in using the fixed-priority process structuring approach is to avoid the priority inversion phenomenon. It is argued that priority inversions are essentially due to the inappropriate approach used for structuring programs including the specification of the policy for allocating resources. Several basic program structuring techniques which are effective means of avoiding priority inversions are presented.
{"title":"Basic program structures for avoiding priority inversions","authors":"Kwang-rok Kim","doi":"10.1109/ISORC.2003.1199231","DOIUrl":"https://doi.org/10.1109/ISORC.2003.1199231","url":null,"abstract":"Structuring real-time concurrent programs in the form of groups of fixed-priority processes is an old art which is appropriate for only a small fraction of modem real-time distributed computing application systems. However, it is still practiced on the basis of an insufficient technical foundation. One of the basic issues in using the fixed-priority process structuring approach is to avoid the priority inversion phenomenon. It is argued that priority inversions are essentially due to the inappropriate approach used for structuring programs including the specification of the policy for allocating resources. Several basic program structuring techniques which are effective means of avoiding priority inversions are presented.","PeriodicalId":204411,"journal":{"name":"Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003.","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134584098","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 : 2003-05-14DOI: 10.1109/ISORC.2003.1199247
P. Guerra, A. Romanovsky, R. Lemos
This paper considers the problem of integrating commercial off-the-shelf (COTS) software components into systems with high dependability requirements. These components, by their very nature, are built to be reused as black boxes that cannot be modified. Instead, the system architect has to rely on techniques external with respect to the component for resolving mismatches of the services required and provided that might arise in the interaction of the component and its environment. This paper proposes an architectural solution to turning COTS components into idealised fault-tolerant COTS components by adding protective wrappers to them.
{"title":"Integrating COTS software components into dependable software architectures","authors":"P. Guerra, A. Romanovsky, R. Lemos","doi":"10.1109/ISORC.2003.1199247","DOIUrl":"https://doi.org/10.1109/ISORC.2003.1199247","url":null,"abstract":"This paper considers the problem of integrating commercial off-the-shelf (COTS) software components into systems with high dependability requirements. These components, by their very nature, are built to be reused as black boxes that cannot be modified. Instead, the system architect has to rely on techniques external with respect to the component for resolving mismatches of the services required and provided that might arise in the interaction of the component and its environment. This paper proposes an architectural solution to turning COTS components into idealised fault-tolerant COTS components by adding protective wrappers to them.","PeriodicalId":204411,"journal":{"name":"Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132622636","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 : 2003-05-14DOI: 10.1109/ISORC.2003.1199260
Erik Yu-Shing Hu, A. Wellings, G. Bernat
The run-time characteristics of Java, such as high frequency of method invocation, dynamic dispatching and dynamic loading, make Java more difficult than other object-oriented programming languages, such as C++, for conducting Worst-Case Execution Time (WCET) analysis. To offer a more flexible way to develop object-oriented real-time applications in the realtime Java environment without loss of predictability and performance, we propose a novel gain time reclaiming framework integrated with WCET analysis. This paper demonstrates how to improve the utilisation and performance of the whole system by reclaiming gain time at run-time. Our approach shows that integrating WCET with gain time reclaiming can not only provide a more flexible environment, but it also does not necessarily result in unsafe or unpredictable timing behaviour.
{"title":"Gain time reclaiming in high performance real-time Java systems","authors":"Erik Yu-Shing Hu, A. Wellings, G. Bernat","doi":"10.1109/ISORC.2003.1199260","DOIUrl":"https://doi.org/10.1109/ISORC.2003.1199260","url":null,"abstract":"The run-time characteristics of Java, such as high frequency of method invocation, dynamic dispatching and dynamic loading, make Java more difficult than other object-oriented programming languages, such as C++, for conducting Worst-Case Execution Time (WCET) analysis. To offer a more flexible way to develop object-oriented real-time applications in the realtime Java environment without loss of predictability and performance, we propose a novel gain time reclaiming framework integrated with WCET analysis. This paper demonstrates how to improve the utilisation and performance of the whole system by reclaiming gain time at run-time. Our approach shows that integrating WCET with gain time reclaiming can not only provide a more flexible environment, but it also does not necessarily result in unsafe or unpredictable timing behaviour.","PeriodicalId":204411,"journal":{"name":"Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132713677","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
扫码关注我们
求助内容：
应助结果提醒方式：