Self-routing lowest common ancestor networks

Multistage interconnection networks (MIN's) allow communication between terminals on opposing sides of a network. Lowest Common Ancestor Networks (LCAN's) [1] have switches capable of connecting bi-directional links in a permutation pattern that additionally permits communication between terminals on the same side. Self-routing LCAN's have interesting permutation routing capabilities and are highly partionable. This paper characterizes self-routing LCAN's and analyzes their permutation routing capabilities. It is shown that the routing network of the CM-5 is a particular instance of an LCAN

Expanded delta networks for very large parallel computers

In this paper we analyze a generalization of the traditional delta network, introduced by Patel [21], and dubbed Expanded Delta Network (EDN). These networks provide in general multiple paths that can be exploited to reduce contention in the network resulting in increased performance. The crossbar and traditional delta networks are limiting cases of this class of networks. However, the delta network does not provide the multiple paths that the more general expanded delta networks provide, and crossbars are to costly to use for large networks. The EDNs are analyzed with respect to their routing capabilities in the MIMD and SIMD models of computation.The concepts of capacity and clustering are also addressed. In massively parallel SIMD computers, it is the trend to put a larger number processors on a chip, but due to I/O constraints only a subset of the total number of processors may have access to the network. This is introduced as a Restricted Access Expanded Delta Network of which the MasPar MP-1 router network is an example

The effect of FPU architecture on a dynamic precision algorithm for the solution of differential equations

Solution of lnitial Value Problems (IVPs) is an important application in scientific computing. Methods for solving these problems use techniques for reducing the error and increasing the speed of the computation. This paper introduces a class of algorithms which dynamically reconfigure their operating parameters to reduce the computation time. By dynamically varying the precision of the arithmetic being performed, it is possible to obtain dramatic speedups on certain architectures when solving IVPs. This paper illustrates how various architectures impact on a dynamic precision version of the Runge-Kutta-Fehlberg algorithm. It is shown that a speedup of over 30 percent is possible for both massively parallel processors and vector supercomputers

Lowest common ancestor interconnection networks

Lowest Common Ancestor (LCA) networks are built using switches capable of connecting u + d inputs/outputs in a permutation pattern. For n source nodes and I stages of switches, n/d switches are used in stage l - n/d - u/d in stage l - 2, and in general , n-u^l-i-l/d^l-i switches in stage i. The resulting hierarchical structure possesses interesting connectivity and permutational properties. A full characterization of LCA networks is presented together with a permutation routing algorithm for a family of LCA networks. The algorithm uses the network itself to collect and disseminate information about the permutation. A schedule of O(dp log_d/u n) passes is obtained with a switch set-up cost factor of O(log_d/u n) (p is the minimum number of passes that an algorithm with global knowledge schedules)

Rhombomere rotation reveals that multiple mechanisms contribute to the segmental pattern of hindbrain neural crest migration

Hindbrain neural crest cells adjacent to rhombomeres 2 (r2), r4 and r6 migrate in a segmental pattern, toward the first, second and third branchial arches, respectively. Although all rhombomeres generate neural crest cells, those arising from r3 and r5 deviate rostrally and caudally (J. Sechrist, G. Serbedzija, T. Scherson, S. Fraser and M. Bronner-Fraser (1993) Development 118, 691–703). We have altered the rostrocaudal positions of the cranial neural tube, adjacent ectoderm/mesoderm or presumptive otic vesicle to examine tissue influences on this segmental migratory pattern. After neural tube rotation, labeled neural crest cells follow pathways generally appropriate for their new position after grafting. For example, when r3 and r4 were transposed, labeled r3 cells migrated laterally to the second branchial arch whereas labeled r4 cells primarily deviated caudally toward the second arch, with some cells moving rostrally toward the first. In contrast to r4 neural crest cells, transposed r3 cells leave the neural tube surface in a polarized manner, near the r3/4 border. Surprisingly, some labeled neural crest cells moved directionally toward small ectopic otic vesicles that often formed in the ectoderm adjacent to grafted r4. Similarly, they moved toward grafted or displaced otic vesicles. In contrast, surgical manipulation of the mesoderm adjacent to r3 and r4 had no apparent effects. Our results offer evidence that neural crest cells migrate directionally toward the otic vesicle, either by selective attraction or pathway-derived cues

Shortest paths in orthogonal graphs

Orthogonal graphs were introduced as a simple but powerful tool for the description and analysis of a class of interconnection networks. Routing, and hence finding shortest paths between any two nodes of an orthogonal graph, becomes an important problem. It is shown in this paper that routing in this class of graphs reduces to a node covering problem in the bipartite coverage graph of the orthogonal graph. A minimum cover clearly leads to a shortest path. In general, the problem of finding the mínimum node cover in a bipartite graph is NP-complete. However, the bipartite coverage graphs corresponding to orthogonal graphs have a regular pattern of edges. This allows the development of a routing algorithm which results in a minimum cover. The procedure executes in polynomial time in the number of bit-nodes of the bipartite graph. It therefore results in a shortest path algorithm whose time complexity is quadratic in the logarithm of the number of nodes in the original orthogonal graph

The manufacturing microbe

In all industrialized countries, the manufacturing industry appears to be in difficulty: the costs of maintaining skilled workers to do complicated technical tasks are becoming a major hurdle. The fact that a majority of the young pro-fessionals will spend their whole lives just typing in front of a screen is worrying plenty of sociologists, particularly because of the simple fact that our brains apparently are sparked to creativity by being involved in complex han-dling – read manufacturing – exercises (Sennett, 2013). At this moment, the overall environmental biotech is undergoing a major shift, driven by the need to help to abate climate changes. Until now, it has been dealing with tasks of making unwanted compounds disappear: to degrade contaminants, to remove waste and to eliminate unwanted microbial propagules. In industrialized coun

Perovskite oxides: Oxygen electrocatalysis and bulk structure

Perovskite type oxides were considered for use as oxygen reduction and generation electrocatalysts in alkaline electrolytes. Perovskite stability and electrocatalytic activity are studied along with possible relationships of the latter with the bulk solid state properties. A series of compounds of the type LaFe(x)Ni1(-x)O3 was used as a model system to gain information on the possible relationships between surface catalytic activity and bulk structure. Hydrogen peroxide decomposition rate constants were measured for these compounds. Ex situ Mossbauer effect spectroscopy (MES), and magnetic susceptibility measurements were used to study the solid state properties. X ray photoelectron spectroscopy (XPS) was used to examine the surface. MES has indicated the presence of a paramagnetic to magnetically ordered phase transition for values of x between 0.4 and 0.5. A correlation was found between the values of the MES isomer shift and the catalytic activity for peroxide decomposition. Thus, the catalytic activity can be correlated to the d-electron density for the transition metal cations

Microbatteries and Advanced Battery Design

https://commons.case.edu/glei-events/1025/thumbnail.jp