distributed system monitor of heterogeneous environment is a very important problem in distributed system searching field. this paper describes an asynchronous event relation model, which constructs a hiberarchy event...
详细信息
ISBN:
(纸本)0769524052
distributed system monitor of heterogeneous environment is a very important problem in distributed system searching field. this paper describes an asynchronous event relation model, which constructs a hiberarchy event relation graph according to event equivalent relation, and event ordinal relation, and event independent relation, and event exclusive relation. According to event relation graph, asynchronous event transacting process determines which events will be transacted this model not only reduces numbers of asynchronous events transacted but also can reflect state of monitor object. the periodic method and asynchronous event relation model are compared with monitoring distributed system in this paper. By implementation, the model is efficient.
A connected dominating set of a graph G is a set of nodes of G such that every node in G is either in the set or is adjacent to some node in the set, and the graph induced by the elements of the set is connected Conne...
详细信息
ISBN:
(纸本)0769524052
A connected dominating set of a graph G is a set of nodes of G such that every node in G is either in the set or is adjacent to some node in the set, and the graph induced by the elements of the set is connected Connected dominating sets have major applications in routing in wireless ad-hoc networks. In this paper, we present a distributed self-estabilizing algorithm for finding a connected dominating set of a graph. Starting from an arbitrary initial state, the algorithm finds a connected dominating set in 002) time, where N is the number of nodes. We also show detailed simulation results to indicate that in practice, the algorithm finas small-sized connected dominating sets in a short time.
Grid requires scalable mechanisms that can be used to obtain the information of resources in Grid environment. In this paper, we analyzed the aims and main tasks of Grid Monitoring and the advantage of GAM (Grid monit...
详细信息
ISBN:
(纸本)0769524052
Grid requires scalable mechanisms that can be used to obtain the information of resources in Grid environment. In this paper, we analyzed the aims and main tasks of Grid Monitoring and the advantage of GAM (Grid monitoring Architecture), then proposed a java-based design pattern of Grid Monitoring System (JGMS) on the basis of GMA. the JGMS use special agents to complete the communication between Producer and Consumer in the different grid nodes. So, it can work on different platforms, pass through firewalls and be easy to deploy and use.
Increasing the number of instructions executing in parallel has helped improve processor performance, but the technique is limited. Executing code on parallelthreads and processors has fewer limitations, but most com...
详细信息
ISBN:
(纸本)0769524052
Increasing the number of instructions executing in parallel has helped improve processor performance, but the technique is limited. Executing code on parallelthreads and processors has fewer limitations, but most computer programs tend to be serial in nature. this paper presents a compiler optimisation that at run-time parallelises code inside a JVM and thereby increases the number of threads. We show Spec JVM benchmark results for this optimisation. the performance on a current desktop processor is slower than without parallelthreads, caused by thread creation costs, but withthese costs removed the performance is better than the serial code. We measure the threading costs and discuss how a future computer architecture will enable this optimisation to be feasible in exploiting thread instead of instruction and/or vector parallelism.
A performance model is constructed for parallel iterative numerical methods under the assumption of a message-passing computing system. Arguments are given for the fact that the speedup of parallel iterative methods i...
详细信息
A performance model is constructed for parallel iterative numerical methods under the assumption of a message-passing computing system. Arguments are given for the fact that the speedup of parallel iterative methods is mainly influenced by the speedup at one iterative step. Using the theoretical model, it is proved why explicit iterative methods for ordinary differential equations are inefficient in implementation on distributed memory multiprocessor systems. Numerical tests on parallel and distributedcomputing environments confirm the correctness of the theoretical model at least in the case of iterative methods for ordinary differential equations and time-dependent partial differential equations. (c) 2005 Elsevier Ltd. All rights reserved.
Remote-sensing image processing applications demand large-scale, collaborative processing and storage capabilities. Computational grid can provide abundant powerful computational resources with sharing and cooperation...
详细信息
ISBN:
(纸本)0769524052
Remote-sensing image processing applications demand large-scale, collaborative processing and storage capabilities. Computational grid can provide abundant powerful computational resources with sharing and cooperation in grid environment. this paper gives an introduction to a collaborative processing mechanism based on workflow technology implemented in ImageGrid the main idea is to encapsulate all parallel algorithms of remote-sensing image processing into grid services and recombine them with grid workflow to satisfy more and more complex remote-sensing, image processing applications. In particular, we describe the architecture of the workflow-based grid system and the processing flow. We also give out the algorithm classification and an example of remote-sensing image processing grid application.
How to improve the performance of content searching in peer-to-peer (P2P) systems is a challenging issue. In this paper we attack this problem by proposing a new decentralized P2P architecture ontoloy-based community ...
详细信息
ISBN:
(纸本)0769524052
How to improve the performance of content searching in peer-to-peer (P2P) systems is a challenging issue. In this paper we attack this problem by proposing a new decentralized P2P architecture ontoloy-based community overlays. the system exploits the semantic property of the content in the network to cluster nodes sharing similar interest together to improve the query and searching performance. Specifically, a distributed hash table (DHT) based overlay is constructed to assist peers organizing into communities. those peers in the same community form a Gnutella-like unstructured overlay. this architecture helps reduce the search time and decrease the network traffic by minimizing the number of messages propagated in the system. Moreover, it retains the desirable properties of existing unstructured architectures, including being fully decentralized with loose structure, and supporting complex queries. We demonstrate by simulation, that withthis architecture, peers can get more relevant resources faster and with less traffic generated.
For its simplicity, reliability and maturity, NFS is widely-used in clusters. However, due to its high overheads and implementation limitations, the standard NFS cannot fully exert the potential abilities provided by ...
详细信息
ISBN:
(纸本)0769524052
For its simplicity, reliability and maturity, NFS is widely-used in clusters. However, due to its high overheads and implementation limitations, the standard NFS cannot fully exert the potential abilities provided by multiple network channels and multiple SCSI channely on the server. In this paper, we present a new efficient way to high performance NFS implementation for cluster applications. By adding mechanisms to make good use of NFS server's multiple communication channels and multiple I/O channels, CluserNFS can potentially provide better I/O performance khan standard NFS, as illustrated by our simulation experiment results.
this paper examines technique of media access that flexible media service, provided user interaction, and guaranteeing QoS Currently, there are various streaming services, but the service environment is limited from s...
详细信息
ISBN:
(纸本)0769524052
this paper examines technique of media access that flexible media service, provided user interaction, and guaranteeing QoS Currently, there are various streaming services, but the service environment is limited from specific operating system, each protocol. the media player on the real-time protocol have some problems that media access techniques depend on each network protocol, and the enable commands to control media are different from protocol environments. We propose media player that is able to streaming service using by adaptation on the various protocol and supporting ubiquitous environment. therefore, we analysis streaming protocol for real-time media service and implement control mechanism of player for protocol.
MANET: are composed of mobile nodes without any infrosiructure and nodes cooperate to set up routes for network communications. Because of these characters, MANETs operate in open medium, so they are particularly vuln...
详细信息
ISBN:
(纸本)0769524052
MANET: are composed of mobile nodes without any infrosiructure and nodes cooperate to set up routes for network communications. Because of these characters, MANETs operate in open medium, so they are particularly vulnerable to intrusions. In this paper, we present an efficient intrusion detection system called MAPIDS (Mobile Agent-based Peer-to-peer Intrusion Detection System). On detecting a suspicious activity, MAPIDS initiates a voting approach to make a collective decision and take further action. In contrast to other intrusion detection system based on collective decision, MAPIDS saves more bandwidth and energy and it is immune to sparse nodes problem.
暂无评论