In this article we present the results obtained from the execution of a commercial Computational Fluid Dynamics program on a cluster of personal computers. the communication and data interchange between the nodes uses...
详细信息
ISBN:
(纸本)354041729X
In this article we present the results obtained from the execution of a commercial Computational Fluid Dynamics program on a cluster of personal computers. the communication and data interchange between the nodes uses a distributed Shared Memory (DSM) system called TreadMarks. the parallelized program was run on a 100Mbit/s Ethernet network connecting 4 personal computers. Using data similar to a real execution on a industrial environment, we achieved a maximum speedup of about 1.7 and measured an allmost constant communication time with various number of nodes. Comparing our DSM solution with a similar parallelization approach but using Message passing we observed that with less effort we can accomplish better performance with less communication if using a DSM system.
In the paper, we present first experimental results of a parallel implementation for a simulated annealing-based heuristic. the heuristic has been developed for job shop scheduling problems that consist of l jobs wher...
详细信息
ISBN:
(纸本)354041729X
In the paper, we present first experimental results of a parallel implementation for a simulated annealing-based heuristic. the heuristic has been developed for job shop scheduling problems that consist of l jobs where each job has to process exactly one task on each of the m machines. We utilize the disjunctive graph representation and the objective is to minimize the length of longest paths, i.e., the overall completion time of tasks. the heuristic has been implemented in a distributedcomputing environment. First computational experiments were performed on several benchmark problems using a cluster of 12 processors. We compare our computational experiments to sequential runs and show that stable results equal or close to optimum solutions are calculated by the parallel implementation.
Data Distribution Management (DDM) is a High Level Architecture/Run-time Infrastructure (HLA/RTI) service that manages the distribution of state updates and interaction information in large scale distributed simulatio...
详细信息
ISBN:
(纸本)0769513484
Data Distribution Management (DDM) is a High Level Architecture/Run-time Infrastructure (HLA/RTI) service that manages the distribution of state updates and interaction information in large scale distributed simulations, limits and controls the volume of data exchanged during the simulation. In this paper we focus upon the following three DDM schemes: Region-Based, Fixed and Dynamic Grid-Based techniques. In an effort to determine the most efficient model for applying the DDM service, we developed a mini-RTY Kit framework and propose a set of benchmarks to compare these DDM schemes. Using the RTI Kit, we performed extensive simulation experiments and present our analysis of the results of numerous federation executions.
the proceedings contain 46 papers. the special focus in this conference is on Speaker Information. the topics include: Challenges in modeling and computing;data grids for next generation problems in science and engine...
ISBN:
(纸本)354041729X
the proceedings contain 46 papers. the special focus in this conference is on Speaker Information. the topics include: Challenges in modeling and computing;data grids for next generation problems in science and engineering;the evolution of openMP;ocean and climate prediction on parallel super computers;linear algebra with recursive algorithms;solving CFD problems with open source parallel libraries;high-performance library software for QR factorization;parallel triangular sylvester-type matrix equation solvers for SMP systems using recursive blocking;on the efficiency of scheduling algorithms for parallel gaussian elimination with communication delays;high performance cholesky factorization via blocking and recursion that uses minimal storage;parallel two-stage reduction of a regular matrix pair to hessenberg-triangular form;a fast minimal storage symmetric indefinite solver;a scalable parallel assembly for irregular meshes based on a block distribution for a parallel block direct solver;a general purpose distributed memory sparse solver;runtime adaptation of an iterative linear system solution to distributed environments;a local refinement algorithm for data partitioning;feedback guided scheduling of nested loops;a comparison of partitioning schemes for blockwise parallel SAMR algorithms;parallelizing an adaptive dynamical grid generator in a climatological trace gas transport application;optimal parameter values for a parallel structured adaptive mesh refinement algorithm;partition of unstructured finite element meshes by a multilevel approach;an internet based search for k-optimal lattice rules and parallel and distributed document overlap detection on the web.
Group-based computing is becoming more and more popular when one has to design a middleware able to support reliable distributed applications. this paradigm is made of two basic services, namely, a group membership se...
详细信息
ISBN:
(纸本)0769510655
Group-based computing is becoming more and more popular when one has to design a middleware able to support reliable distributed applications. this paradigm is made of two basic services, namely, a group membership service and a group communication service. More generally: a group is a set of processes cooperating to carry out a common task (e.g., copies of a replicated server participants in a transaction or users in a CSCW-based application). Due to the desire of new processes to join the group, to the desire of a group member to leave it, or to process crashes, the composition of a group can evolve dynamically: the set of processes that currently implements the group is called the current view of the group. this paper addresses the specification and the implementation of a primary component group membership set-vice. "Primary component" means that the specification imposes to have a single view at any the. the paper first proposes a specification for the problem. then it presents a protocol that implements that specification in asynchronous distributed systems equipped with failure detectors. this primary component group membership protocol is obtained as an appropriate instantiation of a general agreement framework.
the contributions of this paper are twofold. First, a general method to support fault tolerance for token-based synchronization protocols in distributed systems is introduced. Contrary to traditional approaches, this ...
详细信息
One of the hallmarks of current science experiments is the large volume of data that must be managed. For example, next gene- ration particle physics experiments will generate petabytes of data per year. these data se...
详细信息
the proceedings contain 14 papers. the topics discussed include: next generation real-time RTI software;hla real-time extension;a performance measurement approach for the selectively reliable multicast protocol for di...
ISBN:
(纸本)0769510531
the proceedings contain 14 papers. the topics discussed include: next generation real-time RTI software;hla real-time extension;a performance measurement approach for the selectively reliable multicast protocol for distributed simulation;the grandest challenge in distributed simulation;impostors-based real-time avatar behavior in virtual reality systems;adaptive attitude dead-reckoning by cumulative polynomial extrapolation of quaternions;field experience withthe use of distributed interactive simulation for weapons and doctrine development;COTS middleware for real-time distributed interactive simulations - fact or fiction?;performance comparison of data distribution management strategies;aggregation/disaggregation in HLA multi-resolution distributed simulation;and self-federating an aviation simulation using HLA: is it feasible.
the modern tasks of processing and analysis of large scale arrays of graphics information demand real-time operation and considerable computational resources. the ideology of developing such systems does not fit the i...
详细信息
Our proposal has the following key features: 1) the separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). this yields flexible programs capable of handl...
详细信息
ISBN:
(纸本)354041729X
Our proposal has the following key features: 1) the separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). this yields flexible programs capable of handling different kinds of data/program distribution with no change to the pure algorithm. 2) Implicit or automatic handling of communication via externally mapped variables and generalizations of assignment and reference to these variables. this provides unified device independent view and processing of internal data and external distributed data at the user programming language level. 3) Programs need only know of the direct binds withdistributed correspondents (mailbox driver, file manager, remote task, window manager etc.). this avoids the need for a central description of all the interconnections. the main short-range benefits of this proposal are to facilitate parallel computations. parallel programming is a fundamental challenge in computer science, nowadays. Improving these techniques will lead to simplify the programming, eliminate the communication statements, and unify the various communication by using an implicit method for the transfer of data which is becoming essential withthe proliferation of distributed networked environment. We present 2 experiments of separation between PurAl and DUAL, using a preprocessor or an object-type library. this new approach might be of interest to both academic and industrial researchers.
暂无评论