In this paper detailed analysis of discrete state observers from the point of view of potential time expenses required for the observer computation is presented. the aim of this article is to present, what is the infl...
详细信息
ISBN:
(纸本)9780889866331
In this paper detailed analysis of discrete state observers from the point of view of potential time expenses required for the observer computation is presented. the aim of this article is to present, what is the influence of choice of observer parameters on computation time consumption. the attention is paid most of all on the analysis of the possibility of application of the control systems in a distributed version in the context of discrete state reconstruction. All of numerical tests are conducted in the LAM/MPI environment.
distributed virtual worlds encompass a number of different possible user interactions. these are realized as interaction events that need to be reflected in all user's views in a timely and synchronous fashion. th...
详细信息
ISBN:
(纸本)9781467345651;9780769549033
distributed virtual worlds encompass a number of different possible user interactions. these are realized as interaction events that need to be reflected in all user's views in a timely and synchronous fashion. this is difficult because of two aspects: A) user requirements vary for different events and due to B) restricted system resources, mainly network delay. In this paper we present a framework that allows the processing of events using different synchronization protocols depending on the user requirements. We integrate existing protocols into the framework allowing different handling of events.
the message passing interface (MPI) is a commonly used application programming interface for the development of portable parallel programs. It is easy, however, to create MPI programs that are prone to deadlock. It is...
详细信息
the message passing interface (MPI) is a commonly used application programming interface for the development of portable parallel programs. It is easy, however, to create MPI programs that are prone to deadlock. It is desirable to be able to detect these deadlocks in running programs. It is further desirable to perform this deadlock detection in a distributed manner, without assuming the existence of shared memory for communication. A distributed deadlock detector has been developed that can find deadlocks with a very low overhead and minimal additional communication required among nodes. the detector makes use of the MPI profiling layer, allowing it to be added to a program at link time, requiring no change or recompilation of the user's code. the detector has also been tested on widely varying MPI implementations, demonstrating its portability.
Program analysis is an important activity to evaluate and subsequently improve the quality of software. Many different visualization tools offer more or less sophisticated functionality for this task. However, the vis...
详细信息
Program analysis is an important activity to evaluate and subsequently improve the quality of software. Many different visualization tools offer more or less sophisticated functionality for this task. However, the visual capabilities of the tool are usually pre-defined by the tool developers' intentions or are only marginally adaptable to the user's needs. On contrary, the VisWiz tool offers a means of providing user-defined visualization for analysis of parallel and distributed programs. By configuring the mapping of observed events and their relations using a XML configuration file, users are able to develop specialized graphical displays, which better suit their expectations and improve program comprehension. Examples of VisWiz are given for debugging, performance tuning, and runtime monitoring of parallel and distributed programs.
Current visual text mining platforms are still focused on small or medium-scale datasets and sequential algorithms. However, as document collections increase in size and complexity, more computing resources are requir...
详细信息
ISBN:
(纸本)9780889867741
Current visual text mining platforms are still focused on small or medium-scale datasets and sequential algorithms. However, as document collections increase in size and complexity, more computing resources are required in order to achieve the expected interactive experience. In order to address the scalability problem, this paper proposes and evaluates parallel implementations for three critical visual text mining algorithms. Experiments withthe parallel solutions were conducted for varying dataset sizes and different numbers of processors. the results show a good speedup for the proposed solutions and indicate the potential benefits of exploring task parallelism in critical algorithms to improve scalability of an interactive visual text mining platform.
Single linkage (SLINK) hierarchical clustering algorithm is a preferred clustering algorithm over traditional partitioning-based clustering as it does not require the number of clusters as input. But, due to its high ...
详细信息
ISBN:
(纸本)9781509042975
Single linkage (SLINK) hierarchical clustering algorithm is a preferred clustering algorithm over traditional partitioning-based clustering as it does not require the number of clusters as input. But, due to its high time complexity and inherent data dependencies, it does not scale well for large datasets. To the best of our knowledge, all existing parallel SLINK algorithms are based on the traditional SLINK algorithm and thus require large number of computing resources. In this paper, we present a novel optimization of SLINK algorithm, GridSLINK, which is an order of magnitude faster than the existing state-of-the-art implementation. the optimization in GridSLINK comes from reduction in number of distance calculations required by SLINK. this reduction is achieved by exploiting spatial locality of data points and using an adaptive gridding technique. GridSLINK is parallelized for distributed memory systems. Scalable performance is achieved for increasing number of compute nodes. the proposed parallel algorithm, dGridSLINK, is benchmarked against the best existing parallel algorithm in literature and found to outperform the latter for all the real datasets considered. dGridSLINK can cluster millions of data points in few seconds/minutes using a small number of processing elements, without compromising the quality of clustering.
this paper deals with service management in the large distributedsystems. A framework called Remote Maintenance Shell (RMS) is presented. It enables the distributed service management operations (deployment, configur...
详细信息
this paper deals with service management in the large distributedsystems. A framework called Remote Maintenance Shell (RMS) is presented. It enables the distributed service management operations (deployment, configuration, control, monitoring, upgrading, and versioning), as well as the advanced features related to the verification on the actual target system. RMS is based on the operations performed by mobile agents that act within an agent team. the case study elaborates a scenario in which RMS prototype is used for managing a service employed in the distributed environment.
On parallelsystems, jobs that request a large fraction of the maximum resources available on the system may incur poor wait time. this paper evaluates whether giving a reservation to every waiting job can improve lar...
详细信息
On parallelsystems, jobs that request a large fraction of the maximum resources available on the system may incur poor wait time. this paper evaluates whether giving a reservation to every waiting job can improve large jobs without significantly degrading the performance of other jobs. Using a wide range of workloads, including more recent workloads than SP2 workloads, and a more complete set of performance measures than in previous studies, we provide new observations of potential benefit and problem of reservation policies that give all jobs a reservation.
暂无评论