The present advances in parallel and distributedprocessing and its application to database operations such as join resulted in investigating parallel algorithms. Hash based join algorithms involve a costly data parti...
详细信息
The present advances in parallel and distributedprocessing and its application to database operations such as join resulted in investigating parallel algorithms. Hash based join algorithms involve a costly data partitioning phase prior to the join operation. This paper presents new parallel join algorithms for relations based on grid files where no costly partitioning phase is involved, hence the performance can improve.
Large-scale simulation and optimization are demanding applications that require high-performance computing platforms. Because their economic impact is fundamental to the industry, they also require robust, seamless an...
详细信息
ISBN:
(纸本)9781424450824
Large-scale simulation and optimization are demanding applications that require high-performance computing platforms. Because their economic impact is fundamental to the industry, they also require robust, seamless and effective mechanisms to support dynamic user interactions, as well as fault-tolerance and resiliency on parallel computing platforms. distributed workflows are considered here as a means to support large-scale dynamic and resilient multiphysics simulation and optimization applications, such as multiphysics aircraft simulation.
In this paper we present our efforts to parallelize an unstructured quadrilateral mesh generator. Its serial version is based on the divider-and-conquer idea, and mainly includes two stages, i.e. geometry decompositio...
详细信息
ISBN:
(纸本)3540297693
In this paper we present our efforts to parallelize an unstructured quadrilateral mesh generator. Its serial version is based on the divider-and-conquer idea, and mainly includes two stages, i.e. geometry decomposition and mesh generation. Both stages are parallelized separately. A couple of parallel models are introduced and compared to parallelize the stage of geometry decomposition. A fine-grain level parallel algorithm proves preferable to that based on the task-dependency tree, with which the load imbalance brought by the improper utilization of the symmetry of the vertex pair matrix is removed nicely. Since the number of elements in sub-domains could be pre-computed before meshing, a simple static load balancing scheme is investigated, and the effect of granularity is also discussed briefly. Finally, experiments are designed to evaluate the performance of the parallel mesh generator in detail.
In this paper, we proposed a new QoS framework with distributed Adaptive Resource Management (DARM). DARM provides end-to-end QoS guarantees to individual flows with minimal overhead, while keeping the scalability cha...
详细信息
ISBN:
(纸本)3540297693
In this paper, we proposed a new QoS framework with distributed Adaptive Resource Management (DARM). DARM provides end-to-end QoS guarantees to individual flows with minimal overhead, while keeping the scalability characteristic of DiffServ. In DARM, per-flow admission control and resource reservation, in conjunction with a novel IPv6 flow label mechanism, can be processed instantaneously in a fully distributed and independent manner at edge of network without hop-by-hop signaling. In addition, DARM is capable of reconfiguring network resource adaptively according to dynamically changing of traffic load. Through extensive simulations, the results clearly exhibit that DARM has a better overall performance comparing to the IntServ and DiffServ.
With the popularity of wireless networking and mobile devices, mobilecomputing has changed the way we live and work. The special characteristics of mobile environments,such as highly variable connectivity, disconnecti...
详细信息
With the popularity of wireless networking and mobile devices, mobilecomputing has changed the way we live and work. The special characteristics of mobile environments,such as highly variable connectivity, disconnection, location-dependency and energy and resourcesensitivity and the diversity and flexibility introduced by mobile systems have new challenges forresearch in distributed systems. Mobile distributed computing represents a discipline of distributedsystems research and practice towards support for mobility. It is concerned with creating solutionsto enable the sharing of distributed resources/services and to facilitate remote collaborationswhile people work away from the fixed, wired facilities. This special issue is devoted todistributed algorithms, systems and applications for mobile computing environments. It contains fivepapers, selected from the program of the 3rdinternational Workshop on Mobile distributed Computing(MDC''05), in conjunction with IEEE internationalconference on distributed Computing Systems, June8-10, 2005, Columbus, Ohio, USA.
This paper describes an original programming environment based on the DOSMOS system. Its implementation is built on a structural approach of parallel programming. By combining this structural model with weak consisten...
详细信息
This paper describes an original programming environment based on the DOSMOS system. Its implementation is built on a structural approach of parallel programming. By combining this structural model with weak consistencies protocols, we improve the performances of DSM system and provide a programming model which mixes message-passing and virtually shared objects. Moreover by integrating a development platform consisting of processes mapping, shared objects management, pre-processing step and monitoring facilities, the DOSMOS system has been designed to provide a performant user-friendly programming environment.
This paper presents a quorum-based group k-mutual exclusion algorithm for open distributed computing systems that can evolve their behavior based on membership changes in the environment. The algorithm consists of two...
详细信息
ISBN:
(纸本)3540297693
This paper presents a quorum-based group k-mutual exclusion algorithm for open distributed computing systems that can evolve their behavior based on membership changes in the environment. The algorithm consists of two main layers;the quorum-consensus and quorum-reconfiguration. The quorum consensus layer is used to handle requests from and to the application layer, and it directly adopts a proposed kcoterie based algorithm of the group k-mutual exclusion in the static environments without any change to its protocol. Thus, the message complexity and quorum availability are the same as in the static environments. The quorum reconfiguration reconstructs information structure of the k-coterie by simply implementing the properties of two quorum input operations called coterie-join and coterie-cross. The reconfiguration layer is simple to use and has a great ability to complete any operation during reconfiguration powerfully thus system does not enter the halt state.
A central issue for parallelapplications executed on heterogeneous distributed platforms (e.g. Grids and Clouds) is assuring that performance and cost parameters are optimized throughout the execution. A solution is ...
详细信息
This paper aims at minimizing the makespan for a single batch-processing machine with non-identical job sizes (NSBM) using discrete particle swarm optimization algorithm (DPSO). PSO is a natural continuous function al...
详细信息
ISBN:
(纸本)9780769536422
This paper aims at minimizing the makespan for a single batch-processing machine with non-identical job sizes (NSBM) using discrete particle swarm optimization algorithm (DPSO). PSO is a natural continuous function algorithm and there is some obstacle to solve combinatorial optimization problems. Recently, some hybrid PSO or DPSO have been presented by researchers to solve discrete problems in practical applications but no application to NSBM problems hitherto. DIPSO is improved in some operators, adaptive factors and some other details in this paper. The computational simulation results and comparisons show that the DPSO algorithm is competitive for the NSBM problems.
暂无评论