this paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ignores quality assurance issue. Quality...
详细信息
ISBN:
(纸本)9781424403431
this paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ignores quality assurance issue. Quality assurance is very important, especially in heterogeneous environments. We propose a new heuristic algorithm that determines the positions of replicas in order to satisfy the quality requirements imposed by data requests. the experimental results indicate that the proposed algorithm finds a near-optimal solution effectively and efficiently for algorithm can also adapt to various parallel and distributed environments.
this paper presents a distributed hardware/software cosimulation environment for heterogeneous systems prototyping applied to an industrial application. the environment provides following features: distributed Hw/Sw c...
详细信息
this paper presents a distributed hardware/software cosimulation environment for heterogeneous systems prototyping applied to an industrial application. the environment provides following features: distributed Hw/Sw cosimulation, automatic Hw/Sw interface generation, Hw elements can be described at different levels of abstraction and generic/specific Sw debuggers can be used. Starting from a brief description of the interface of the interconnected modules the tool automatically produces the link between Hw and Sw parts. In addition, the environment is very easy to use, even for complex systems that may include several Sw (C) modules and several Hw (VHDL) modules running in parallel. Applied to a large industrial multi-processor system, this method appeared reliable and efficient, providing important benefits in hardware-software codesign: better design environment and reduced time to validate.
Popular network simulation tools, such as ns-2, are useful for undertaking experiments with emerging networking technologies. As net-worked applications become distributed at scales comparable to the Internet, such as...
详细信息
ISBN:
(纸本)1424400007
Popular network simulation tools, such as ns-2, are useful for undertaking experiments with emerging networking technologies. As net-worked applications become distributed at scales comparable to the Internet, such as peer-to-peer applications, testing and experimentation becomes increasingly difficult and important Withthis paper, we are introducing an elaborate extension to existing simulation capabilities by allowing realistic highly distributed application prototypes to be attached to a simulator for transparent testing and experimentation. We enable developers to focus on building their applications rather than detailing simulation scripts. Testing can then be performed in a natural setting. PDNS is a parallel and distributed version of the commonly used ns-2 simulation package. We describe our extensions to the PDNS simulator which allow real application prototypes to be run across a simulated network. We describe our use of virtualisation as a means for sending an application's network traffic through the simulator. Our implementation allows for large scale simulations withthousands of real peers and hundereds of thousands of simulated nodes in a network, thus we can test real peer-to-peer software at large scales.
We present a basis for the formal specification and stepwise development of distributed systems, i.e. programs which are intended (at least conceptually) to run on distributed-memory parallel machines which communicat...
详细信息
Discrete event simulation is widely used within the networking community for purposes such as demonstrating the validity of network protocols and architectures. Depending on the level of detail modeled within the simu...
详细信息
Discrete event simulation is widely used within the networking community for purposes such as demonstrating the validity of network protocols and architectures. Depending on the level of detail modeled within the simulation, the running time and memory requirements can be excessive. the goal of our research is to develop and demonstrate a practical, scalable approach to parallel and distributedsimulationthat will enable widespread reuse of sequential network simulation models and software. We focus on an approach to parallelization where an existing network simulator is used to build models of subnetworks that are composed to create simulations of larger networks. Changes to the original simulator are minimized, enabling the parallel simulator to easily track enhancements to the sequential version. In this paper we describe our lessons learned in applying this approach to the publicly available ns software package, and converting it to run in a parallel fashion on a network of workstations. this activity highlights a number of important problems, from the standpoint of how to parallelize an existing serial simulation model and achieving acceptable parallel performance.
distributed computing systems making available large memories and powerful computational resources, allow the analysis of problems of unprecedented complexity. the exploitation of the potential offered by these system...
详细信息
ISBN:
(纸本)081867931X
distributed computing systems making available large memories and powerful computational resources, allow the analysis of problems of unprecedented complexity. the exploitation of the potential offered by these systems highly depends upon the availability of efficient tools devoted to the solution of specific problems. the paper describes a distributed approach to the analysis of large GSPN models whose applicability to real systems was often constrained by the explosion in the size of the underlying state space representation. A performing algorithm for distributed construction of large state space graphs generated by GSPN models is described in detail the subsequent distributed numerical solution of the Markov chain is then presented and discussed, along with its current limitations. the implementation of the complete distributed solution tool is integrated withthe well known GreatSPN package. the use of the widespread MPI Message Passing library makes the tool portable on a large class of distributed and parallel architectures. Performance results in the case of nets with large state space cardinalities are discussed, considering an experimental low-cost, general purpose PC cluster.
In this study, we propose a unified framework for designing a class of server-centric network topologies for DML by adopting top-down design method and combinatorial design theory. simulation results show that this fl...
详细信息
ISBN:
(纸本)9798400707827
In this study, we propose a unified framework for designing a class of server-centric network topologies for DML by adopting top-down design method and combinatorial design theory. simulation results show that this flexible framework is capable of effectively supporting various DML tasks. Our framework can generate compatible topologies that meet various resource constraints and different DML tasks.
the proceedings contain 7 papers. the topics discussed include: productive and performant generic lossy data compression with LibPressio;mitigating catastrophic forgetting in deep learning in a streaming setting using...
ISBN:
(纸本)9781728186726
the proceedings contain 7 papers. the topics discussed include: productive and performant generic lossy data compression with LibPressio;mitigating catastrophic forgetting in deep learning in a streaming setting using historical summary;PyParSVD: a streaming, distributed and randomized singular-value-decomposition library;unbalanced parallel I/O: an often-neglected side effect of lossy scientific data compression;TributaryPCA: distributed, streaming PCA for in situ dimension reduction with application to space weather simulations;understanding effectiveness of multi-error-bounded lossy compression for preserving ranges of interest in scientific analysis;and exploring lossy compressibility through statistical correlations of scientific datasets.
the GRISSLi coupling interface is a runtime library designed for the coupled computation of grid-based multidisciplinary applications. Established simulation programs, which are deleted to a single discipline, can be ...
详细信息
ISBN:
(纸本)0769500595
the GRISSLi coupling interface is a runtime library designed for the coupled computation of grid-based multidisciplinary applications. Established simulation programs, which are deleted to a single discipline, can be interconnected to a complex simulation system via the GRISSLi coupling interface without recoding the participating programs. We introduce a data model to establish the links between the (dynamic) grids and the attached coupling values in a single application program and to establish the mappings between grids and coupling values among different application programs. the user-specified consistency model is realized ruing asynchronous communication based on the MPI message passing standard Efficient communication is achieved by pre-computing an optimized communication schedule and overlapping communication with computation. Flexible coupling algorithms with adaptive grids and branches are supported in GRISSLi. We have developed a prototype implementation, which provides language bindings in ANSI C and Fortran, and runs currently on IBM RS/6000 SP Gray T3E, SGI Origin/Octane and HP-V Class. We verify the functionality and evaluate the performance of our library rising an industry relevant pilot application, the steel strip production process.
In Time Warp parallelsimulation, the state of each process must be saved (checkpointed) regularly in case a rollback is necessary. Although most existing Time Warp implementations checkpoint after every state transit...
详细信息
ISBN:
(纸本)1565550552
In Time Warp parallelsimulation, the state of each process must be saved (checkpointed) regularly in case a rollback is necessary. Although most existing Time Warp implementations checkpoint after every state transition, this is not necessary, and the checkpoint interval is in reality a tuning parameter of the simulation. Lin and Lazowska proposed a model to derive the optimal checkpoint interval by assuming that the rollback behavior of Time Warp is not affected by the frequency of checkpointing. An experimental study conducted by Preiss et al. indicates that the behavior of rollback is affected by the frequency of checkpointing in general, and that the Lin-Lazowska model may not reflect the real situations in general. this paper extends the Lin-Lazowska model to include the effect of the checkpoint interval on the rollback behavior. the relationship among the checkpoint interval, the rollback behavior, and the overhead associated with state saving and restoration is described. A checkpoint interval selection algorithm which quickly determines the optimal checkpoint interval during the execution of Time Warp simulation is proposed. Empirical results indicate that the algorithm converges quickly and always selects the optimal checkpoint interval.
暂无评论