Numerical modeling of 3D thermomechanical problems is a complex and time-consuming issue. Adaptive techniques are powerful tools to perform efficiently such modeling using the FEM analysis. During the adaptation compu...
详细信息
ISBN:
(纸本)9783642143892
Numerical modeling of 3D thermomechanical problems is a complex and time-consuming issue. Adaptive techniques are powerful tools to perform efficiently such modeling using the FEM analysis. During the adaptation computational workloads change unpredictably at the runtime, therefore dynamic load balancing is required. This paper presents new developments in the parallel FIFA package NuscaS;they allow for extending its functionality and increasing performance. In particular, by including dynamic load balancing capabilities, this package allows us to solve efficiently adaptive FEM problems with 3D unstructured meshes on distributed-memory parallel computers such as PC-clusters. For solving sparse systems of equations, NuscaS uses the message-passing paradigm to implement the PCG iterative method with geometric multigrid as a preconditioner. The implementation of load balancing is based on the proposed performance model.
This paper addresses the issue of fault tolerance in parallel computing, and proposes a new method named parallel recomputing. Such method achieves fault recovery automatically by using surviving processes to recomput...
详细信息
In this paper, we discuss a flexible flow shop scheduling problem with batch processing machines at each stage and with jobs that have unequal ready times. Scheduling problems of this type can be found in semiconducto...
详细信息
In this paper, we discuss a flexible flow shop scheduling problem with batch processing machines at each stage and with jobs that have unequal ready times. Scheduling problems of this type can be found in semiconductor wafer fabrication facilities (wafer fabs). We are interested in minimizing the total weighted tardiness of the jobs. We present a mixed integer programming formulation. The batch scheduling problem is NP-hard. Therefore, an iterative stage-based decomposition approach is proposed that is hybridized with neighborhood search techniques. The decomposition scheme provides internal due dates and ready times for the jobs on the first and second stage, respectively. Each of the resulting parallel machine batch scheduling problems is solved by variable neighborhood search in each iteration. Based on the schedules of the subproblems, the internal due dates and ready times are updated. We present the results of designed computational experiments that also consider the number of machines assigned to each stage as a design factor. It turns out that the proposed hybrid approach outperforms an iterative decomposition scheme where a fairly simple heuristic based on time window decomposition and the apparent tardiness cost dispatching rule is used to solve the subproblems. Recommendations for the design of the two stages with respect to the number of parallel machines on each stage are given.
In this work we tackle the problem of on-line backup with a peer-to-peer approach. In contrast to current peer-to-peer architectures that build upon distributed hash-tables;we investigate whether an uncoordinated appr...
详细信息
ISBN:
(纸本)9783642038686
In this work we tackle the problem of on-line backup with a peer-to-peer approach. In contrast to current peer-to-peer architectures that build upon distributed hash-tables;we investigate whether an uncoordinated approach to data placement would prove effective in providing embedded incentives for users to offer local resources to the system. By modeling peers as selfish entities striving for minimizing their cost;in participating to the system, we analyze equilibrium topologies that materialize from the process of peer selection, whereby peers establish bi-lateral links that involve storing data in a symmetric wary. System stratification, that is the emergence of clusters gathering peers with similar contribution efforts, is an essential outcome of the peer selection process: peers are hired to improve the "quality" of local resources they provide to access clusters with lower operational costs. Our results are corroborated by a numerical evaluation of the system that builds upon a polynomial-time best-response algorithm to the selfish neighbor selection game.
To develop all efficient parallel application is not an easy task. applications rarely achieve a good performance immediately therefore, a careful performance analysis and optimization are crucial. These tasks are dif...
详细信息
ISBN:
(纸本)9783540854500
To develop all efficient parallel application is not an easy task. applications rarely achieve a good performance immediately therefore, a careful performance analysis and optimization are crucial. These tasks are difficult and require a thorough understanding of the program's behavior. In this paper, we propose an on-line performance modeling technique, which enables the automated discovery of causal execution flows, composed of communication and computational activities, in MPI parallel programs. Our model reflects an application behavior and is made up of elements correlated with high-level program structures, such as loops and communication operations. Moreover, our approach enables an assortment of on-fine diagnosis techniques which may further automate the performance understanding process.
The proceedings contain 129 papers. The topics discussed include: coding for two-user MIMO cooperative systems using matrix-Alamouti techniques;the adaptive RBFNN equalizer for nonlinear time-varying UMTS channel;cent...
ISBN:
(纸本)9781424438341
The proceedings contain 129 papers. The topics discussed include: coding for two-user MIMO cooperative systems using matrix-Alamouti techniques;the adaptive RBFNN equalizer for nonlinear time-varying UMTS channel;centralized and distributed LTE uplink scheduling in a distributed base station scenario;parameter exploration in parallel for dynamic vehicular network efficiency;neuro-control of an inverted pendulum using genetic algorithm;design and development of a hybrid feedback control system for an RF remote-controlled robot;non linear global dynamic analysis of reinforced slopes stability under seismic loading;application of reliability analysis on seismic slope stability;concrete compressive strength obtained on uncontrolled construction sites in Lebanon;analysis of an isotropic plate containing three identical circular holes arranged in a triangular configuration;and robust proposal distribution for adaptive visual tracking in a particle filtering frame work.
Current parallel architectures take advantage of new hardware evolution, like the use of multicore machines in clusters and grids. The availability of such resources may also be dynamic. Therefore, some kind of adapta...
详细信息
ISBN:
(纸本)9783642113215
Current parallel architectures take advantage of new hardware evolution, like the use of multicore machines in clusters and grids. The availability of such resources may also be dynamic. Therefore, some kind of adaptation is required by the applications and the resource manager to perform a good resource utilization. Malleable applications can provide a certain flexibility, adapting themselves on-the-fly, according to variations in the amount of available resources. However, to enable the execution of this kind of applications, some support from the resource manager is required, thus introducing important complexities like special allocation and scheduling policies. Under this context, we investigate some techniques to provide malleable behavior on M PI applications and the impact of this support upon a resource manager. Our study deals with two approaches to obtain malleability: dynamic CPUSETs mapping and dynamic MPI, using the OAR resource manager. The validation experiments were conducted upon Grid5000 platform. The testbed associates the charge of real workload traces and the execution of MPI benchmarks. Our results show that a dynamic approach using malleable jobs can lead to almost 25% of improvement in the resources utilization, when compared to a non-dynamic approach. Furthermore, the complexity of the malleability support, for the resource manager, seems to be overlapped by the improvement reached.
This two-volume set LNCS 9573 and LNCS 9574 constitutes the refereed proceedings of the 11th internationalconference of parallelprocessing and Applied Mathematics, PPAM 2015, held in Krakow, Poland, in September 201...
详细信息
ISBN:
(数字)9783319321493
ISBN:
(纸本)9783319321486
This two-volume set LNCS 9573 and LNCS 9574 constitutes the refereed proceedings of the 11th internationalconference of parallelprocessing and Applied Mathematics, PPAM 2015, held in Krakow, Poland, in September 2015.;The 111 revised full papers presented in both volumes were carefully reviewed and selected from 196 submissions. The focus of PPAM 2015 was on models, algorithms, and software tools which facilitate efficient and convenient utilization of modern parallel and distributed computing architectures, as well as on large-scale applications, including big data problems.
With the rapid development of Internet of Things (IoT), enormous events are produced everyday. Complex Event processing (CEP) is the key part of the IoT middleware. Since current hardware and wireless communication te...
详细信息
Efficient loop scheduling on parallel and distributed systems depends mostly on load balancing, especially on heterogeneous PC-based cluster and grid computing environments, In this paper, a general approach, named Pe...
详细信息
暂无评论