Two common approaches for predicting the response times of distributed enterprise applications on new server architectures are solving queuing models and extrapolating from previously gathered performance data. The dy...
详细信息
Two common approaches for predicting the response times of distributed enterprise applications on new server architectures are solving queuing models and extrapolating from previously gathered performance data. The dynamic recalibration of a layered queuing model and a historical model is investigated experimentally using the IBM Websphere Performance Sample benchmark. It is found that these models can make predictions for new server architectures at a low recalibration overhead with accuracies of 84% and 83%, respectively. The methods are evaluated considering: model recalibration, the responsiveness of predictions, the systems which can be modelled, and ease of use given a minimal level of performance modelling expertise.
distributed Virtual Environments (DVEs) are distributedsystems that allow multiple geographically distributed users to interact concurrently in a shared virtual world. With recent advances in computer graphics, netwo...
详细信息
distributed Virtual Environments (DVEs) are distributedsystems that allow multiple geographically distributed users to interact concurrently in a shared virtual world. With recent advances in computer graphics, network technologies and CPU processing power, DVEs are very popular nowadays. These systems are currently used in many different types of application, such as collaborative design, military training, e-learning, multi-player games, etc. In general, the most important requirements for DVEs are scalability, consistency and responsiveness. The communication architecture of DVEs is one of the key factors that should be considered to address these requirements. In this paper, we describe a communication architecture for DVEs based on the High Level Architecture (HLA). A prototype implementation with this architecture, the prey-predator federation, is also presented together with some preliminary characterization experiments and results.
Resource management is central to grid computing and plays a vital role in ensuring that the jobs execute both successfully and economically on the grid. In this paper, we present an analysis of the factors affecting ...
详细信息
Resource management is central to grid computing and plays a vital role in ensuring that the jobs execute both successfully and economically on the grid. In this paper, we present an analysis of the factors affecting resource allocation and illustrate the same in the case of disk space aggregation. We explore the feasibility of a comprehensive resource aggregation network that can bind fragmented resources together to provide a unified resource for grid jobs. We provide an implementation framework to realise resource aggregation, by adopting and enhancing the Alchemi [1] framework.
A distributor is a time-multiplexed switch that routes active input signals to output ports in the round-robin fashion. This paper presents the Merge-Distribute algorithm for the recursive construction of distributors...
详细信息
A distributor is a time-multiplexed switch that routes active input signals to output ports in the round-robin fashion. This paper presents the Merge-Distribute algorithm for the recursive construction of distributors in the form of paralleldistributed-control networks, as analogous to the recursive construction of sorting networks by the Mergesort algorithm. The Merge-Distribute algorithm achieves the best known depths for distribution networks of all sizes within the practical range. The rigorous algebraic formulation AMkeeps the algorithmic construction transparent and affords many variations in the construction so as to flexibly cope with ad hoc engineering constraints in implementation.
This paper identifies the need for multiple clients to concurrently access a device community. A set of embedded devices cooperate via one or more service discovery protocols, such as UPnP, Jini, HAVi or OSGi. We pres...
详细信息
This paper identifies the need for multiple clients to concurrently access a device community. A set of embedded devices cooperate via one or more service discovery protocols, such as UPnP, Jini, HAVi or OSGi. We present an approach that encapsulates additional services into a distributed Access Framework (DAF). The services in DAF are responsible for secure and coordinated access of the distributed devices in the community. The different services of DAF can optionally be implemented and executed on different devices. We specify the DAF and demonstrate an implementation where the devices are organized according to the OSGi specification.
One of the basic services in the Grid is resource discovery. When a user request services, he gives a set of attributes that should be satisfied by a candidate resource. The resource discovery mechanism returns a set ...
详细信息
One of the basic services in the Grid is resource discovery. When a user request services, he gives a set of attributes that should be satisfied by a candidate resource. The resource discovery mechanism returns a set of best resources for the given set of attributes. We present two P2P protocols for resource discovery: the Query Resource Discovery Mechanism (QRDM), and the Seeking Resource Discovery Mechanism (SRDM). They are based on the main characteristics of P2P systems: decentralization and selforganization.
The Internet is showing a potential of forming of a supercomputing resource out of networked computers. It is to harness the combined resources of millions of computers connected to the Internet, forming a powerful he...
详细信息
The Internet is showing a potential of forming of a supercomputing resource out of networked computers. It is to harness the combined resources of millions of computers connected to the Internet, forming a powerful heterogeneous computing environment for running coarse-grain parallel applications. The paralleldistributed processing has the high cost-performance ratio application on the Internet. The Internet also has some of unpredictable varieties such as heterogeneity of hosts, various states of hosts, performance of each host to be support continuously, and the number of hosts which are participated in computation and so on. For considering the property of Internet, this paper should provide Grid Service Architecture called paralleldistributed Processing(PDP) which is a parallelcomputing framework implemented with Java for parallelcomputing over the Internet. Therefore, for the parallel processing on the Internet, we propose the strategy of uniform task allocation, CPU performance task allocation, and adaptive task allocation based on CPU performance. This paper also shows an algorithm of dynamic host management, which is changed by the number of host during execution time on PDP. Finally, this paper presents the architecture, the message passing protocol and control flow of PDP and shows the results of performance evaluation for cockpit algorithms on PDP.
This paper presents a simulation-based environment to study fault effects in message missing failures in CAN-based systems. A CAN controller is modeled by VHDL at behavioral level and is exploited to set up a network ...
详细信息
This paper presents a simulation-based environment to study fault effects in message missing failures in CAN-based systems. A CAN controller is modeled by VHDL at behavioral level and is exploited to set up a network composed of several nodes. A total of 27,000 transient faults of seven types are injected into five critical portions of the system including the bus and four portions of the CAN controller. The experimental results show that the faults affect the message sending in which more than 20% of faults cause the failure. Besides, with a heavy workload, faults that are occurred into the CAN controller and on the bus cause about 90% and 10% of all failures, respectively.
Modern methods in molecular biology produce a tremendous amount of data. As a consequence, efficient methods have to be developed to retrieve and analyze these data. In this article, a parallel algorithm searching mot...
详细信息
Modern methods in molecular biology produce a tremendous amount of data. As a consequence, efficient methods have to be developed to retrieve and analyze these data. In this article, a parallel algorithm searching motifs based on ParSeq, a software tool for motif search, is put forward and its performance analyzed and discussed. Many experiments show that with this parallel algorithm a considerable improvement upon the sequential motif search algorithm is achieved.
The management of distributed service systems is a complex task as changes in the system and the environment may induce reconfiguration tasks to be handled. In this paper, we deal with the automated reconfiguration of...
详细信息
The management of distributed service systems is a complex task as changes in the system and the environment may induce reconfiguration tasks to be handled. In this paper, we deal with the automated reconfiguration of service-oriented, embedded systems. Depending on the environment such a system encounters, some of the services may need to be reconfigured depending on certain conditions like temperature or battery state. In our approach, the task of automatic adaptation to a changing environment is divided into two parts: At design time, various configurations are generated for a service and are mapped to specific environmental conditions. For this we adopt the approach of model-based management and GRBAC to ease the creation of complex management policies. At runtime, a reconfiguration service gets aware of changes in the environment, selects the appropriate configurations for the services it is responsible for, and enforces the new configurations.
暂无评论