V. Toporkov, A. Toporkova, A. Tselishchev, D. Yemelyanov
{"title":"Job and Application-Level Scheduling: An Integrated Approach for Achieving Quality of Service in Distributed Computing","authors":"V. Toporkov, A. Toporkova, A. Tselishchev, D. Yemelyanov","doi":"10.1109/DepCoS-RELCOMEX.2009.10","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.10","url":null,"abstract":"This paper presents the scheduling strategies in distributed computing. The fact that architecture of the computational environment is distributed, heterogeneous, and dynamic along with autonomy of processor nodes, makes it much more difficult to manage and assign resources for job execution which fulfils user expectations for quality of service (QoS). The strategies are implemented using a combination of job-flow and application-level techniques of scheduling and resource co-allocation. Strategy is considered as a set of possible job scheduling variants with a coordinated allocation of the tasks to the processor nodes. Applications are regarded as compound jobs with a complex structure containing several tasks. The choice of the specific scheduling depends on the load level of the resource dynamics and is formed as a resource request, which is sent to a local batch-job management system.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124425694","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}
V. Koutras, Christoforos-Panagiotis S. Salagaras, A. Platis
{"title":"Software Rejuvenation for Higher Levels of VoIP Availability and Mean Time to Failure","authors":"V. Koutras, Christoforos-Panagiotis S. Salagaras, A. Platis","doi":"10.1109/DepCoS-RELCOMEX.2009.21","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.21","url":null,"abstract":"Recently, Voice over Internet Protocol (VoIP) has become an evolutionary technology in the communication area. Despite its innovative nature, VoIP faces some problems such as resource degradation on the server supporting the system. In this paper a VoIP system consisting of the main parts that can affect the VoIP service such as SIP servers, routers, ISP internet service provider, firewalls and finally the electrical power is studied. To counteract the aforementioned problems concerning servers we propose to adopt software rejuvenation. Rejuvenation is a proactive technique that can be periodically adopted to prevent software failures. Our main aim is to determine how VoIP availability and reliability can be affected by rejuvenation. Continuous Time Markov Chain (CTMC) is used to model system’s function while asymptotic availability and Mean Time To Failure (MTTF) when rejuvenation is performed are determined. Moreover we are interested on the optimal rejuvenation policy that improves system’s performance.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116191895","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}
Antônio da Silva, Alberto Gonzalez-Calero, José-Fernán Martínez, Lourdes López-Santidrián, A. García, Vicente Hernández
{"title":"Design and Implementation of a Java Fault Injector for Exhaustif® SWIFI Tool","authors":"Antônio da Silva, Alberto Gonzalez-Calero, José-Fernán Martínez, Lourdes López-Santidrián, A. García, Vicente Hernández","doi":"10.1109/DepCoS-RELCOMEX.2009.27","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.27","url":null,"abstract":"Java is a successful programming environment and its use has grown from little embedded applications until enterprise network servers based on J2EE. This intensive use of Java demands the validation of their fault tolerance mechanisms to avoid unexpected behavior of the applications at runtime. This paper describes the design and implementation of a fault injector for the “Exhaustif®” SWIFI tool. A specific fault model for java applications that include class corruption/substitution at loading time, method call interception and unexpected exception thrown is proposed. The injector uses the JVMTI (Java Virtual Machine Tool Interface) to perform bytecode instrumentation at runtime to carry out the fault model previously defined. Finally a XML formalization of the specific Java fault model is proposed. This approach, JVMTI + XML fault model description, provides complete independency between the system under test and the fault injection tool, as well the interoperability with another SWIFI tools.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125687054","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":"Spectral Graph Theory and Network Dependability","authors":"Alvaro Torres, G. Anders","doi":"10.1109/DepCoS-RELCOMEX.2009.52","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.52","url":null,"abstract":"The paper introduces methods of graph theory for ranking substations of an electric power grid. In particular, spectral graph theory is used and several ranking algorithms are described. The procedure is illustrated on a practical numerical example","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133240162","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":"A Tool for Dependable and Distributable Presentations","authors":"Bernhard Fechner, Oliver Körber","doi":"10.1109/DepCoS-RELCOMEX.2009.26","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.26","url":null,"abstract":"At the end of this decade, the Lisbon 2010 goals are to be reached. One of these goals is the virtual classroom preceding the virtual office, familiarizing students with the demands of an online workplace. Today’s eLearning platforms offer a wide variety of learning styles. Nearly every university offers electronic courses. While the connectivity to ICT infrastructures is rising, there is still a need to ensure that eLearning opportunities are equally available across geographic, social and personal boundaries. The Lisbon goals cannot be reached, if the underlying software is expensive and opaque. This work presents one substantial element for virtual classrooms, as well as for virtual workplaces. It is a tool to remotely control presentations of the most popular presentation software, enabling virtual seminars or virtual conferences at different hosts, simultaneously distributing high-quality presentations at different locations or, to do dependable presentations on different hosts at the same location with low bandwidth demands. A pleasant side effect is that disabled people now have a well-priced opportunity to remotely control presentations. The software is written in Java and thus portable to other platforms. The communication can be easily secured through VPN.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125892125","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":"Information Systems Performance Analysis Using Task-Level Simulator","authors":"T. Walkowiak","doi":"10.1109/DepCoS-RELCOMEX.2009.49","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.49","url":null,"abstract":"The paper presents the approach to modeling and simulation of information systems. The systems are being analyzed from the point of services realized by them. Therefore, the system is modeled as a network of interacting tasks and technical infrastructure required for the service realization. Paper, presents the formal model of a system, accompanied with model of a task realization. Moreover, a description of developed simulator, a case study with exemplar results and simulator performance analysis is given.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126109806","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":"A Comparison of Structural Testing Strategies Based on Subdomain Testing and Random Testing","authors":"K. Worwa","doi":"10.1109/DepCoS-RELCOMEX.2009.20","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.20","url":null,"abstract":"Both partition testing and random testing methods are commonly followed practice towards selection of test cases. For partition testing, the program’s input domain is divided into subsets, called subdomains, and one or more representatives from each subdomain are selected to test the program. In random testing test cases are selected from the entire program’s input domain randomly. The main aim of the paper is to compare the fault-detecting ability of partition testing and random testing methods. The results of comparing the effectiveness of partition testing and random testing may be surprising to many people. Even when partition testing is better than random testing at finding faults, the difference in effectiveness is marginal. Using some effectiveness metrics for testing and some partitioning schemes this paper investigates formal conditions for partition testing to be better than random testing and vice versa.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"112 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131154004","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":"UML 2 Interaction Overview Diagram Validation","authors":"T. Bouabana-Tebibel","doi":"10.1109/DepCoS-RELCOMEX.2009.47","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.47","url":null,"abstract":"UML 2 interaction overview diagram, IOD for short, is a variant of UML activity diagrams where the nodes may be interaction diagrams. Introduced on the UML 2 version, this diagram gathers benefits related to specific and global behaviors. When the nodes are sequence diagrams, it allows a valuated control flow specification. We propose in this paper an approach to validate the IOD notation. The validation is made by model checking using the hierarchical Petri nets derived from the IOD diagrams.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133255276","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":"Fault-Masking Capabilities of Basic Circuit Structures","authors":"Bernhard Fechner","doi":"10.1109/DepCoS-RELCOMEX.2009.25","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.25","url":null,"abstract":"In this work, we present a theoretical model, which allows computing the effective fault rate of basic, regular circuit structures by paper and pencil. It therefore is possible to compute the masking capabilities of a circuit in the modeling phase - before the circuit is implemented. It furthermore allows calculating how much a fault can propagate within a circuit, may it be transient or permanent. The result is the maximal vulnerability of a circuit on gate-level. As an example, we take addition, since it is an essential operation in nearly every computing system. Over the years, many different methods with different minimum constraints concerning area and time have been developed. Parallel prefix adders are very regular in their structure, so that their vulnerability can be easily computed. The result of the exemplary examination is a ranking concerning the masking capabilities of such adders.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115323702","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":"Selection of Tripping Times for Distance Protection Using Probabilistic Fault Trees with Time Dependencies","authors":"T. Babczynski, M. Lukowicz, J. Magott","doi":"10.1109/DepCoS-RELCOMEX.2009.18","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.18","url":null,"abstract":"Distance protection of electrical power system is analyzed. This protection is based on local and remote relays. Hazard is the event: remote circuit breaker tripping provided the local circuit breaker can be opened. Coordination of operation of protection relays in time domain is important and difficult problem. Incorrect values of delay times of protection relays can cause the hazard. In the paper, the impact of delay time settings on performance of protective scheme is analyzed using Probabilistic Fault Trees with Time Dependencies (PFTTD). PFTTD are introduced in the paper and used for the above-mentioned hazard analyzes. The outcomes are hazard probabilities as a function of delay time values.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"422 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133550789","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}