User-friendly parallel computations with econometric examples

This paper shows how a high level matrix programming language may be used to perform Monte Carlo simulation, bootstrapping, estimation by maximum likelihood and GMM, and kernel regression in parallel on symmetric multiprocessor computers or clusters of workstations. The implementation of parallelization is done in a way such that an investigator may use the programs without any knowledge of parallel programming. A bootable CD that allows rapid creation of a cluster for parallel computing is introduced. Examples show that parallelization can lead to important reductions in computational time. Detailed discussion of how the Monte Carlo problem was parallelized is included as an example for learning to write parallel programs for Octave.

ParallelKnoppix - Rapid deployment of a linux cluster for MPI parallel processing using non-dedicated computers

This note describes ParallelKnoppix, a bootable CD that allows creation of a Linux cluster in very little time. An experienced user can create a cluster ready to execute MPI programs in less than 10 minutes. The computers used may be heterogeneous machines, of the IA-32 architecture. When the cluster is shut down, all machines except one are in their original state, and the last can be returned to its original state by deleting a directory. The system thus provides a means of using non-dedicated computers to create a cluster. An example session is documented.

Parallel spinors on pseudo-riemannian spin(q) manifolds

We study simply-connected irreducible non-locally symmetric pseudo-Riemannian Spin(q) manifolds admitting parallel quaternionic spinors.

Including the workload effect in the parallel program signature

Performance prediction and application behavior modeling have been the subject of exten- sive research that aim to estimate applications performance with an acceptable precision. A novel approach to predict the performance of parallel applications is based in the con- cept of Parallel Application Signatures that consists in extract an application most relevant parts (phases) and the number of times they repeat (weights). Executing these phases in a target machine and multiplying its exeuction time by its weight an estimation of the application total execution time can be made. One of the problems is that the performance of an application depends on the program workload. Every type of workload affects differently how an application performs in a given system and so affects the signature execution time. Since the workloads used in most scientific parallel applications have dimensions and data ranges well known and the behavior of these applications are mostly deterministic, a model of how the programs workload affect its performance can be obtained. We create a new methodology to model how a program’s workload affect the parallel application signature. Using regression analysis we are able to generalize each phase time execution and weight function to predict an application performance in a target system for any type of workload within predefined range. We validate our methodology using a synthetic program, benchmarks applications and well known real scientific applications.

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

PSyscal: disseny i implementació d'un sistema paral·lel per al calibratge automàtic de models P-Sistema

Es tracta d'un projecte que proposa una aplicació per al calibratge automàtic de models P-sistema. Per a fer-ho primer es farà un estudi sobre els models P-sistema i el procediment seguit pels investigadors per desenvolupar aquest tipus de models. Es desenvoluparà una primera solució sèrie per al problema, i s'analitzaran els seus punts febles. Seguidament es proposarà una versió paral·lela que millori significativament el temps d'execució, tot mantenint una alta eficiència i escalabilitat.

Optimum power allocation for parallel Gaussian channels with arbitrary input distributions

The mutual information of independent parallel Gaussian-noise channels is maximized, under an average power constraint, by independent Gaussian inputs whose power is allocated according to the waterfilling policy. In practice, discrete signalling constellations with limited peak-to-average ratios (m-PSK, m-QAM, etc) are used in lieu of the ideal Gaussian signals. This paper gives the power allocation policy that maximizes the mutual information over parallel channels with arbitrary input distributions. Such policy admits a graphical interpretation, referred to as mercury/waterfilling, which generalizes the waterfilling solution and allows retaining some of its intuition. The relationship between mutual information of Gaussian channels and nonlinear minimum mean-square error proves key to solving the power allocation problem.

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.

Three-dimensional aspects of fluid flows in channels. I. Meniscus and thin film regimes

We study the forced displacement of a fluid-fluid interface in a three-dimensional channel formed by two parallel solid plates. Using a lattice-Boltzmann method, we study situations in which a slip velocity arises from diffusion effects near the contact line. The difference between the slip and channel velocities determines whether the interface advances as a meniscus or a thin film of fluid is left adhered to the plates. We find that this effect is controlled by the capillary and Péclet numbers. We estimate the crossover from a meniscus to a thin film and find good agreement with numerical results. The penetration regime is examined in the steady state. We find that the occupation fraction of the advancing finger relative to the channel thickness is controlled by the capillary number and the viscosity contrast between the fluids. For high viscosity contrast, lattice-Boltzmann results agree with previous results. For zero viscosity contrast, we observe remarkably narrow fingers. The shape of the finger is found to be universal.

Three-dimensional aspects of fluid flows in channels. I. Meniscus and thin film regimes

We study the forced displacement of a fluid-fluid interface in a three-dimensional channel formed by two parallel solid plates. Using a lattice-Boltzmann method, we study situations in which a slip velocity arises from diffusion effects near the contact line. The difference between the slip and channel velocities determines whether the interface advances as a meniscus or a thin film of fluid is left adhered to the plates. We find that this effect is controlled by the capillary and Péclet numbers. We estimate the crossover from a meniscus to a thin film and find good agreement with numerical results. The penetration regime is examined in the steady state. We find that the occupation fraction of the advancing finger relative to the channel thickness is controlled by the capillary number and the viscosity contrast between the fluids. For high viscosity contrast, lattice-Boltzmann results agree with previous results. For zero viscosity contrast, we observe remarkably narrow fingers. The shape of the finger is found to be universal.

On the origin of the North Pacific arcs

We present a new hypothesis that relates global plate tectonics to the formation of marginal basins, island arcs, spreading ridges and arc-shaped mountain belts around the North Pacific Ocean. According to our model, the ellipsoidal-shaped Paleogene basins of the South China Sea, Parece-Vela Basin, Shikoku Basin, Sea of Japan and the Sea of Okhotsk in addition to those of the North American Cordillera can be attributed to the change in plate convergence direction at 42 Ma between the Indoaustralian and Eurasian plates. The new direction of convergence was parallel to the eastern continental margin of Asia and resulted in widespread extension perpendicular to this margin and to the western margin of North America. Both margins form part of a circle parallel to the Indoaustralian-Eurasian direction of convergence.

On the computation of reducible invariant tori on a parallel computer

We present an algorithm for the computation of reducible invariant tori of discrete dynamical systems that is suitable for tori of dimensions larger than 1. It is based on a quadratically convergent scheme that approximates, at the same time, the Fourier series of the torus, its Floquet transformation, and its Floquet matrix. The Floquet matrix describes the linearization of the dynamics around the torus and, hence, its linear stability. The algorithm presents a high degree of parallelism, and the computational effort grows linearly with the number of Fourier modes needed to represent the solution. For these reasons it is a very good option to compute quasi-periodic solutions with several basic frequencies. The paper includes some examples (flows) to show the efficiency of the method in a parallel computer. In these flows we compute invariant tori of dimensions up to 5, by taking suitable sections.

Bernoulli correction to viscous losses: Radial flow between two parallel discs

For a massless fluid (density = 0), the steady flow along a duct is governed exclusively by viscous losses. In this paper, we show that the velocity profile obtained in this limit can be used to calculate the pressure drop up to the first order in density. This method has been applied to the particular case of a duct, defined by two plane-parallel discs. For this case, the first-order approximation results in a simple analytical solution which has been favorably checked against numerical simulations. Finally, an experiment has been carried out with water flowing between the discs. The experimental results show good agreement with the approximate solution

A topical microemulsion for the prevention of allergic rhinitis symptoms: results of a randomized, controlled, double-blind, parallel group, multicentre, multinational clinical trial (Nares study)

Background: Since barrier protection measures to avoid contact with allergens are being increasingly developed, we assessed the clinical efficacy and tolerability of a topical nasal microemulsion made of glycerol esters in patients with allergic rhinitis. Methods: Randomized, controlled, double-blind, parallel group, multicentre, multinational clinical trial in which adult patients with allergic rhinitis or rhinoconjunctivitis due to sensitization to birch, grass or olive tree pollens received treatment with topical microemulsion or placebo during the pollen seasons. Efficacy variables included scores in the mini-RQLQ questionnaire, number and severity of nasal, ocular and lung signs and symptoms, need for symptomatic medications and patients" satisfaction with treatment. Adverse events were also recorded. Results: Demographic characteristics were homogeneous between groups and mini-RQLQ scores did not differ significantly at baseline (visit 1). From symptoms recorded in the diary cards, the ME group showed statistically significant better scores for nasal congestion (0.72 vs. 1.01; p = 0.017) and mean total nasal symptoms (0.7 vs. 0.9; p = 0.045). At visit 2 (pollen season), lower values were observed in the mini-RQLQ in the ME group, although there were no statistically significant differences between groups in both full analysis set (FAS) and patients completing treatment (PPS) populations. The results obtained in the nasal symptoms domain of the mini-RQLQ at visit 2 showed the highest difference (−0.43; 95% CI: -0.88 to 0.02) for the ME group in the FAS population. The topical microemulsion was safe and well tolerated and no major discomforts were observed. Satisfaction rating with the treatment was similar between the groups. Conclusions: The topical application of the microemulsion is a feasible and safe therapy in the prevention of allergic symptoms, particularly nasal congestion.