Engineering Papers⌕ Search

Engineering topics

Chen, Dong

Publications and source records attributed to Chen, Dong.

115 records · Page 7

Cross-talk between integrins {alpha}1{beta}1 and {alpha}2{beta}1 in renal epithelial cells

The collagen-binding integrins {alpha}1{beta}1 and {alpha}2{beta}1 have profoundly different functions, yet they are often co-expressed in epithelial cells. When both integrins are expressed in the same cell, it has been suggested that {alpha}1{beta}1 negatively regulates integrin {alpha}2{beta}1-dependent functions. In this study we utilized murine ureteric bud (UB) epithelial cells, which express no functionally detectable levels of endogenous integrins {alpha}1{beta}1 and {alpha}2{beta}1, to determine the mechanism whereby this regulation occurs. We demonstrate that UB cells expressing integrin {alpha}2{beta}1, but not {alpha}1{beta}1 adhere, migrate and proliferate on collagen I as well as form cellular cords in 3D collagen I gels. Substitution of the transmembrane domain of the integrin {alpha}2 subunit with that of {alpha}1 results in decreased cell adhesion, migration and cord formation. In contrast, substitution of the integrin {alpha}2 cytoplasmic tail with that of {alpha}1, decreases cell migration and cord formation, but increases proliferation. When integrin {alpha}1 and {alpha}2 subunits are co-expressed in UB cells, the {alpha}1 subunit negatively regulates integrin {alpha}2{beta}1-dependent cord formation, adhesion and migration and this inhibition requires expression of both {alpha}1 and {alpha}2 tails. Thus, we provide evidence that the transmembrane and cytoplasmic domains of the {alpha}2 integrin subunit, as well as the {alpha}1 integrin subunit, regulate integrin {alpha}2{beta}1 cell function.

60 APPLIED LIFE SCIENCES↗

Global interrupt and barrier networks

A system and method for generating global asynchronous signals in a computing structure. Particularly, a global interrupt and barrier network is implemented that implements logic for generating global interrupt and barrier signals for controlling global asynchronous operations performed by processing elements at selected processing nodes of a computing structure in accordance with a processing algorithm; and includes the physical interconnecting of the processing nodes for communicating the global interrupt and barrier signals to the elements via low-latency paths. The global asynchronous signals respectively initiate interrupt and barrier operations at the processing nodes at times selected for optimizing performance of the processing algorithms. In one embodiment, the global interrupt and barrier network is implemented in a scalable, massively parallel supercomputing device structure comprising a plurality of processing nodes interconnected by multiple independent networks, with each node including one or more processing elements for performing computation or communication activity as required when performing parallel algorithm operations. One multiple independent network includes a global tree network for enabling high-speed global tree communications among global tree network nodes or sub-trees thereof. The global interrupt and barrier network may operate in parallel with the global tree network for providing global asynchronous sideband signals.

Blumrich, Matthias A↗

Data Capture Technique for High Speed Signaling

A data capture technique for high speed signaling to allow for optimal sampling of an asynchronous data stream. This technique allows for extremely high data rates and does not require that a clock be sent with the data as is done in source synchronous systems. The present invention also provides a hardware mechanism for automatically adjusting transmission delays for optimal two-bit simultaneous bi-directional (SiBiDi) signaling.

Barrett, Wayne Melvin↗

Methods and apparatus using commutative error detection values for fault isolation in multiple node computers

Methods and apparatus perform fault isolation in multiple node computing systems using commutative error detection values for--example, checksums--to identify and to isolate faulty nodes. When information associated with a reproducible portion of a computer program is injected into a network by a node, a commutative error detection value is calculated. At intervals, node fault detection apparatus associated with the multiple node computer system retrieve commutative error detection values associated with the node and stores them in memory. When the computer program is executed again by the multiple node computer system, new commutative error detection values are created and stored in memory. The node fault detection apparatus identifies faulty nodes by comparing commutative error detection values associated with reproducible portions of the application program generated by a particular node from different runs of the application program. Differences in values indicate a possible faulty node.

97 MATHEMATICS AND COMPUTING↗

Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

97 MATHEMATICS AND COMPUTING↗

Arithmetic functions in torus and tree networks

Methods and systems for performing arithmetic functions. In accordance with a first aspect of the invention, methods and apparatus are provided, working in conjunction of software algorithms and hardware implementation of class network routing, to achieve a very significant reduction in the time required for global arithmetic operation on the torus. Therefore, it leads to greater scalability of applications running on large parallel machines. The invention involves three steps in improving the efficiency and accuracy of global operations: (1) Ensuring, when necessary, that all the nodes do the global operation on the data in the same order and so obtain a unique answer, independent of roundoff error; (2) Using the topology of the torus to minimize the number of hops and the bidirectional capabilities of the network to reduce the number of time steps in the data transfer operation to an absolute minimum; and (3) Using class function routing to reduce latency in the data transfer. With the method of this invention, every single element is injected into the network only once and it will be stored and forwarded without any further software overhead. In accordance with a second aspect of the invention, methods and systems are provided to efficiently implement global arithmetic operations on a network that supports the global combining operations. The latency of doing such global operations are greatly reduced by using these methods.

Bhanot, Gyan↗

Optimized scalable network switch

In a massively parallel computing system having a plurality of nodes configured in m multi-dimensions, each node including a computing device, a method for routing packets towards their destination nodes is provided which includes generating at least one of a 2m plurality of compact bit vectors containing information derived from downstream nodes. A multilevel arbitration process in which downstream information stored in the compact vectors, such as link status information and fullness of downstream buffers, is used to determine a preferred direction and virtual channel for packet transmission. Preferred direction ranges are encoded and virtual channels are selected by examining the plurality of compact bit vectors. This dynamic routing method eliminates the necessity of routing tables, thus enhancing scalability of the switch.

97 MATHEMATICS AND COMPUTING↗