Users of distributedsystems such as the TeraGrid and Open Science Grid can execute their applications on many different systems. We wish to help such users, or the grid schedulers they use, select where to run applic...
详细信息
The monitor construct has been implemented in several concurrent and/or parallel programming languages for shared-memory system environments, Extensions of the monitor to support process synchronization in distributed...
详细信息
ISBN:
(纸本)9783540747413
The monitor construct has been implemented in several concurrent and/or parallel programming languages for shared-memory system environments, Extensions of the monitor to support process synchronization in distributedsystems have also been proposed. But, most existing work only provides the architecture design of the distributed monitor. There is no discussion about the algorithmic and implementation issues. Also, none of them consider how to implement conditional variables. In this paper, we present the design and implementation of a distributed monitor construct, named DisMoniC, for programming process synchronization in distributedsystems. DisMoniC is generic in the sense that it can be used with any distributed mutual exclusion (DME) algorithm to implement exclusive access to the monitor operations. Time-efficient algorithms are proposed to implement conditional process synchronization in the distributed monitor. We also present performance evaluation of the proposed construct.
We propose, a two-layered approach for exploiting different forms of concurrency in complex systems: We specify computational components in our functional array language SAC, which exploits data parallel properties of...
详细信息
We present in this paper multi-thread and multi-process parallelizations of the Fast Multipole Method (FMM) for Laplace equation, for uniform and non uniform distributions. These parallelizations apply to the original...
详细信息
ISBN:
(纸本)9780769529172
We present in this paper multi-thread and multi-process parallelizations of the Fast Multipole Method (FMM) for Laplace equation, for uniform and non uniform distributions. These parallelizations apply to the original FMM formulation and to our new matrix formulation with BLAS (Basic Linear Algebra Subprograms) routines. Differences between the multi-thread and the multi-process versions are detailed, and a hybrid MPI-thread approach enables to gain parallel efficiency and memory scalability over the pure MPI one on clusters of SMP nodes. On 128 processors, we obtain 85% (respectively 75%) parallel efficiency for uniform (respectively non uniform) distributions with up to 100 million particles.
The unstructured Peer-to-Peer (P2P) systems usually use a "blind search " method to find the requested data object by propagating a query to a number of peers randomly. In order to increase the success rate ...
详细信息
We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. First it can reduce communication time due to a lo...
详细信息
ISBN:
(纸本)9780769529172
We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. First it can reduce communication time due to a lower total volume of communication and a more efficient communication schedule. When the network topology is a linear array this partitioning always results in a lower total volume of communication compared to existing partitionings, provided the most powerful node is at the center of the array. When the topology is fully connected this partitioning results in a lower total volume of communication for all but a few power ratios. Second, it allows for the overlapping of communication and computation. These two inherent advantages work together to reduce overall execution time significantly.
We propose several models based on discrete-time Markov chains for the analysis of distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well as a Stealth DHT adaptation of Pastry to...
详细信息
In this paper, we consider new issues in building secure p2p file sharing systems. In particular, we define a powerful adversary model and consequently present the requirements to address when implementing a threat-ad...
详细信息
In this paper we present a software tool for the simulation of distributed real-time embedded systems. Our tool is based on the popular NS-2 package for simulating the networking aspects, and on the RTSim package for ...
详细信息
The Resource Description Framework provides a powerful model for structured knowledge representation that allows the inference of new knowledge. Because of the anticipated scope of semantic information available in th...
详细信息
ISBN:
(数字)9783540716617
ISBN:
(纸本)9783540716600
The Resource Description Framework provides a powerful model for structured knowledge representation that allows the inference of new knowledge. Because of the anticipated scope of semantic information available in the future, centralized databases will become incapable of handling the load. Peer-to-Peer based distributeddatabases offer better scalability and integration of many different data sources. In this paper we present a detailed data management strategy for a DHT based RDF store that provides reasoning, robustness, and load-balancing.
暂无评论