This paper provides a series of lessons learned with respect to using performance modeling and analysis techniques on designs of object-oriented software systems. Specifically it focuses on the application of the Unified Modeling Language (UML) profile for schedulability performance, and time (SPT) paired with statistical simulation and coloured Petri nets (CPNs). The experiences captured in this paper are based on observations from an empirical study evaluating these techniques
{"title":"Lessons learned applying performance modeling and analysis techniques","authors":"Julie A. Street, IV RobertG.Pettit","doi":"10.1109/ISORC.2006.46","DOIUrl":"https://doi.org/10.1109/ISORC.2006.46","url":null,"abstract":"This paper provides a series of lessons learned with respect to using performance modeling and analysis techniques on designs of object-oriented software systems. Specifically it focuses on the application of the Unified Modeling Language (UML) profile for schedulability performance, and time (SPT) paired with statistical simulation and coloured Petri nets (CPNs). The experiences captured in this paper are based on observations from an empirical study evaluating these techniques","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127818777","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}
Reduced time-to-market in spite of increasing the system's functionality, reuse of software on different hardware platforms, and the demand for performing validation activities earlier in the development phase raise the need for revising the state-of-the-art development methodologies for distributed embedded systems. The model driven architecture is a design methodology addressing these emerging requirements. Developing embedded systems according to this model-based paradigm requires a platform-independent representation of the functionality of the application as well as a precise model of the targeted hardware platform. In this paper we introduce a meta-model for capturing the resources of hardware platforms realizing the DECOS architecture, which is an integrated time-triggered architecture aimed at the development of distributed embedded systems. Furthermore, we present a tool chain based on this meta-model that speeds up the modeling process and reduces the likelihood of human errors by facilitating the reuse of hardware building blocks from libraries
{"title":"MDA-based development in the DECOS integrated architecture - modeling the hardware platform","authors":"B. Huber, R. Obermaisser, P. Peti","doi":"10.1109/ISORC.2006.50","DOIUrl":"https://doi.org/10.1109/ISORC.2006.50","url":null,"abstract":"Reduced time-to-market in spite of increasing the system's functionality, reuse of software on different hardware platforms, and the demand for performing validation activities earlier in the development phase raise the need for revising the state-of-the-art development methodologies for distributed embedded systems. The model driven architecture is a design methodology addressing these emerging requirements. Developing embedded systems according to this model-based paradigm requires a platform-independent representation of the functionality of the application as well as a precise model of the targeted hardware platform. In this paper we introduce a meta-model for capturing the resources of hardware platforms realizing the DECOS architecture, which is an integrated time-triggered architecture aimed at the development of distributed embedded systems. Furthermore, we present a tool chain based on this meta-model that speeds up the modeling process and reduces the likelihood of human errors by facilitating the reuse of hardware building blocks from libraries","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133756368","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}
Automatic memory management or garbage collection greatly simplifies the development of large systems. However, garbage collection is usually not used in real-time systems due to the unpredictable temporal behavior of current implementations of a garbage collector. In this paper we propose a concurrent collector that is scheduled periodically in the same way as ordinary application threads. We provide an upper bound for the collector period so that the application threads never run out of memory
{"title":"Real-time garbage collection for Java","authors":"Martin Schoeberl","doi":"10.1109/ISORC.2006.66","DOIUrl":"https://doi.org/10.1109/ISORC.2006.66","url":null,"abstract":"Automatic memory management or garbage collection greatly simplifies the development of large systems. However, garbage collection is usually not used in real-time systems due to the unpredictable temporal behavior of current implementations of a garbage collector. In this paper we propose a concurrent collector that is scheduled periodically in the same way as ordinary application threads. We provide an upper bound for the collector period so that the application threads never run out of memory","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122085860","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}
A monitoring infrastructure is a key component in each task aimed at evaluating the dependability of a system. This paper presents a monitoring infrastructure for the Java Virtual Machine (JVM), which is starting to be employed in mission and safety critical application, often with real-time requirements. This infrastructure, named JVMMon, collects data about both the state and the failures of the monitored Virtual Machine. The state of the JVM was defined according to the Java Virtual Machine specification. JVMMon is constituted by three components: a monitoring agent which collects data from the monitored VM; a local monitor daemon that receives data from such agent and updates the state of the JVM; a data collector, which stores events and state snapshots in a database. The impact on the performance of the JVM has been evaluated running the SPEC JVM98 benchmark suite
{"title":"Java Virtual Machine monitoring for dependability benchmarking","authors":"S. Orlando, S. Russo","doi":"10.1109/ISORC.2006.45","DOIUrl":"https://doi.org/10.1109/ISORC.2006.45","url":null,"abstract":"A monitoring infrastructure is a key component in each task aimed at evaluating the dependability of a system. This paper presents a monitoring infrastructure for the Java Virtual Machine (JVM), which is starting to be employed in mission and safety critical application, often with real-time requirements. This infrastructure, named JVMMon, collects data about both the state and the failures of the monitored Virtual Machine. The state of the JVM was defined according to the Java Virtual Machine specification. JVMMon is constituted by three components: a monitoring agent which collects data from the monitored VM; a local monitor daemon that receives data from such agent and updates the state of the JVM; a data collector, which stores events and state snapshots in a database. The impact on the performance of the JVM has been evaluated running the SPEC JVM98 benchmark suite","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"380 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122169421","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}
Many real-time applications, such as traffic control systems, surveillance systems and health monitoring systems, need to operate on continuous unbounded streams of data. These applications also have inherent real-time performance requirements that have to be met under high-volume, time-varying incoming data streams. In this paper, we present a real-time data stream query model named PQuery, which provides periodic real-time queries on data streams for the aforementioned real-time applications. To support the PQuery model, a real-time data stream management prototype system named RTSTREAM is developed to provide deadline miss ratio guarantees for periodic queries over continuous and unbounded data streams. We describe the periodic query semantics and discuss why the periodic query model is appropriate for real-time applications. To handle irregular data arrival patterns and query workloads, we propose data admission as an overload protection mechanism. We conduct performance studies with synthetic workloads as well as real workloads from network traffic monitoring applications. The experimental results show that the proposed periodic query model suits the need of the real-time applications and the data admission overload protection approach is effective in managing the workload fluctuations
{"title":"RTSTREAM: real-time query processing for data streams","authors":"Yuan Wei, S. Son, J. Stankovic","doi":"10.1109/ISORC.2006.68","DOIUrl":"https://doi.org/10.1109/ISORC.2006.68","url":null,"abstract":"Many real-time applications, such as traffic control systems, surveillance systems and health monitoring systems, need to operate on continuous unbounded streams of data. These applications also have inherent real-time performance requirements that have to be met under high-volume, time-varying incoming data streams. In this paper, we present a real-time data stream query model named PQuery, which provides periodic real-time queries on data streams for the aforementioned real-time applications. To support the PQuery model, a real-time data stream management prototype system named RTSTREAM is developed to provide deadline miss ratio guarantees for periodic queries over continuous and unbounded data streams. We describe the periodic query semantics and discuss why the periodic query model is appropriate for real-time applications. To handle irregular data arrival patterns and query workloads, we propose data admission as an overload protection mechanism. We conduct performance studies with synthetic workloads as well as real workloads from network traffic monitoring applications. The experimental results show that the proposed periodic query model suits the need of the real-time applications and the data admission overload protection approach is effective in managing the workload fluctuations","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129405274","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}
This paper proposes a hybrid scheduling scheme for hard, soft and non-real-time tasks. The scheme creates a constant utilization server for each real-time scheduling policy and a total bandwidth server for all the non-real-time tasks with time sharing scheduling policy. Each server has a scheduler, called server scheduler, which is responsible for executing the ready-to-run tasks with the same scheduling policy as the server. All the servers are scheduled by the bottom operating system scheduler according to EDF algorithm. The schedulability test is also presented in this paper. The hybrid scheme can be used to implement different real time systems with different goals (such as hard, soft or hybrid real-time systems) and can provide the real-time services with different QoS to the different task modes by adjusting every constant utilization server's size. This scheme also simplifies the schedulability analysis and validates the schedulability of the tasks with one scheduling policy independently of the tasks with other scheduling policies. The experimental results show that the hybrid scheme is an efficient scheduling scheme
{"title":"A hybrid scheduling scheme for hard, soft and non-real-time tasks","authors":"Pengliu Tan, Hai Jin, Minghu Zhang","doi":"10.1109/ISORC.2006.6","DOIUrl":"https://doi.org/10.1109/ISORC.2006.6","url":null,"abstract":"This paper proposes a hybrid scheduling scheme for hard, soft and non-real-time tasks. The scheme creates a constant utilization server for each real-time scheduling policy and a total bandwidth server for all the non-real-time tasks with time sharing scheduling policy. Each server has a scheduler, called server scheduler, which is responsible for executing the ready-to-run tasks with the same scheduling policy as the server. All the servers are scheduled by the bottom operating system scheduler according to EDF algorithm. The schedulability test is also presented in this paper. The hybrid scheme can be used to implement different real time systems with different goals (such as hard, soft or hybrid real-time systems) and can provide the real-time services with different QoS to the different task modes by adjusting every constant utilization server's size. This scheme also simplifies the schedulability analysis and validates the schedulability of the tasks with one scheduling policy independently of the tasks with other scheduling policies. The experimental results show that the hybrid scheme is an efficient scheduling scheme","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123761713","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}
Xiaoling Wu, Hoon Heo, R. Shaikh, Jinsung Cho, O. Chae, Sungyoung Lee
In this paper, we propose an approach to collaboratively track motion of a moving target in a wide area utilizing camera-equipped visual sensor networks, which are expected to play an essential role in a variety of applications such as surveillance and monitoring. A genetic fitting method for efficient contour extraction is used as inter-scene approach to detect and track the target. We also considered the existence of faulty sensors in the network which deteriorate the difficulty of target tracking problem, and proposed a robust sensor collaboration method. The experimental results have shown that the proposed target tracking approach produces very successful target tracking compared with the existing method especially in case that the target is adjacent to neighboring objects of background
{"title":"Individual contour extraction for robust wide area target tracking in visual sensor networks","authors":"Xiaoling Wu, Hoon Heo, R. Shaikh, Jinsung Cho, O. Chae, Sungyoung Lee","doi":"10.1109/ISORC.2006.40","DOIUrl":"https://doi.org/10.1109/ISORC.2006.40","url":null,"abstract":"In this paper, we propose an approach to collaboratively track motion of a moving target in a wide area utilizing camera-equipped visual sensor networks, which are expected to play an essential role in a variety of applications such as surveillance and monitoring. A genetic fitting method for efficient contour extraction is used as inter-scene approach to detect and track the target. We also considered the existence of faulty sensors in the network which deteriorate the difficulty of target tracking problem, and proposed a robust sensor collaboration method. The experimental results have shown that the proposed target tracking approach produces very successful target tracking compared with the existing method especially in case that the target is adjacent to neighboring objects of background","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121513580","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}
The Internet routing layer is at times too slow at recovering from faults and makes a sub-optimal use of redundancy available at the IP layer overlay networks can overcome these deficiencies to provide communication infrastructures with greater availability and flexibility. The majority of current experiences, however, are able to tolerate only simple (crash) failures of the underlying network. In this paper we present LITON, an overlay network architecture that aims at providing highly available communication in spite of faults and intrusions in the network. We also present a graph-theoretic model that allows the degree of fault and intrusion tolerance of a given overlay to be determined, as well as simulation results that validate this model and demonstrate that LITON accomplishes its goal even in worst-case scenarios
{"title":"A lightweight intrusion-tolerant overlay network","authors":"R. Obelheiro, J. Fraga","doi":"10.1109/ISORC.2006.7","DOIUrl":"https://doi.org/10.1109/ISORC.2006.7","url":null,"abstract":"The Internet routing layer is at times too slow at recovering from faults and makes a sub-optimal use of redundancy available at the IP layer overlay networks can overcome these deficiencies to provide communication infrastructures with greater availability and flexibility. The majority of current experiences, however, are able to tolerate only simple (crash) failures of the underlying network. In this paper we present LITON, an overlay network architecture that aims at providing highly available communication in spite of faults and intrusions in the network. We also present a graph-theoretic model that allows the degree of fault and intrusion tolerance of a given overlay to be determined, as well as simulation results that validate this model and demonstrate that LITON accomplishes its goal even in worst-case scenarios","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130339970","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}
Y. Tanaka, Naohiro Hayashibara, T. Enokido, M. Takizawa
A transactional agent is a mobile agent to manipulate objects distributed on computers with some type of commitment condition. For example, a transactional agent commits only if at least one object could be successfully manipulated in the at-least-one commitment condition. Computers may stop by fault while networks are assumed to be reliable. In the client-server model, servers can be fault-tolerant according to traditional replication and checkpointing technologies. However, an application program cannot be performed if a client computer is faulty. An application program can be performed on another operational computer even if a computer is faulty in the transactional agent model. For example, a transactional agent can move to another operational computer if some destination computer where the agent to move is faulty. There are kinds of faulty computers for a transactional agent, current, destination, and sibling computers where a transactional agent now exist, will move, and has visited, respectively. We discuss how the transactional agent can be tolerant of the types of faults. We show how a program reliably manipulating objects can be realized in a mobile agent in presence of computer faults
{"title":"A fault-tolerant transactional agent model on distributed objects","authors":"Y. Tanaka, Naohiro Hayashibara, T. Enokido, M. Takizawa","doi":"10.1109/ISORC.2006.2","DOIUrl":"https://doi.org/10.1109/ISORC.2006.2","url":null,"abstract":"A transactional agent is a mobile agent to manipulate objects distributed on computers with some type of commitment condition. For example, a transactional agent commits only if at least one object could be successfully manipulated in the at-least-one commitment condition. Computers may stop by fault while networks are assumed to be reliable. In the client-server model, servers can be fault-tolerant according to traditional replication and checkpointing technologies. However, an application program cannot be performed if a client computer is faulty. An application program can be performed on another operational computer even if a computer is faulty in the transactional agent model. For example, a transactional agent can move to another operational computer if some destination computer where the agent to move is faulty. There are kinds of faulty computers for a transactional agent, current, destination, and sibling computers where a transactional agent now exist, will move, and has visited, respectively. We discuss how the transactional agent can be tolerant of the types of faults. We show how a program reliably manipulating objects can be realized in a mobile agent in presence of computer faults","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117048357","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}
Seungmin Park, Jin Won Kim, Kwangyong Lee, Kee-Young Shin, Daeyoung Kim
Recently, the availability of cheap and small micro sensor node and low power wireless communication give a contribution of enhanced developments of wireless sensor network application in real society. Furthermore, middlewares and operating systems for convenience on development of sensor network application are essentially needed. In this paper, we introduce a sensor network operation system, Nano-Qplus platform, which is flexible, dynamic, and easy manageable for sensor network application programmers. Furthermore, for the purpose of performance evaluation, we compare Nano-Qplus to other sensor network operating systems related to memory read/write time and task creation latency. The results of performance analysis shows that Nano-Qplus offers enhanced advantages that other sensor network operating systems, so we can notice Nano-Qplus is easily applied to real sensor network applications
{"title":"Embedded sensor networked operating system","authors":"Seungmin Park, Jin Won Kim, Kwangyong Lee, Kee-Young Shin, Daeyoung Kim","doi":"10.1109/ISORC.2006.33","DOIUrl":"https://doi.org/10.1109/ISORC.2006.33","url":null,"abstract":"Recently, the availability of cheap and small micro sensor node and low power wireless communication give a contribution of enhanced developments of wireless sensor network application in real society. Furthermore, middlewares and operating systems for convenience on development of sensor network application are essentially needed. In this paper, we introduce a sensor network operation system, Nano-Qplus platform, which is flexible, dynamic, and easy manageable for sensor network application programmers. Furthermore, for the purpose of performance evaluation, we compare Nano-Qplus to other sensor network operating systems related to memory read/write time and task creation latency. The results of performance analysis shows that Nano-Qplus offers enhanced advantages that other sensor network operating systems, so we can notice Nano-Qplus is easily applied to real sensor network applications","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122702940","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
扫码关注我们
求助内容：
应助结果提醒方式：