the simulation of many-body, many-particle system has a wide range of applications in areas such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the si...
详细信息
the simulation of many-body, many-particle system has a wide range of applications in areas such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. this is mainly due to the fact that the total number of interactions in the force is O(N2) where N is the number of particles in the system. the fast multipole algorithm, proposed by Greengard and Rokhlin, reduces the time complexity to O(N). In this paper, we design an efficient parallel fast multipole algorithm in three dimensions. For portability, our parallel program is implemented using Message Passing Interface. Is it possible to obtain high performance for a computing intensive application out of a LAN of workstations? In this paper, we also attempted to answer this commonly asked question by those researchers who have no access to parallel computers or supercomputers.
this paper presents the pedagogical and technical challenges the authors faced in developing a distributed laboratory for the-execution of virtual scientific experiments (VSEs) superimposed on a Grid infrastructure, f...
详细信息
this paper presents the pedagogical and technical challenges the authors faced in developing a distributed laboratory for the-execution of virtual scientific experiments (VSEs) superimposed on a Grid infrastructure, for a course on sensor networks that is part of the Master's in Information Networking (MSIN) program jointly offered by Carnegie Mellon University (CMU), USA and Athens Information Technology (AIT), Athens, Greece. the MSIN program utilizes virtual classroom technologies because of its strong distance learning component. Courses taught by CMU faculty are attended in real-time by students in Athens, Greece, via video-wall teleconferencing sessions. Vice versa, visiting CMU faculty to AIT teach classes that are attended by students at CMU. Students in both institutions enjoy full interactivity withtheir classmates on the other side of the Atlantic Ocean. A distributed shared virtual laboratory is needed for, many of the more empirical courses. this paper describes the challenges and issues the authors faced in developing such a lab.
there has been significant effort to build high throughput computing systems out of many distributed multimedia servers. these systems should accommodate a larger number of servers and should handle the ever-growing u...
详细信息
ISBN:
(纸本)9783540747666
there has been significant effort to build high throughput computing systems out of many distributed multimedia servers. these systems should accommodate a larger number of servers and should handle the ever-growing user demands. Recently, Grid computing has become one of the promising technologies that can deliver such a system. Among the many problems encountered in building Grid computing systems, resource discovery, overhead reduction, workload balancing and fault tolerance are the most challenging. In this paper, we present a resource discovery and allocation mechanism (RDAM) in a computational Grid system.
GRID technology is able to connect an unlimited number of computer systems and to distribute the tasks among all the connected nodes. In this paper we present the extension of IFIN-HH ATLAS-GRID facilities with ITIM C...
详细信息
An algorithm is proposed for locating and computing in parallel and with certainty all the simple roots of any twice continuously differentiable function in any specific interval. To compute with certainty all the roo...
详细信息
An algorithm is proposed for locating and computing in parallel and with certainty all the simple roots of any twice continuously differentiable function in any specific interval. To compute with certainty all the roots, the proposed method is heavily based on the knowledge of the total number of roots within the given interval. To obtain this information we use results from topological degree theory and, in particular, the Kronecker-Picard approach. this theory gives a formula for the computation of the total number of roots of a system of equations within a given region, which can be computed in parallel, Withthis tool in hand, we construct a parallel procedure for the localization and isolation of all the roots by dividing the given region successively and applying the above formula to these subregions until the final domains contain at the most one root. the subregions with no roots are discarded, while for the rest a modification of the well-known bisection method is employed for the computation of the contained root. the new aspect of the present contribution is that the computation of the total number of zeros using the Kronecker-Picard integral as well as the localization and computation of all the roots is performed in parallel using the parallel virtual machine (PVM). PVM is an integrated set of software tools and libraries that emulates a general-purpose, flexible, heterogeneous concurrent computing framework on interconnected computers of varied architectures. the proposed algorithm has large granularity and low synchronization, and is robust. It has been implemented and tested and our experience is that it can massively compute with certainty all the roots in a certain interval. Performance information from massive computations related to a recently proposed conjecture due to Elbert (this issue, J. Comput. Appl. Math. 133 (2001) 65-83) is reported. (C) 2001 Elsevier Science B.V. All rights reserved.
this paper presents MojaveFS, a distributed file system with support for sequential consistency. It provides location transparency and makes use of replication for reliability and fault tolerance. We employ a hybrid h...
详细信息
the computing velocity and memory storage of Single PC are often limited in large-scale electromagnetic simulation by finite element method (FEM), parallel processing is an important means to overcome such problems. T...
详细信息
ISBN:
(纸本)9781467371063
the computing velocity and memory storage of Single PC are often limited in large-scale electromagnetic simulation by finite element method (FEM), parallel processing is an important means to overcome such problems. the domain decomposition method (DDM) which decomposes the domain by nodes dominating and suits for parallelcomputing was illustrated first in this paper;A 2D electrostatic model was built and decomposed by the DDM;And the FEM linear system of equations was solved by using parallel CG method on the distributedparallel system composed of 6 PCs, the effective speed up reaching 97.5% was satisfying. Especially for large-scale simulation which consists of more than millions of freedoms, the parallel processing reduces computing time and increases the computing velocity greatly, it's the base on which large-scale 3D electromagnetic parallelcomputing.
this paper describes a parallel implementation of a Lanczos-based method to solve generalised eigenvalue problems related to the modal computation of arbitrarily shaped waveguides. this efficient implementation is int...
详细信息
An efficient adaptive approach for parallel and distributed Simulation (PADS) is formalized and implemented. the Aggressive Adaptive-Risk (AAR) approach aims at reducing cascading rollbacks in large and complex simula...
详细信息
An efficient adaptive approach for parallel and distributed Simulation (PADS) is formalized and implemented. the Aggressive Adaptive-Risk (AAR) approach aims at reducing cascading rollbacks in large and complex simulations by clustering optimistic logical processes on each processor, and providing these processes the ability to adjust their degree of risk, at run time, to a good operating point based on observed behavior. the AAR approach is used to develop the Clustered Adaptive distributed Simulator (CADS) which is implemented on a network of workstations. Details of the CADS implementation are described. Performance results for large synthetic loads are reported and compared to those obtained for the Time Warp optimistic technique.
Multi-access Edge computing (MEC) is a central piece of 5G telecommunication systems and is essential to satisfy the challenging low-latency demands of future applications. MEC provides a cloud computing platform at t...
详细信息
ISBN:
(纸本)9798350311990
Multi-access Edge computing (MEC) is a central piece of 5G telecommunication systems and is essential to satisfy the challenging low-latency demands of future applications. MEC provides a cloud computing platform at the edge of the radio access network. Our previous publications argue that edge computing should be transparent to clients, leveraging Software-Defined Networking (SDN). While we introduced a solution to implement such a transparent approach, one question remained: How to handle user requests to a service that is not yet running in a nearby edge cluster? One advantage of the transparent edge is that one could process the initial request in the cloud. However, this paper argues that on-demand deployment might be fast enough for many services, even for the first request. We present an SDN controller that automatically deploys an application container in a nearby edge cluster if no instance is running yet. In the meantime, the user's request is forwarded to another (nearby) edge cluster or kept waiting to be forwarded immediately to the newly instantiated instance. Our performance evaluations on a real edge/fog testbed show that the waiting time for the initial request - e.g., for an nginx-based service - can be as low as 0.5 seconds - satisfactory for many applications.
暂无评论