Managing continuously changing requirements is adifficult and time consuming task in large projects. Change management if not done properly often leads toproject failure. Requirement Change Management (RCM) process mo...
详细信息
ISBN:
(纸本)9780889867307
Managing continuously changing requirements is adifficult and time consuming task in large projects. Change management if not done properly often leads toproject failure. Requirement Change Management (RCM) process models are surveyed and evaluated on the criteria of roles, activities, artifacts and representation which are fundamental and necessary for a good process model. This evaluation is extended to update the work already done in literature. The deficiencies present in current RCM literature are highlighted. The ontology for process model has already been proposed elsewhere. Using that ontology we propose an RCM process model in this paper. This RCM process model improves upon the deficiencies identified, and it also introduces some new concepts. The process is modeled using UML activity diagram. The purpose of the process model is to provide a more complete and detailed guideline than already present. It will help the practitioners to effectively manage requirement change in large projects.
As ad hoc networks are continuously growing in size, we are facing the prospect of emerging wireless networks with millions of nodes. Geographic routing algorithms are a better alternative to traditional ad hoc routin...
详细信息
ISBN:
(纸本)9780889867307
As ad hoc networks are continuously growing in size, we are facing the prospect of emerging wireless networks with millions of nodes. Geographic routing algorithms are a better alternative to traditional ad hoc routing algorithms in this new domain for point-to-point routing. But deployments of such algorithms are currently very uncommon because of some practical difficulties. This paper explores techniques that address two major issues in the deployment of geographic routing algorithms: (i) the costs associated with distributed planarization and (ii) the non availability of location information of a node. We present and evaluate a new algorithm for geographic routing: Greedy distributed Tree Routing (GDTR).The previous geographic routing algorithms require the planarization of the network connectivity graph where as GDTR switches to routing on a spanning tree instead of a planar graph when packets end up at dead ends during greedy forwarding. To opt a direction on the tree that is most likely to make progress towards the destination, each GDTR node maintains a summary of the area covered by the subtree below each of its tree neighbors using convex hulls. This distributed data structure is called a hull tree. GDTR not only requires an order of magnitude less resource to maintain these hull trees than the Cross- Link Detection Protocol CLDP, the only distributed planarization algorithm that is known to work with practical radio networks, it often achieves better routing performance than previous planarization-based geographic routing algorithms.
Reliability in computer or engineering systems is undoubtedly a key requirement in the development process. Safety within critical control systems, and reliable data transfers, require tolerance to unexpected and unwa...
详细信息
ISBN:
(纸本)9780889867307
Reliability in computer or engineering systems is undoubtedly a key requirement in the development process. Safety within critical control systems, and reliable data transfers, require tolerance to unexpected and unwanted phenomena. In biology, new cells can replace damaged cells [1], DNA is able to repair and replicate with error control [1]. These processes are essential to maintain the overall organism. Biology has often been a successful inspiration in computation (artificial neural networks, genetic algorithms, ant colony optimisation, etc) although conventional computation differs widely from natural computation. In this respect, [2] introduced systemic computation (SC), a model of interacting systems with natural characteristics and suggested a new computer architecture. Following this work, [3] introduced a systemic computer as a virtual machine running on conventional computers. In this paper we show, using a genetic algorithm implementation running on this platform, how crash-proof programs following the SC paradigm have native fault-tolerance and easily integrated self-maintenance.
The proceedings contain 110 papers. The topics discussed include: an evaluation of parallel algorithms on current memory consistency models;vertex-disjoint paths in transposition graphs;implementation of surface-to-su...
详细信息
The proceedings contain 110 papers. The topics discussed include: an evaluation of parallel algorithms on current memory consistency models;vertex-disjoint paths in transposition graphs;implementation of surface-to-surface contact algorithms using iterative solvers on parallel computers;wavelength assignment for broadcasting in sparse conversion tree networks with fewest converters;a two-phase scheduling approach for grid computing;parallelization of multimedia applications on the multi-level computing architecture;co-operation of processes in parallel simulated annealing;model-based design of the communication system in an integrated architecture;improved asynchronous group mutual exclusion in token-passing networks;global static-priority scheduling of sporadic task systems on multiprocessor platforms;approximating the buffer allocation problem using epochs;and entropy properties in program behaviors and branch predictors.
The paper presents an approach to QoS management in distributed service oriented systems. We study the approach by the example of the Cassandra Framework developed at Philips Research. Cassandra is a distributed video...
详细信息
ISBN:
(纸本)9780889866379
The paper presents an approach to QoS management in distributed service oriented systems. We study the approach by the example of the Cassandra Framework developed at Philips Research. Cassandra is a distributed video/audio streaming and analysis platform consisting of a collection of loosely-coupled services, which can be easily combined to build distributed applications. To manage QoS of the system, two QoS attributes are selected: availability and performance. We tackle these issues in a service oriented fashion, making the system tolerant to service failures and adaptable to varying requirements of the applications.
In this paper we propose a new load balancing algorithm for the grid computing service. The proposed load balancing is based on the CPU speed of the workers in the grid system. We developed a simulation model using NS...
详细信息
ISBN:
(纸本)9780889866379
In this paper we propose a new load balancing algorithm for the grid computing service. The proposed load balancing is based on the CPU speed of the workers in the grid system. We developed a simulation model using NS2 to evaluate the performance of our load balancing algorithm. Our simulation results show an asymptotically optimal behaviour of our load balancing algorithms.
A large number of tasks in distributedsystems are based on the fundamental problem of tracing the causal dependencies among the events that characterize a run of the computation. This problem is commonly solved by ap...
详细信息
ISBN:
(纸本)9780889866379
A large number of tasks in distributedsystems are based on the fundamental problem of tracing the causal dependencies among the events that characterize a run of the computation. This problem is commonly solved by appliance of vector clocks as a means of capturing the flow of information within and among distributed processes. In the paper at hand a new kind of logical clock concept is presented and examined that is meant to overcome the vector clocks' great drawback: that the number of processes in the distributed system has to be constant and known in advance. Tree clocks are designed to naturally and efficiently scale with the dynamic creation and termination of processes without losing their primary functionality, such as causality tracing, event ordering, and gap detection. In most aspects, they even are more efficient than vector clocks.
We introduce a parallelized molecular dynamics (MD) simulation adapted for the IBM Blue Gene/L supercomputer. We begin by describing the parallel MD code. Next we discuss how parallel MD was tuned for Blue Gene/L. We ...
详细信息
ISBN:
(纸本)9780889866379
We introduce a parallelized molecular dynamics (MD) simulation adapted for the IBM Blue Gene/L supercomputer. We begin by describing the parallel MD code. Next we discuss how parallel MD was tuned for Blue Gene/L. We then show the results for some test targets, related to disease associated proteins, that we have run on Blue Gene/L and the efficiency we have achieved. Finally, we mention some future directions that we envisage undertaking as a continuation of this project.
In this paper, the design and implementation of a recently developed clustering algorithm NNCA [1], Nearest Neighhour Clustering Algorithm, is proposed in conjunction with a Fast K Nearest Neighbour (FKNN) strategy fo...
详细信息
ISBN:
(纸本)9780889866379
In this paper, the design and implementation of a recently developed clustering algorithm NNCA [1], Nearest Neighhour Clustering Algorithm, is proposed in conjunction with a Fast K Nearest Neighbour (FKNN) strategy for further reduction in processing time. The parallel algorithm (PNNCA) has the ability to cluster pixels of retinal images into those belonging to blood vessels and others not belonging to blood vessels in a reasonable time.
Operating system virtualization has recently become a popular technique to achieve better resource utilization in so-called '' server farm '' environments. This technique provides a virtual hardware in...
详细信息
ISBN:
(纸本)9780889866379
Operating system virtualization has recently become a popular technique to achieve better resource utilization in so-called '' server farm '' environments. This technique provides a virtual hardware interface on top of which one can run multiple instances of popular operating systems. The Xen Virtual Machine Monitor is an implementation of operating system virtualization that supports live migration, the transfer of a virtual operating system from one physical machine to another with minimal down time. We have utilized this capability to implement a monitoring and dynamic reconfiguration daemon that attempts to equalize the load on all host nodes in a group of machines running Xen. We have also implemented a simulator for testing balancing algorithms. Experiments using these tools have provided insight into the redistribution of virtualized operating systems and how this differs from the more thoroughly-studied problem of process-level load balancing.
暂无评论