The issue of ordering class integration in the context of integration testing has been discussed by a number of researchers. More specifically, strategies have been proposed to generate a test order while minimizing s...
详细信息
The issue of ordering class integration in the context of integration testing has been discussed by a number of researchers. More specifically, strategies have been proposed to generate a test order while minimizing stubbing. Recent papers have addressed the problem of deriving an integration order in the presence of dependency cycles in the class diagram. Such dependencies represent a practical problem as they make any topological ordering of classes impossible. This paper proposes a strategy that integrates two existing methods aimed at "breaking" cycles so as to allow a topological order of classes. The first one was proposed by Tai et al and is based on assigning a higher-level order according to aggregation and inheritance relationships and a lower-level order according to associations. The second one was proposed by Le Traon et al and is based on identifying strongly connected components in the dependency graph. Among other things, the former approach may result into unnecessary stubbing whereas the latter may lead to breaking cycles by "removing" aggregation or inheritance dependencies, thus leading to complex stubbing. We propose here an approach that combines some of the principles of both approaches and addresses some of their shortcomings. All approaches (principles, benefits, drawbacks) are thoroughly compared by the means of a case study, based on a real system written in Java.
Various approaches are presented in the literature to identify faultprone components. The approaches represent a wide range of characteristics and capabilities, but they are not comparable, since different aspects are...
详细信息
In order to satisfy, the complex and various demands of the customers, telecommunication networks must provide their services rapidly and flexibly, with the support of efficient service and network management systems....
详细信息
ISBN:
(纸本)0769512305
In order to satisfy, the complex and various demands of the customers, telecommunication networks must provide their services rapidly and flexibly, with the support of efficient service and network management systems. To fulfill these requirements, TINA has appeared as a concept for the advanced telecommunication system using information technology such as distributed processing, object oriented modeling. We mention some problems of developing applications in the TINA service management layer. To solve the problems, we propose the advanced architecture called OMS (object management system), which consists of three managers (data manager, data access manager and metadata registry manager). OMS separates the application layer and the middleware such as ODBC and JDBC. And the application layer and OMS are connected by distributed object middleware based on CORBA. Also in order to manage efficiently managed objects stored in different repositories, we have implemented metadata registry by using the metadata concept.
In the context of software cost estimation, system size is widely taken as a main driver of system development effort, but other structural design properties, such as coupling, cohesion and complexity, have been sugge...
详细信息
ISBN:
(纸本)0769510434
In the context of software cost estimation, system size is widely taken as a main driver of system development effort, but other structural design properties, such as coupling, cohesion and complexity, have been suggested as additional cost factors. In this paper, using effort data from an object-oriented development project, we empirically investigate the relationship between class size and the development effort for a class, and what additional impact structural properties such as class coupling have on effort. We use Poisson regression and regression trees to build cost prediction models from size and design measures, and use these models to predict the system development effort. We also investigate a technique to combine regression trees with regression analysis, which aims at building more accurate models. The results indicate that fairly accurate predictions of class effort can be made based on simple measures of the class interface size alone; mean MREs (magnitudes of relative error) are below 30%. Effort predictions at the system level are even more accurate as, using bootstrapping, the estimated 95% confidence interval for MREs is 3%-23%, but more sophisticated coupling and cohesion measures do not help to improve these predictions to a degree that would be practically significant. However, the use of hybrid models, combining Poisson regression and CART (classification and regression trees) clearly improves the accuracy of the models as compared to using Poisson regression alone.
We present the design, implementation and evaluation of a framework that uses JavaSpaces [1] to support this type of opportunistic adaptive parallel/distributed computing over networked clusters in a non-intrusive man...
详细信息
We present the design, implementation and evaluation of a framework that uses JavaSpaces [1] to support this type of opportunistic adaptive parallel/distributed computing over networked clusters in a non-intrusive manner. The framework targets applications exhibiting coarse-grained parallelism and has three key features: (1) portability across heterogeneous platforms, (2) minimal configuration overheads for participating nodes, and (3) automated system state monitoring (using SNMP) to ensure nonintrusive behavior. Experimental results presented in this paper demonstrate that for applications that can be broken into coarse-grained, relatively independent tasks, the opportunistic adaptive parallel computing framework can provide performance gains. Furthermore, the results indicate that monitoring and reacting to the current system state minimizes the intrusiveness of the framework.
The growth of the Internet and the advent of the computational "Grid" have made it possible to develop and deploy advanced computational collaboratories. These systems build on high-end computational resourc...
详细信息
The growth of the Internet and the advent of the computational "Grid" have made it possible to develop and deploy advanced computational collaboratories. These systems build on high-end computational resources and communication technologies underlying the Grid, and provide seamless and collaborative access to particular resources, services or applications. Integrating these "focused" collaboratories presents significant challenges. Key among these is the design and development of robust middleware support that addresses scalability, service discovery, security and access control, and interaction and collaboration management for consistent access. The authors first investigate the architecture of such a middleware that enables global (Web-based) access to collaboratories. They then present the design and implementation of a middleware substrate that enables a peer-to-peer integration of and global (collaborative) access to geographically distributed instances of the DISCOVER computational collaboratory for interaction and steering.
As every information system becomes connected to every other information system, they form the so-called "information utility". This is the domain in which contemporary distributed systems have to operate. N...
详细信息
As every information system becomes connected to every other information system, they form the so-called "information utility". This is the domain in which contemporary distributed systems have to operate. New applications have to be evolved on this platform of existing systems that may hold inconsistent information. Consequently, solutions need to be able work in a world of only partially correct information. In this paper, we discuss means whereby architects, designers and engineers may, in this context of information inconsistency, develop new business solutions and reason about their validity. In particular we describe the properties of inter-enterprise system architectures for applications working with partially replicated and partially consistent information. These must be able to operate under reversible assumptions and to undo operations as a consequence of reversing assumptions. We have developed exemplary architectures that exhibit these properties, used them to investigate the concept of inconsistency-tolerant components and begun to devise methods of building inter-enterprise applications from such components. This approach, we conjecture, makes reasoning about the validity of proposed inter-enterprise scale solutions more straightforward and thus increases the speed with which new solutions can be deployed. We are evaluating these ideas now, by building, along with our industrial collaborators, realistic enterprise-scale demonstrations in the domains of Finance and Defence.
This paper reports on an ongoing research project aimed at designing and deploying a COMA Commodity Grid (COG) Kit. The overall goal of this project is to explore how commodity distributed computing technologies and s...
详细信息
The proliferation of mobile devices and new software creates a need for computing environments that are able to react to environmental (context) changes. To date insufficient attention has been paid to the issues of d...
详细信息
Validated methods for initial value problems for ordinary differential equations produce bounds that are guaranteed to contain the true solution of a problem. When computing such bounds, these methods verify that a un...
详细信息
Validated methods for initial value problems for ordinary differential equations produce bounds that are guaranteed to contain the true solution of a problem. When computing such bounds, these methods verify that a unique solution to the problem exists in the interval of integration and compute a priori bounds for the solution in this interval. A major difficulty in this verification phase is how to take as large a stepsize as possible, subject to some tolerance requirement. We propose a high-order enclosure method for proving existence and uniqueness of the solution and computing a priori bounds.
暂无评论