Multiphase complete exchange on a circuit switched hypercube

On a distributed memory parallel computer, the complete exchange (all-to-all personalized) communication pattern requires each of n processors to send a different block of data to each of the remaining n - 1 processors. This pattern is at the heart of many important algorithms, most notably the matrix transpose. For a circuit switched hypercube of dimension d(n = 2(sup d)), two algorithms for achieving complete exchange are known. These are (1) the Standard Exchange approach that employs d transmissions of size 2(sup d-1) blocks each and is useful for small block sizes, and (2) the Optimal Circuit Switched algorithm that employs 2(sup d) - 1 transmissions of 1 block each and is best for large block sizes. A unified multiphase algorithm is described that includes these two algorithms as special cases. The complete exchange on a hypercube of dimension d and block size m is achieved by carrying out k partial exchange on subcubes of dimension d(sub i) Sigma(sup k)(sub i=1) d(sub i) = d and effective block size m(sub i) = m2(sup d-di). When k = d and all d(sub i) = 1, this corresponds to algorithm (1) above. For the case of k = 1 and d(sub i) = d, this becomes the circuit switched algorithm (2). Changing the subcube dimensions d, varies the effective block size and permits a compromise between the data permutation and block transmission overhead of (1) and the startup overhead of (2). For a hypercube of dimension d, the number of possible combinations of subcubes is p(d), the number of partitions of the integer d. This is an exponential but very slowly growing function and it is feasible over these partitions to discover the best combination for a given message size. The approach was analyzed for, and implemented on, the Intel iPSC-860 circuit switched hypercube. Measurements show good agreement with predictions and demonstrate that the multiphase approach can substantially improve performance for block sizes in the 0 to 160 byte range. This range, which corresponds to 0 to 40 floating point numbers per processor, is commonly encountered in practical numeric applications. The multiphase technique is applicable to all circuit-switched hypercubes that use the common e-cube routing strategy

A network flow model for load balancing in circuit-switched multicomputers

In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends largely on link contention - the variation due to distance between nodes is negligible. This has a major impact on the load balancing problem. In this case, there are some nodes with excess load (sources) and others with deficit load (sinks) and it is required to find a matching of sources to sinks that avoids contention. The problem is made complex by the hardwired routing on currently available machines: the user can control only which nodes communicate but not how the messages are routed. Network flow models of message flow in the mesh and the hypercube were developed to solve this problem. The crucial property of these models is the correspondence between minimum cost flows and correctly routed messages. To solve a given load balancing problem, a minimum cost flow algorithm is applied to the network. This permits one to determine efficiently a maximum contention free matching of sources to sinks which, in turn, tells one how much of the given imbalance can be eliminated without contention

Efficient algorithms for a class of partitioning problems

The problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems is addressed. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. Polynomial exact and approximate algorithms are described for this class that are better than any of the previously reported algorithms. The approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic take can then be carried out using fast search techniques

Pro-poor growth: concepts and measurement with country case studies

.Poverty, inequality, pro-poor, Korea, Thailand, Vi

Effect of torch angle on arc properties and weld pool shape in stationary GTAW

In this paper, a three dimensional numerical simulation is performed on a stationary arc to study the effect of torch angle in gas tungsten arc welding (GTAW) of SS304 stainless steel. A comparison has been made to investigate 90o and 70o torch angles and analyze the effect on arc and weld pool shape. Current density, heat flux and gas shear stress are calculated in the arc region and are used as input to the workpiece to determine the weld pool. Buoyancy and Marangoni shear also affect the weld pool shape and are taken into account. The computed and experimental results are observed symmetric for 90o torch angle. For 70o torch angle, current density and hence the heat flux due to electron contribution is found the maximum behind and heat flux due to conduction and convection is found the maximum ahead of the electrode tip in the welding direction. This makes the maximum of total heat flux symmetric along the arc center. Heat flux due to conduction and convection decreases as the torch angle decreases resulting in a shallow weld pool. The nonsymmetric “w” shaped weld pool is developed by the combined effect of the gas shear and Marangoni convection. It is found that for 70o torch angle, the weld pool becomes non-symmetric, shallow and wide ahead of the electrode tip in the welding direction. The numerical weld pool shapes are verified through experiments

Establishing Property Rights through a Secure System of Land Title Management

Land is a critical economic asset in any economy. The need for a timely, accurate, safe, simple, secure, and universally accessible system of registering and recording land transactions and interest in land is the cornerstone of a proper land market. Such land markets are an important mechanism to empower the poor and reduce the costs of doing business.1 Secure property rights provide asset owners the incentive to invest in their property while allowing easier collateralisation. Without secure tradable property rights, land is ‘dead capital’

Chiral Nonet Mixing in pi pi Scattering

Pion pion scattering is studied in a generalized linear sigma model which contains two scalar nonets (one of quark-antiquark type and the other of diquark-antidiquark type) and two corresponding pseudoscalar nonets. An interesting feature concerns the mixing of the four isosinglet scalar mesons which yield poles in the scattering amplitude. Some realism is introduced by enforcing exact unitarity via the K-matrix method. It is shown that a reasonable agreement with experimental data is obtained up to about 1 GeV. The poles in the unitarized scattering amplitude are studied in some detail. The lowest pole clearly represents the sigma meson (or f0(600)) with a mass and decay width around 500 MeV. The second pole invites comparison with the f0(980) which has a mass around 1 GeV and decay width around 100 MeV. The third and fourth poles, resemble some of the isosinglet state in the complicated 1-2 GeV region. Some comparison is made to the situation in the usual SU(3) linear sigma model with a single scalar nonet