There is a growing interest in empirical study in software engineering, both for validating mature technologies and for guiding improvements of less-mature technologies. This paper introduces an empirical methodology,...
详细信息
There is a growing interest in empirical study in software engineering, both for validating mature technologies and for guiding improvements of less-mature technologies. This paper introduces an empirical methodology, based on experiences garnered over more than two decades of work by the Empirical Software engineering Group at the University of Maryland and related organizations, for taking a newly proposed improvement to development processes from the conceptual phase through transfer to industry. The methodology presents a series of questions that should be addressed, as well as the types of studies that best address those questions. The methodology is illustrated by a specific research program on inspection processes for Object-Oriented designs. Specific examples of the studies that were performed and how the methodology impacted the development of the inspection process are also described.
This work intends to present and to analyze a new penalty method that purposes to solve the general nonlinear programming problem subject to inequality constraints. The proposed method has the important feature of bei...
详细信息
This work intends to present and to analyze a new penalty method that purposes to solve the general nonlinear programming problem subject to inequality constraints. The proposed method has the important feature of being completely differentiable and combines features of both exterior and interior penalty methods. Numerical results for some problems are commented on. International Federation of Operational Research Societies 2001.
This work introduces a new technique that enables SDSMs to categorize dynamically and accurately memory sharing patterns in both classes of regular and irregular applications. The categorization is carried out automat...
详细信息
ISBN:
(纸本)0769509908
This work introduces a new technique that enables SDSMs to categorize dynamically and accurately memory sharing patterns in both classes of regular and irregular applications. The categorization is carried out automatically at run-time on a per-page basis, requiring no user or compiler assistance. We evaluate the potential benefits of our technique using execution-driven simulations of 8 applications running on TrendMarks on a network of 8 workstations. Surprisingly, we found that producer-consumer(s) and migratory are the dominant patterns even in irregular applications. Preliminary results suggest that the categorization technique we propose is a promising option to further improve the performance of current adaptive SDSM systems.
Proposes a method for data clustering in a n-dimensional space using the elastic net algorithm which is a variant of the Kohonen topographic map learning algorithm. The elastic net algorithm is a mechanical metaphor i...
详细信息
Proposes a method for data clustering in a n-dimensional space using the elastic net algorithm which is a variant of the Kohonen topographic map learning algorithm. The elastic net algorithm is a mechanical metaphor in which an elastic ring is attracted by points in a bi-dimensional space while their internal elastic forces try to shun the elastic expansion. The different weights associated with these two kinds of forces lead the elastic to a gradual expansion in the direction of the bi-dimensional points. In this method, the elastic net algorithm is employed with the help of a heuristic framework that improves its performance for application in the n-dimensional space of cluster analysis. Tests were made with two types of data sets: (1) simulated data sets with up to 1000 points randomly generated in groups linearly separable with up to dimension 10 and (2) the Fisher Iris Plant database, a well-known database referred to in the pattern recognition literature. The advantages of the method presented are its simplicity, its fast and stable convergence, beyond efficiency in cluster analysis.
In this paper we use execution-driven simulation of a scalable multiprocessor to evaluate the performance of the Andorra-I parallel logic programming system under invalidate and update-based protocols. We use two vers...
详细信息
In this paper we propose a simple extension to the optical network of a scalable multiprocessor that optimizes page swap-outs significantly. More specifically, we propose to extend the network with an optical ring tha...
详细信息
The recent improvements in workstation and interconnection network performance have popularized the clusters of off-the-shelf workstations. However, the usefulness of these clusters is yet to be fully exploited, mostl...
详细信息
The recent improvements in workstation and interconnection network performance have popularized the clusters of off-the-shelf workstations. However, the usefulness of these clusters is yet to be fully exploited, mostly due to the inadequate management of cluster resources implemented by current distributed operating systems. In order to eliminate this problem and approach the computational power of large clusters of workstations, in this paper we propose Nomad, an efficient operating system for clusters of uni and/or multiprocessors. Nomad includes several important characteristics for modern cluster-oriented operating systems: scalability, efficient resource management across the cluster, efficient scheduling of parallel and distributed applications, distributed I/O, fault detection and recovery, protection, and backward compatibility. Some of the mechanisms used by Nomad, such as process checkpointing and migration, can be found in previously proposed systems. However, our system stands out for its strategy for disseminating information across the cluster and its efficient management of all cluster resources. In addition, Nomad is highly scalable as it uses neither centralized control nor extra messages to implement its functionality, taking advantage of the I/O traffic associated with its distributed file system. Our preliminary evaluation of the load balancing aspect of Nomad shows that the pattern of file accesses in our distributed Ale system allows for efficient and scalable load balancing. Our main conclusion is that the complete implementation of Nomad will most likely be efficient and will be a nice platform for future research on operating systems for clusters of workstations.
This paper addresses an approach to behavior testing in object-oriented systems. This approach is used in the MEMPHIS project [1] and emphasis on state-based testing. The key elements are the generation of testing seq...
详细信息
The paper addresses an approach to behavior testing in object oriented systems. This approach is used in the MEMPHIS project (C.M.I. Werner et al., 1997) and emphasis on state based testing. The key elements are the g...
详细信息
The paper addresses an approach to behavior testing in object oriented systems. This approach is used in the MEMPHIS project (C.M.I. Werner et al., 1997) and emphasis on state based testing. The key elements are the generation of testing sequences based on the state transition diagram to test the system objects and the creation of testing scenarios, which allow the verification of object integration.
Carnival is a performance measurement and analysis tool that assists users in understanding the performance of DSM applications and protocols. Using traces of program executions, Carnival presents performance data as ...
详细信息
暂无评论