Contention-Free Complete Exchange Algorithms on Clusters

To construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switches with uplinks to achieve scaled bisectional bandwidth. This type of interconnection usually results in link contention and has congestion developed at the uplink ports. Moreover, the non-detenninistic delays on scheduling communication events in clusters accelerate the building up of congestion amongst these uplink ports, which lead to severe packets drop and hinder the overall performance. In this paper, we focus on the practical design of high-speed complete exchange algorithm on a commodity cluster interconnected by a hierarchical Ethemet-based network. By exploiting some architectural characteristics of the interconnection in optimizing the performunce of a complete exchange algorithm, we introduce a congestion control mechanism - global windowing that monitors and regulates the trafic load, together with a permutation scheme - reorder scheme that effectively alleviates the congestion problem. We evaluate our algorithm and compare its performance with other algorithms in a PC cluster connected by various types of switches, including Gigabit Ethernet, input-buffered and shared-memory Fast Ethernet switches.published_or_final_versio

Distributed N-body Simulation on the Grid Using Dedicated Hardware

We present performance measurements of direct gravitational N -body simulation on the grid, with and without specialized (GRAPE-6) hardware. Our inter-continental virtual organization consists of three sites, one in Tokyo, one in Philadelphia and one in Amsterdam. We run simulations with up to 196608 particles for a variety of topologies. In many cases, high performance simulations over the entire planet are dominated by network bandwidth rather than latency. With this global grid of GRAPEs our calculation time remains dominated by communication over the entire range of N, which was limited due to the use of three sites. Increasing the number of particles will result in a more efficient execution. Based on these timings we construct and calibrate a model to predict the performance of our simulation on any grid infrastructure with or without GRAPE. We apply this model to predict the simulation performance on the Netherlands DAS-3 wide area computer. Equipping the DAS-3 with GRAPE-6Af hardware would achieve break-even between calculation and communication at a few million particles, resulting in a compute time of just over ten hours for 1 N -body time unit. Key words: high-performance computing, grid, N-body simulation, performance modellingComment: (in press) New Astronomy, 24 pages, 5 figure

Efficient resources assignment schemes for clustered multithreaded processors

New feature sizes provide larger number of transistors per chip that architects could use in order to further exploit instruction level parallelism. However, these technologies bring also new challenges that complicate conventional monolithic processor designs. On the one hand, exploiting instruction level parallelism is leading us to diminishing returns and therefore exploiting other sources of parallelism like thread level parallelism is needed in order to keep raising performance with a reasonable hardware complexity. On the other hand, clustering architectures have been widely studied in order to reduce the inherent complexity of current monolithic processors. This paper studies the synergies and trade-offs between two concepts, clustering and simultaneous multithreading (SMT), in order to understand the reasons why conventional SMT resource assignment schemes are not so effective in clustered processors. These trade-offs are used to propose a novel resource assignment scheme that gets and average speed up of 17.6% versus Icount improving fairness in 24%.Peer ReviewedPostprint (published version

Parenting Practices, Life Satisfaction, and the Role of Self-Esteem in Adolescents

Introduction: Studies have shown significant associations between parenting practices, life satisfaction, and self-esteem, and the role of parenting practices in adolescent adjustment, emphasizing its influence on wellbeing. Objectives: To analyze the relationships between parenting practices, self-esteem, and life satisfaction, and test the mediating effect of self-esteem on the relationship between the different parenting practices and life satisfaction of adolescents. Method: The sample came to a total of 742 adolescents, with an average age of 15.63 (SD = 1.24; range 13–19). The Parenting Style Scale, the Rosenberg Self-Esteem Scale, and the Satisfaction with Life Scale were used. Results: Perception by adolescents of high levels of affect and communication, self-disclosure, and a sense of humor related to their parents, as well as low levels of psychological control, explained the life satisfaction of the adolescents. Self-esteem exerted a partial mediating effect on the relationship between parenting practices and satisfaction with the life of the adolescent. Finally, self-esteem also appeared to be a moderator variable, specifically in the effect of self-disclosure on the life satisfaction of the adolescent. Conclusions: The results reinforce the role of personal variables, especially self-esteem, in parent-child interaction and in the improved subjective wellbeing of the adolescent

Directed percolation effects emerging from superadditivity of quantum networks

Entanglement indcued non--additivity of classical communication capacity in networks consisting of quantum channels is considered. Communication lattices consisiting of butterfly-type entanglement breaking channels augmented, with some probability, by identity channels are analyzed. The capacity superadditivity in the network is manifested in directed correlated bond percolation which we consider in two flavours: simply directed and randomly oriented. The obtained percolation properties show that high capacity information transfer sets in much faster in the regime of superadditive communication capacity than otherwise possible. As a byproduct, this sheds light on a new type of entanglement based quantum capacity percolation phenomenon.Comment: 6 pages, 4 figure

Marketing Percolation

A percolation model is presented, with computer simulations for illustrations, to show how the sales of a new product may penetrate the consumer market. We review the traditional approach in the marketing literature, which is based on differential or difference equations similar to the logistic equation (Bass 1969). This mean field approach is contrasted with the discrete percolation on a lattice, with simulations of "social percolation" (Solomon et al 2000) in two to five dimensions giving power laws instead of exponential growth, and strong fluctuations right at the percolation threshold.Comment: to appear in Physica