Kwang-Rok Kim, Juan A. Colmenares, Moon-Cheol Kim, Zhen Zhang, Qian Zhou, Doohyun Kim, S. Yau
{"title":"Incorporation of Security Mechanisms into the TMO Scheme for Real Time Distributed Computing","authors":"Kwang-Rok Kim, Juan A. Colmenares, Moon-Cheol Kim, Zhen Zhang, Qian Zhou, Doohyun Kim, S. Yau","doi":"10.1109/STFSSD.2009.51","DOIUrl":"https://doi.org/10.1109/STFSSD.2009.51","url":null,"abstract":"Many real-time distributed computing (RTDC) applications have stringent action timing requirements as well as tight security-enforcement requirements. Integration of security enforcement mechanisms into advanced component-based RTDC schemes has been recognized as an important research topic in recent years. In this paper we propose the first formal extension of the Time-triggered Message-triggered Object (TMO) component model devised to facilitate efficient construction of secure RTDC applications. The newly extended TMO structure is called the Adaptive Secure TMO (AS-TMO). A distinguishing characteristic of the proposed scheme is that security attributes (e.g., roles) are associated with AS-TMO parts (e.g., methods and data-container variable groups) instead of with entire AS-TMOs. We also present the execution engine facilities being incorporated into the middleware model, the TMO Support Middleware (TMOSM), for providing the security-enforcement capabilities defined in the AS-TMO scheme.","PeriodicalId":189796,"journal":{"name":"2009 Software Technologies for Future Dependable Distributed Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114895031","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}
Heeheon Kim, Moonju Park, Seong-je Cho, Hong Jin Yoo, Jinseok Chae, Yookun Cho
{"title":"A Combined Approach to Improve the Response Time of Soft Aperiodic Tasks","authors":"Heeheon Kim, Moonju Park, Seong-je Cho, Hong Jin Yoo, Jinseok Chae, Yookun Cho","doi":"10.1109/STFSSD.2009.20","DOIUrl":"https://doi.org/10.1109/STFSSD.2009.20","url":null,"abstract":"In a real-time system with both hard deadline periodic tasks and soft deadline aperiodic tasks, hard deadline tasks must be guaranteed to meet their deadlines and soft deadline tasks are serviced in a best-effort manner. To schedule soft deadline aperiodic tasks in dynamic priority systems, one can assign a virtual deadline like the TBS algorithm or use capacity servers like the DPE algorithm. Both approaches have their own advantages, and we cannot say which one is better in terms of response time. In some cases, TBS provides shorter response time than DPE server. In other cases, the reverse may happen. In this paper, we propose a combined approach to improve the response time of soft deadline aperiodic tasks. The proposed method combines the deadline assignment and the capacity server approach. When there is enough capacity available for aperiodic tasks, the aperiodic tasks are served by capacity servers. Otherwise, our method assigns a deadline and schedule aperiodic task together with periodic tasks by EDF algorithm. In the worst case, the proposed method provides response time no later than TBS. Experimental results show that the proposed approach improves the responsiveness of soft deadline aperiodic tasks.","PeriodicalId":189796,"journal":{"name":"2009 Software Technologies for Future Dependable Distributed Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115039774","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":"An Alarm Annunciatior for Domain Administrators","authors":"Junichi Ikeda, Sayaka Akioka, Y. Muraoka","doi":"10.1109/STFSSD.2009.31","DOIUrl":"https://doi.org/10.1109/STFSSD.2009.31","url":null,"abstract":"Security market has been expanding steadily as people become more conscious about personal information management. On the other hand, administrators are competing with the flood of logs every day, and chasing for the updates on a new kind of attacks. Given the overwhelming tasks of administrators, it is extremely hard to keep the peace without the help of professionals such as hired system administrators and security analysts. In this paper, we propose an alarm annunciator to analyze system. We constructed the system that detects a large-scale brute-force attack and warns administrating PCs, as a prototype of the system that collects and analyzes logs, and alerts system administrators automatically. The alarm annunciator enables variety of domain administrators to manage their domains and servers with the minimum effort and expense.","PeriodicalId":189796,"journal":{"name":"2009 Software Technologies for Future Dependable Distributed Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122176335","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 Equivalence Partitioning of Code Paths inside OS Kernel Components","authors":"C. Sârbu, Nachiappan Nagappan, N. Suri","doi":"10.1109/STFSSD.2009.52","DOIUrl":"https://doi.org/10.1109/STFSSD.2009.52","url":null,"abstract":"Commercial-off-the-shelf operating systems (COTS OSs) are increasingly chosen as key building blocks in embedded system design due to their rich feature-set available at low costs. Unfortunately, as the complexity of such OSs increases, testing key OS components such as device drivers (DD) to ensure continuous service provision becomes increasingly challenging. Despite the improving test efforts targeting DDs, they still represent a significant cause of system outages as the test coverage is invariably limited by the inability to exhaustively assess and cover the operational states. Consequently, if representative operational execution profiles of DDs within an OS could be obtained, these could significantly improve the understanding of the actual operational DD state space and help focus the test efforts onto the execution hotspots. Focusing on characterizing DD operational activities while assuming no access to source code, our work enables profiling the runtime behavior of DDs solely based on I/Oand functional-call tracking. Such profiles are used to improve test adequacy against real-world workloads by enabling similarity quantification across them. The profiles also reveal execution hotspots in terms of functionalities activated in the field, allowing for dedicated test campaigns.","PeriodicalId":189796,"journal":{"name":"2009 Software Technologies for Future Dependable Distributed Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128488519","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}
M. Kamilov, Ilhom Karimov, Jungwook Song, Heemin Kim, Sunyoung Han
{"title":"A Real-time Routing System for Vehicular Ad Hoc Networks","authors":"M. Kamilov, Ilhom Karimov, Jungwook Song, Heemin Kim, Sunyoung Han","doi":"10.1109/STFSSD.2009.16","DOIUrl":"https://doi.org/10.1109/STFSSD.2009.16","url":null,"abstract":"Vehicular Ad Hoc Networks (VANET) are emerging as one of the promising technologies for the future. It can be a specific case of real-time distributed systems. Ad hoc routing can be applied to vehicle-to-vehicle (V2V) communications, but some important points should be considered. Main issue in VANET is its high mobility. Once built routing path can be out of order very quickly and needs to be reconstructed with existing routing protocols. In this paper we propose Road Map Based (RMB) routing protocol for real-time vehicular ad hoc networks – routing algorithm which includes some techniques taken from geographical ad hoc routing. It handles mobility using road map and builds stable routing path on the road segments but not on the nodes. Routing path is done through distributed real-time participants of the network. We propose route discovery, data forwarding and route maintenance mechanisms.","PeriodicalId":189796,"journal":{"name":"2009 Software Technologies for Future Dependable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129241434","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":"Run-time Detection Mechanism of Nested Call-loop Structure to Monitor the Actual Execution of Codes","authors":"Yukinori Sato, Ken-ichi Suzuki, Tadao Nakamura","doi":"10.1109/STFSSD.2009.30","DOIUrl":"https://doi.org/10.1109/STFSSD.2009.30","url":null,"abstract":"To enhance dependability is becoming hard because emerging multicore processors and ever-increasing code size of software make a computer system larger and more complex year by year. In this circumstance, how to handle and make effective use of multicore processors is essential for tackling these issues, and a mechanism that monitors the dynamic behavior of code execution is required to realize it. In this paper, we present a profiling scheme of nested call-loop structure using dynamic binary instrumentation. We evaluate our profiling scheme using an application benchmark, and show the advantages of our profiling compared with conventional profiling. We also show that ourprofiling can monitor the actual dynamic behavior of an application and detect the nested loop structures and their relative locations toward function calls. The results also indicate that our scheme has the ability to be adaptable for performance tuning and optimization process of multicore systems.","PeriodicalId":189796,"journal":{"name":"2009 Software Technologies for Future Dependable Distributed Systems","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130695957","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":"Verification Tool and Unified Specifications for Embedded Software","authors":"Shunsuke Yatabe","doi":"10.1109/STFSSD.2009.33","DOIUrl":"https://doi.org/10.1109/STFSSD.2009.33","url":null,"abstract":"In the extended abstract, our on-going research project Verification Tool and Unified Specifications for Embedded Software is explained. In the project, we are developing an upper-process support tool that helps ones formalize specifications of embedded software and verify a certain type of consistency and correctness unless formal method background is equipped. The tool is based on a proof assistant system (Agda) and a software development system (VDM tools), but is designed with the concept of lightweight formal methods. The project is being promoted as joint research with CSK systems West Japan, CSK systems and Macs co. ltd, under the program of the Ministry of Economy, Trade and Industry.","PeriodicalId":189796,"journal":{"name":"2009 Software Technologies for Future Dependable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130977956","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":"Towards Design and Implementation of Model Checker for System Software","authors":"Motohiko Matsuda, T. Maeda, A. Yonezawa","doi":"10.1109/STFSSD.2009.35","DOIUrl":"https://doi.org/10.1109/STFSSD.2009.35","url":null,"abstract":"A model checker is under development as one of the static program checkers for the forthcoming Dependable Embedded Operating System. The checker is designed with priority for scalability, because model checking based on predicate abstraction is promising, but it is not yet applicable to large system software like operating systems. Since the checker is intended to be run everyday in nightly builds, abstraction refinement is not performed on-line but is assumed to be given as hints, because repeating the same refinement is wasting and refinement such as invariant finding sometimes needs human involvement. Being freed from abstraction refinement, the checker can properly handle loops and function calls, and it can keep track of multiple states simultaneously through function calls which is deemed to reduce the cost of state transition calculation. Necessary annotations are provided based on the P-Bus interface, which is a proposed abstract interface internal to the operating system kernel that cleanly separates functionalities of operating systems. The checker works on simple properties attached to the interface in the format of commonly used specification languages.","PeriodicalId":189796,"journal":{"name":"2009 Software Technologies for Future Dependable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131202220","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":"The Challenge of Eliminating Storage Bottlenecks in Distributed Systems","authors":"Takanori Ueda, Yu Hirate, H. Yamana","doi":"10.1109/STFSSD.2009.46","DOIUrl":"https://doi.org/10.1109/STFSSD.2009.46","url":null,"abstract":"One of the most difficult problems in distributed systems is load-balancing. Even if we take care of load-balancing, heavily-loaded nodes often occur while there are still lightly-loaded nodes that have idle memory and idle CPU power. Our idea is to exploit this idle memory and idle CPU power to improve the storage performance of heavily-loaded nodes. Idle memory can be used for caching file data and idle CPU power can be used for extracting file access patterns from file access logs. File access patterns are valuable sources for optimizing a cache strategy. Our project goal is to improve the overall performance of distributed systems by improving storage access performance. This paper gives an overview of this project idea and reports the current status of the project. In addition, we show benchmark results from our prototype cache extension system, which is implemented in Linux Kernel 2.6. The DBT-3 (TPC-H) benchmark results show that our system can increase computer speed by a factor of 6.68.","PeriodicalId":189796,"journal":{"name":"2009 Software Technologies for Future Dependable Distributed Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133451366","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}
Sayaka Akioka, Junichi Ikeda, Takanori Ueda, Yuki Ohno, Midori Sugaya, Yu Hirate, J. Katto, Shigeki Goto, Y. Muraoka, H. Yamana, T. Nakajima
{"title":"A Scalable Monitoring System for Distributed Environments","authors":"Sayaka Akioka, Junichi Ikeda, Takanori Ueda, Yuki Ohno, Midori Sugaya, Yu Hirate, J. Katto, Shigeki Goto, Y. Muraoka, H. Yamana, T. Nakajima","doi":"10.1109/STFSSD.2009.43","DOIUrl":"https://doi.org/10.1109/STFSSD.2009.43","url":null,"abstract":"The total amount of information to process or analyze is jumping sharply with the quick spread of computers and networks. Our project, \"Highly scalable monitoring architecture for information explosion\", develops a monitoring system allows observing systems, merging the system logs, and discovering intelligence to share. More concretely, the project builds the total system to maintain, optimize, and protect autonomically. This paper reports the outcomes of the project after first-half of the development period.The rest of the paper is organized as follows. Section 2 describes the concept and details of the monitoring system on a single node, and Section 3 addresses the aggregation of the collected information in distributed environments. Section 4 and Section 5 introduce applications of the monitoring systems. Section 6 summarizes the project and mentions future plans.","PeriodicalId":189796,"journal":{"name":"2009 Software Technologies for Future Dependable Distributed Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124657978","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}