Optimization of water distribution is a crucial issue which has been targeted by many modelling tools. Useful models, implemented several decades ago, need to be updated and implemented in more powerful computing envi...
详细信息
ISBN:
(纸本)0953914089
Optimization of water distribution is a crucial issue which has been targeted by many modelling tools. Useful models, implemented several decades ago, need to be updated and implemented in more powerful computing environments. this paper presents the redesign of a legacy hydraulic simulation software written in Fortran (IRMA) that has been used for over 30 years by the Société du Canal de Provence in order to design and to maintain water distribution networks. IRMA was developed aiming mainly the treatment of irrigation networks - by using the Clément demand model and is now used to manage more than 6.000 km of piped networks. the growing complexity and size of networks requested to update IRMA and to rewrite the code by using modern tools and language (Java). the paper presents an overview of IRMA's simulation model, including its head loss equations, equipments modeling and the linear system construction. the description of the new adopted solution is compared with available Java solvers. Some new specific simulation features are presented: scenarios with probabilistic demands (Débit de Clément), pump profiling and pressure driven analysis. the validation of results is achieved with a comparison between the previous Fortran results and the values obtained using the new solver and a comparison with results obtained from a standard and well-known simulation tool (EPANET). Finally, a benchmark of the new Java version and of the former Fortran version is presented. the new version demonstrates clearly its efficiency with a significant reduction of the computation time and an improved quality of results. In addition, the new version offers the possibility of deploying distributed simulations on a computational Grid.
We have been developing a system to support the management of collections of web-based resources called the distributed Collection Manager (DCM). As work on DCM has progressed, questions about the characteristics of p...
详细信息
this paper deals withthe numerical solution of financial applications, more specifically the computation of American and European options derivatives modeled by boundary value problems. In such applications we have t...
详细信息
ISBN:
(纸本)9783642218866;9783642218873
this paper deals withthe numerical solution of financial applications, more specifically the computation of American and European options derivatives modeled by boundary value problems. In such applications we have to solve large-scale algebraic linear systems. We concentrate on synchronous and asynchronous parallel iterative algorithms carried out on Grid'5000, by using an experimental peer-to-peer platform. the properties of the operators arising in the discretized problem ensure the convergence of the parallel iterative synchronous and asynchronous algorithms. Different detection convergence algorithms are tested for asynchronous iterations. Computational experiments performed on distributed architectures are presented and analyzed.
In the present study we consider the parallel simulation on a peer-to-peer demonstrator for the computation of a 3D differential equations, which model the behavior of the continuous-flow electrophoresis problem. the ...
详细信息
ISBN:
(纸本)9783642218866;9783642218873
In the present study we consider the parallel simulation on a peer-to-peer demonstrator for the computation of a 3D differential equations, which model the behavior of the continuous-flow electrophoresis problem. the physical model considered is constituted by the Navier-Stokes equation coupled with a convection-diffusion equation and a Laplacian equation. By using appropriate discretization of the coupled boundary value problems, we can prove the convergence of synchronous and more generally asynchronous relaxation methods. Finally parallel experiments on the peer-to-peer demonstrator are presented and analyzed.
In this paper we investigate the time delay propagation rates in a Vehicular Ad-Hoc Network, where vehicular connectivity is supported by both Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) protocols. In...
详细信息
Many private BitTorrent communities employ Sharing Ratio Enforcement (SRE) schemes to incentivize users to contribute their upload resources. It has been demonstrated that communities that use SRE are greatly oversupp...
详细信息
ISBN:
(纸本)9781457701498
Many private BitTorrent communities employ Sharing Ratio Enforcement (SRE) schemes to incentivize users to contribute their upload resources. It has been demonstrated that communities that use SRE are greatly oversupplied, i.e., they have much higher seeder-to-leecher ratios than communities in which SRE is not employed. the first order effect of oversupply under SRE is a positive increase in the average downloading speed. However, users are forced to seed for extremely long times to maintain adequate sharing ratios to be able to start new downloads. In this paper, we propose a fluid model to study the effects of oversupply under SRE, which predicts the average downloading speed, the average seeding time, and the average upload capacity utilization for users in communities that employ SRE. We notice that the phenomenon of oversupply has two undesired negative effects: a) Peers are forced to seed for long times, even though their seeding efforts are often not very productive (in terms of low upload capacity utilization);and b) SRE discriminates against peers with low bandwidth capacities and forces them to seed for longer durations than peers with high capacities. To alleviate these problems, we propose four different strategies for SRE, which have been inspired by ideas in social sciences and economics. We evaluate these strategies through simulations. Our results indicate that these new strategies release users from needlessly long seeding durations, while also being fair towards peers with low capacities and maintaining high system-wide downloading speeds.
In this paper, we present slot selection algorithms for job batch scheduling in distributedcomputing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing appro...
详细信息
ISBN:
(纸本)9783642231773
In this paper, we present slot selection algorithms for job batch scheduling in distributedcomputing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing approaches towards resource co-allocation and job scheduling in economic models of distributedcomputing are based on search of time-slots in resource occupancy schedules. A launch of a parallel job requires a co-allocation of a specified number of slots. the sought time-slots must match requirements of necessary span, computational resource properties, and cost. Usually such scheduling methods consider only one suited variant of time-slot set. this paper discloses a scheduling scheme that features multi-variant search. Two algorithms of linear complexity for search of alternative variants are proposed. Having several optional resource configurations for each job makes an opportunity to perform an optimization of execution of the whole batch of jobs and to increase overall efficiency of scheduling.
the proceedings contain 13 papers. the topics discussed include: evaluating interconnect and virtualization performance for high performance computing;predictive modeling and analysis of OP2 on distributed memory GPU ...
ISBN:
(纸本)9781450311021
the proceedings contain 13 papers. the topics discussed include: evaluating interconnect and virtualization performance for high performance computing;predictive modeling and analysis of OP2 on distributed memory GPU clusters;optimizing matrix transposes using a POWER7 cache model and explicit prefetching;towards autotuning by alternating communication methods;execution-less performance modeling;a preliminary evaluation of the hardware acceleration of the Cray Gemini interconnect for PGAs languages and comparison with MPI;auto-generation of communication benchmark traces;a method for automatically generating analogue benchmark suites using micro architectural event counters;critical path-based thread placement for NUMA systems;benchmarking and modeling disk-based storage tiers for practical storage design;and memory access cycle and the measurement of memory systems.
this paper presents an online web-based culturally relevant algebra tutor. It is designed for African American students to improve their mathematical skills. As a critical part of a culturally relevant tutor framework...
详细信息
In Smart Home, understanding the environment and what is going on is the basis of all adapted services. Unfortunately, inferring situations and activity recognition directly from raw data is way too complex to be appl...
详细信息
暂无评论