Transaction scheduling and concurrency control are two important problems in a distributed environment. A lot of research has been focused on the problems recently, and many models and measures have been proposed. How...
详细信息
Transaction scheduling and concurrency control are two important problems in a distributed environment. A lot of research has been focused on the problems recently, and many models and measures have been proposed. However, some of them didn't fit for grid environment, as grid architecture is a new and distinguished from conventional distributedcomputing by its heterogeneous, dynamic and autonomous properties. In this paper, we propose a three-level transaction scheduling model for grid database, which not only shows the autonomy of grid but also lightens the pressure of communication and grid scheduler. We consider communication time of a transaction, user's priority and the number of DB sites accessed by the transaction as a priority of the transaction, and give scheduling algorithms for concurrency transaction, which not only supports correctness of the data, but also improves the effectiveness of the system. Petri nets are promising tools for modeling and analysis information processing systems that are characterized as being concurrent, parallel and distributed. We use a dynamic time colored Petri net (DTCPN) to model each level's transaction scheduling and get a DTCPN model for three-level transaction scheduling model of grid database using sharing composition. Finally, we get some important results such as miss rate of transactions by analyzing reachability of Petri nets.
In order to improve the speed and efficiency of dynamic route solution for traffic network, the paper constructs parallel simulation solution framework using distributed and parallel simulation technology and illumina...
详细信息
In order to improve the speed and efficiency of dynamic route solution for traffic network, the paper constructs parallel simulation solution framework using distributed and parallel simulation technology and illuminates parallel simulation strategy which master process assigns sub-task to slave process. At the same time, the parallel simulation algorithm and implemented process of dynamic route solution are designed in microscopic simulation level. It puts forwards network-partition algorithm based on each intersection and communication mode of synchronization between processes to realize dynamic load balancing. It expatiates on the parallelism of simulation module and simulation control of solution algorithm. With designed parallel algorithm, traffic network that is made up of 12 intersections is modeled on different numbers of processors. Results from the simulation demonstrate that simulation speed increases about 2.5 times. Hence, the designed parallel simulation algorithm provides a foundation for larger scale dynamic route solution.
the paper describes a detailed study into the object-oriented implementation of distributed finite element analysis on desktop computers using the NET framework. the software design aspects are described in some detai...
详细信息
the paper describes a detailed study into the object-oriented implementation of distributed finite element analysis on desktop computers using the NET framework. the software design aspects are described in some detail for both direct and iterative solution algorithms. the use of interfaces played an important role in the software design. this, together withthe NET framework, enabled remote objects to be implemented in a relatively seamless fashion. the solution routines were "blind" to whether the objects were local or remote. Numerical tests were carried out and reasonable speed-up was achieved, particularly for direct solution methods. It is concluded that NET provides a viable framework for implementing distributedcomputing on networks of personal computers. (c) 2006 Elsevier Ltd. and Civil-Comp Ltd. All rights reserved.
We propose to address collective communications in distributed components through collective interfaces. Collective interfaces handle data distribution, parallelism and synchronization, and they expose collective beha...
详细信息
ISBN:
(纸本)9780769528335
We propose to address collective communications in distributed components through collective interfaces. Collective interfaces handle data distribution, parallelism and synchronization, and they expose collective behaviors in the definition of components. We show, as an illustration, that collective interfaces allow the encoding of SPMD programming in a better structured and less error prone ways We verify the scalability and performance of collective interfaces in an experiment on up to 100 machines.
this paper presents a High Performance computing-based application for 3D structural analysis of buildings. Since the solution of a large linear system of sparse equations supposes the most time-consuming phase, sever...
详细信息
this paper presents a High Performance computing-based application for 3D structural analysis of buildings. Since the solution of a large linear system of sparse equations supposes the most time-consuming phase, several public domain parallel numerical libraries, with state-of-the-art capabilities, have been tested. the parallel application developed allows reducing the analysis time and simulating larger structures. Nevertheless, structural engineers rarely have available high cost parallel machines. thus, a Grid Structural Analysis service, that integrates the parallel application, has been implemented, taking advantage of computers geographically distributed in Internet. this service makes it possible to simulate in a realistic way, and concurrently, a high number of different structural alternatives of large dimension buildings during their design stage, without considering structural simplifications or investing in expensive computers. (c) 2006 Elsevier Ltd. and Civil-Comp Ltd. All rights reserved.
Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound algorithm requires a huge amount of computational resources. the efficiency of such algorithm can be improved by distributing at larg...
详细信息
ISBN:
(纸本)9780769528335
Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound algorithm requires a huge amount of computational resources. the efficiency of such algorithm can be improved by distributing at large scale the computation required by the exploration of the search tree. In this paper we propose parallelBB, which is a P2P-based parallelization of the Branch-and-Bound algorithm for the computational Grid. the algorithm has been implemented using the ProActive distributed object Grid middleware. the algorithm has been applied to a monocriterion permutation flow-shop problem and promisingly experimented on the Grid5000 computational Grid.
In this paper, we suggest a mechanism for implementing a distributed application using RMI based on JAVA threads. the application is parallel matrices multiplication depending on distributedthe products of rows and c...
详细信息
ISBN:
(纸本)9781424418343
In this paper, we suggest a mechanism for implementing a distributed application using RMI based on JAVA threads. the application is parallel matrices multiplication depending on distributedthe products of rows and columns on different machines. One server and three clients are run to find the product of matrix multiplication. the server distributes the determine blocks of rows and columns on the registered clients. the clients return their product blocks to a server, which calculate the final product of matrix multiplication. Applications of this type will allow loaded servers to transfer part of the load to clients to exploit the computing power available at client side. the time Of matrix multiplication with size of 256 x 256 is reduced by 52.5% by using 3-client and this time can be decreased more in the case of increasing the number of clients.
In this paper we focus on distributed visualization using the Visualization Toolkit (VTK) in grid environments. We propose a distributed architecture, based on data parallelism, that allows the distribution of visuali...
详细信息
ISBN:
(纸本)9780769528335
In this paper we focus on distributed visualization using the Visualization Toolkit (VTK) in grid environments. We propose a distributed architecture, based on data parallelism, that allows the distribution of visualization tasks over a grid environment. We decided for Globus Toolkit as a middleware to provide access and location transparencies. We also add facilities for dynamic allocation of resources by using a Java framework. the focused visualization technique is Laplacian smoothing which is provided by a specific filter of the VTK library. We emphasize the obtained speedup in the experiments and discuss the implementation of pipeline parallelism as well as the generalization of our architecture for other VTK applications.
Grid is a computational environment in which applications can use multiple distributed computational resources in a safe, coordinated, efficient and transparent way. Data Integration Middleware Systems (DIMS) are orig...
详细信息
Recently we proposed algorithms for concurrent execution on multiple clusters [11]. In this case, data partitioning is done at two levels;first, the data is distributed to a collection of heterogeneous parallel system...
详细信息
ISBN:
(纸本)9780769528335
Recently we proposed algorithms for concurrent execution on multiple clusters [11]. In this case, data partitioning is done at two levels;first, the data is distributed to a collection of heterogeneous parallel systems with different resources and startup time, then, on each system the data is evenly partitioned to the available nodes. In this paper we report on a simulation study of the algorithms.
暂无评论